FOM: unsurveyability

[Charles Silver]

On Tue, 6 Oct 1998, Vladimir Sazonov wrote:

> There exist however classically inconsistent formal theories 
> (initiated by R.Parikh) formalizing feasibility concept which 
> I described here in fom. It can be shown that the shortest 
> proof of contradiction in these systems has the length > 
> approx. 2^1000. 

	I somehow missed this.  Could you please provide a reference to
the article or book by Parikh in which such systems are featured?  Are any
of these systems non ad-hoc and "natural"?

Charlie Silver