scientific article; zbMATH DE number 3999883

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

arithmetic induction principle predicativity foundation of mathematics bounded least number principle existence of a predecessor number constructions provable consistent elementary mathematics

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Nonstandard models of arithmetic (03H15) Inductive definability (03D70)

Related Items

PREDICATIVISM AS A FORM OF POTENTIALISM, Sharpened lower bounds for cut elimination, A new “feasible” arithmetic, How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q, Burgess’PVis Robinson’sQ, Strong Logics of First and Second Order, Iterated multiplication in \(VTC^0\), Error and Predicativity, Toward the limits of the Tennenbaum phenomenon, On parallel hierarchies and \(R_k^i\), STRICT FINITISM, FEASIBILITY, AND THE SORITES, LOGICISM, INTERPRETABILITY, AND KNOWLEDGE OF ARITHMETIC, Passive induction and a solution to a Paris-Wilkie open question, A small reflection principle for bounded arithmetic, SELF-REFERENCE UPFRONT: A STUDY OF SELF-REFERENTIAL GÖDEL NUMBERINGS, On feasible numbers, On parallel hierarchies and R ki, Intrinsic theories and computational complexity, To be or not to be constructive, that is not the question, Cobham recursive set functions, On \(\mathsf{Q}\), POINCARÉ–WEYL’S PREDICATIVITY: GOING BEYOND, Taking the Pirahã seriously, The logical strength of compositional principles, Weak theories of concatenation and arithmetic, The formalization of interpretability, Weyl and Intuitionistic Infinitesimals, Objectivity and Truth in Mathematics: A Sober Non-platonist Perspective, Pairs, sets and sequences in first-order theories, MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY, Sets and supersets, Self-verifying axiom systems, the incompleteness theorem and related reflection principles, Functional interpretations of feasibly constructive arithmetic, The scope of Gödel's first incompleteness theorem, Predicative logic and formal arithmetic, The predicative Frege hierarchy, A generalization of the second incompleteness theorem and some exceptions to it, Cycling in proofs and feasibility, Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem, The Interpretation Existence Lemma, Tiered Arithmetics, Predicativity and Feferman, The implicit commitment of arithmetical theories and its semantic core, On the mathematical and foundational significance of the uncountable, \(S^ i_ 3\) and \(\overset\circ V^ i_ 2(BD)\), FINDING THE LIMIT OF INCOMPLETENESS I, An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency, Automated higher-order complexity analysis, Predicativity and constructive mathematics, On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency, Inductive definitions over a predicative arithmetic, Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity, Bounded arithmetic, proof complexity and two papers of Parikh, Hereditarily-finite sets, data bases and polynomial-time computability, Taking formalism seriously, Groundwork for weak analysis