On Feasible Numbers

A formal approach to feasible numbers, as well as to middle and small numbers, is introduced, based on ideas of Parikh (1971) and improving his formalization. The “vague” set F of feasible numbers intuitively satisfies the axioms 0 ∈ F, F+1⊑F and 21000 ∉ F, where the latter is stronger than a condition considered by Parikh, and seems to be treated rigorously here for the first time. Our technical considerations, though quite simple, have some unusual consequences. A discussion of methodological questions and of relevance to the foundations of mathematics and of computer science is an essential part of the paper.

[1]  Stephen A. Cook,et al.  Functional interpretations of feasibly constructive arithmetic , 1989, STOC '89.

[2]  Stephen A. Cook,et al.  Functional Interpretations of Feasibly Constructive Arithmetic , 1993, Ann. Pure Appl. Log..

[3]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[4]  R. Gandy.  Limitations to Mathematical Knowledge , 1982 .

[5]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[6]  Yuri Gurevich,et al.  Algebras of feasible functions , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[7]  Jan Krajícek,et al.  Bounded arithmetic, propositional logic, and complexity theory , 1995, Encyclopedia of mathematics and its applications.

[8]  V. Sazonov,et al.  An Equivalence between Polynomial Constructivity of Markov’s Principle and the Equality P=NP , 1990 .

[9]  Rohit Parikh,et al.  Existence and feasibility in arithmetic , 1971, Journal of Symbolic Logic.

[10]  Petr Hájek,et al.  Metamathematics of First-Order Arithmetic , 1993, Perspectives in mathematical logic.

[11]  P. Vopenka,et al.  Mathematics in the alternative set theory , 1979 .

[12]  Samuel R. Buss,et al.  The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic , 1986, SCT.

[13]  R. Statman.  Lower bounds on Herbrand’s theorem , 1979 .

[14]  Albert G. Dragálin.  Correctness of inconsistent theories with notions of feasibility , 1984, Symposium on Computation Theory.

[15]  Neil Immerman,et al.  Relational queries computable in polynomial time (Extended Abstract) , 1982, STOC '82.

[16]  外史 竹内.  Bounded Arithmetic と計算量の根本問題 , 1996 .

[17]  R. Statman.  Bounds for proof-search and speed-up in the predicate calculus , 1978 .

[18]  A. Selman.  Structure in Complexity Theory , 1986, Lecture Notes in Computer Science.

[19]  Jan Krajicek.  Bounded Arithmetic, Propositional Logic, and Complexity Theory: Preliminaries , 1995 .

[20]  W. V. Quine,et al.  Natural deduction , 2021, An Introduction to Proof Theory.

[21]  A. Troelstra,et al.  Constructivism in Mathematics: An Introduction , 1988 .

[22]  Vladimir Yu. Sazonov,et al.  A Logical Approach to the Problem "P=NP?" , 1980, MFCS.

[23]  Stephen A. Cook,et al.  Feasibly constructive proofs and the propositional calculus (Preliminary Version) , 1975, STOC.

[24]  Vladimir Yu. Sazonov.  Polynomial Computability and Recursivity in Finite Domains , 1980, J. Inf. Process. Cybern..

[25]  Vladimir Yu. Sazonov,et al.  Bounded Set Theory and Polynominal Computability , 1987, FCT.