Metamathematics of first-order arithmetic.
From MaRDI portal
bounded arithmeticcombinatorics in fragmentsconservativityconsistencydefinable cutsfoundations of arithmetic of natural numbersfragments of arithmeticincompletenessindicatorsinterpretabilitymodel theorypartial truth definitionsprovabilityrecursion theoryreflexive theoriesself-referencewitnessing functions
See the review of the original edition (Berlin, 1993), in Zbl 0781.03047.
Cited in
(90)- On constructivity and the Rosser property: a closer look at some Gödelean proofs
- Real closures of models of weak arithmetic
- Computability issues for adaptive logics in multi-consequence standard format
- The implicit commitment of arithmetical theories and its semantic core
- Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts
- A note on uniform density in weak arithmetical theories
- Empiricism, probability, and knowledge of arithmetic: a preliminary defense
- \(\mathsf{WKL}_0\) and induction principles in model theory
- On the value group of a model of Peano arithmetic
- Herbrand consistency of some finite fragments of bounded arithmetical theories
- Interpretability suprema in Peano arithmetic
- Syntactical truth predicates for second order arithmetic
- Comparing the strength of diagonally nonrecursive functions in the absence of _2⁰ induction
- On elementary theories of ordinal notation systems based on reflection principles
- Herbrand consistency of some arithmetical theories
- Term extraction and Ramsey's theorem for pairs
- Logicism, interpretability, and knowledge of arithmetic
- The strength of the SCT criterion
- Chain conditions in computable rings
- A pluralist approach to the formalisation of mathematics
- Proof theory in philosophy of mathematics
- On principles between _1- and _2-induction, and monotone enumerations
- Reverse mathematical bounds for the termination theorem
- A combinatorial bound for a restricted form of the termination theorem
- The monotone completeness theorem in constructive reverse mathematics
- The epsilon-reconstruction of theories and scientific structuralism
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Transfer and a supremum principle for ERNA
- On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics
- The atomic model theorem and type omitting
- Gödelizing the Yablo sequence
- The paradox of the knower revisited
- Primitive recursion and the chain antichain principle
- Comparing Peano arithmetic, Basic Law V, and Hume's Principle
- Strict finitism, feasibility, and the sorites
- On the logical strengths of partial solutions to mathematical problems
- Σ_{𝑛}-bounding and Δ_{𝑛}-induction
- The versatility of universality in \textit{Principia mathematica}
- Random reals, the rainbow Ramsey theorem, and arithmetic conservation
- Gödel's second incompleteness theorem: how it is derived and what it delivers
- THE MODAL LOGICS OF KRIPKE–FEFERMAN TRUTH
- ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS
- Reflection ranks and ordinal analysis
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
- Topological models of arithmetic
- An inside/outside Ramsey theorem and recursion theory
- A note on fragments of uniform reflection in second order arithmetic
- A marriage of Brouwer's intuitionism and Hilbert's finitism. I: Arithmetic
- Randomness notions and reverse mathematics
- Reverse mathematics of the finite downwards closed subsets of ordered by inclusion and adjacent Ramsey for fixed dimension
- A remark on pseudo proof systems and hard instances of the satisfiability problem
- Clause set cycles and induction
- Honest elementary degrees and degrees of relative provability without the cupping property
- Equivalences for truth predicates
- The prehistory of the subsystems of second-order arithmetic
- The strength of abstraction with predicative comprehension
- Notes on bounded induction for the compositional truth predicate
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- Realizability semantics for quantified modal logic: generalizing Flagg's 1985 construction
- VON NEUMANN’S CONSISTENCY PROOF
- Realizability interpretation of PA by iterated limiting PCA
- FINITIST AXIOMATIC TRUTH
- THE POTENTIAL IN FREGE’S THEOREM
- Bounded finite set theory
- Primitive recursive reverse mathematics
- Internal categoricity, truth and determinacy
- The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem
- ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS
- A step towards absolute versions of metamathematical results
- (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE
- More infinity for a better finitism
- Varieties of truth definitions
- Indiscernibles and satisfaction classes in arithmetic
- Complexity barriers as independence
- Erdős-Moser and I _2
- A theory of implicit commitment
- Enumerating error bounded polytime algorithms through arithmetical theories
- ^0_4 conservation of Ramsey's theorem for pairs
- On classical determinate truth
- Reflexivity of -consistency in a general setting
- What a set is: the V-view
- Numeral completeness of weak theories of arithmetic
- General notions of consistency
- A parameterized halting problem, _0 truth and the MRDP theorem
- The provably total functions of basic arithmetic and its extensions
- Principles for object-linguistic consequence: from logical to irreflexive
- Universal properties of truth
- Finite sets and infinite sets in weak intuitionistic arithmetic
- Polynomially bounded recursive realizability
- On two problems concerning end extensions
This page was built for publication: Metamathematics of first-order arithmetic.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4384146)
