Results 1 
5 of
5
On Bounded Set Theory
"... We consider some Bounded Set Theories (BST), which are analogues to Bounded Arithmetic. Corresponding provablyrecursive operations over sets are characterized in terms of explicit definability and PTIME or LOGSPACEcomputability. We also present some conservativity results and describe a relation ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We consider some Bounded Set Theories (BST), which are analogues to Bounded Arithmetic. Corresponding provablyrecursive operations over sets are characterized in terms of explicit definability and PTIME or LOGSPACEcomputability. We also present some conservativity results and describe a relation between BST, possibly with AntiFoundation Axiom, and a Logic of Inductive Definitions (LID) and Finite Model Theory.
Cycling in proofs and feasibility
 Transactions of the American Mathematical Society
, 1998
"... Abstract. There is a common perception by which small numbers are considered more concrete and large numbers more abstract. A mathematical formalization of this idea was introduced by Parikh (1971) through an inconsistent theory of feasible numbers in which addition and multiplication are as usual b ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
(Show Context)
Abstract. There is a common perception by which small numbers are considered more concrete and large numbers more abstract. A mathematical formalization of this idea was introduced by Parikh (1971) through an inconsistent theory of feasible numbers in which addition and multiplication are as usual but for which some very large number is defined to be not feasible. Parikh shows that sufficiently short proofs in this theory can only prove true statements of arithmetic. We pursue these topics in light of logical flow graphs of proofs (Buss, 1991) and show that Parikh’s lower bound for concrete consistency reflects the presence of cycles in the logical graphs of short proofs of feasibility of large numbers. We discuss two concrete constructions which show the bound to be optimal and bring out the dynamical aspect of formal proofs. For this paper the concept of feasible numbers has two roles, as an idea with its own life and as a vehicle for exploring general principles on the dynamics and geometry of proofs. Cycles can be seen as a measure of how complicated a proof can be. We prove that short proofs must have cycles. 1.
Naïve computational type theory
 Proof and SystemReliability, Proceedings of International Summer School Marktoberdorf, July 24 to August 5, 2001, volume 62 of NATO Science Series III
, 2002
"... ..."