scientific article; zbMATH DE number 1144041

Publication date: 20 April 1998

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

consistency model theory provability bounded arithmetic interpretability incompleteness self-reference recursion theory conservativity indicators fragments of arithmetic definable cuts reflexive theories combinatorics in fragments foundations of arithmetic of natural numbers partial truth definitions witnessing functions

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30)

Related Items (75)

An inside/outside Ramsey theorem and recursion theory ⋮ On the value group of a model of Peano arithmetic ⋮ Proof Theory in Philosophy of Mathematics ⋮ On elementary theories of ordinal notation systems based on reflection principles ⋮ A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC ⋮ Herbrand consistency of some finite fragments of bounded arithmetical theories ⋮ Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts ⋮ Reverse mathematical bounds for the termination theorem ⋮ Σ_{𝑛}-bounding and Δ_{𝑛}-induction ⋮ On principles between ∑1- and ∑2-induction, and monotone enumerations ⋮ Herbrand consistency of some arithmetical theories ⋮ Term extraction and Ramsey's theorem for pairs ⋮ The epsilon-reconstruction of theories and scientific structuralism ⋮ On constructivity and the Rosser property: a closer look at some Gödelean proofs ⋮ A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC ⋮ Interpretability suprema in Peano arithmetic ⋮ STRICT FINITISM, FEASIBILITY, AND THE SORITES ⋮ LOGICISM, INTERPRETABILITY, AND KNOWLEDGE OF ARITHMETIC ⋮ Gödelizing the Yablo sequence ⋮ The paradox of the knower revisited ⋮ THE STRENGTH OF ABSTRACTION WITH PREDICATIVE COMPREHENSION ⋮ THE POTENTIAL IN FREGE’S THEOREM ⋮ Bounded finite set theory ⋮ Primitive recursive reverse mathematics ⋮ Internal categoricity, truth and determinacy ⋮ Real closures of models of weak arithmetic ⋮ Transfer and a supremum principle for ERNA ⋮ RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem ⋮ 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 ⋮ ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS ⋮ NOTES ON BOUNDED INDUCTION FOR THE COMPOSITIONAL TRUTH PREDICATE ⋮ A step towards absolute versions of metamathematical results ⋮ (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ More infinity for a better finitism ⋮ Primitive recursion and the chain antichain principle ⋮ Comparing Peano arithmetic, Basic Law V, and Hume's Principle ⋮ A note on uniform density in weak arithmetical theories ⋮ The Strength of the SCT Criterion ⋮ A Combinatorial Bound for a Restricted Form of the Termination Theorem ⋮ On two problems concerning end extensions ⋮ On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics ⋮ Syntactical truth predicates for second order arithmetic ⋮ The Monotone Completeness Theorem in Constructive Reverse Mathematics ⋮ On the logical strengths of partial solutions to mathematical problems ⋮ Honest elementary degrees and degrees of relative provability without the cupping property ⋮ The Versatility of Universality inPrincipia Mathematica ⋮ Empiricism, probability, and knowledge of arithmetic: a preliminary defense ⋮ Random reals, the rainbow Ramsey theorem, and arithmetic conservation ⋮ REALIZABILITY SEMANTICS FOR QUANTIFIED MODAL LOGIC: GENERALIZING FLAGG’S 1985 CONSTRUCTION ⋮ VON NEUMANN’S CONSISTENCY PROOF ⋮ Realizability interpretation of PA by iterated limiting PCA ⋮ Computability issues for adaptive logics in multi-consequence standard format ⋮ Principles for object-linguistic consequence: from logical to irreflexive ⋮ COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION ⋮ Chain conditions in computable rings ⋮ The implicit commitment of arithmetical theories and its semantic core ⋮ A pluralist approach to the formalisation of mathematics ⋮ The atomic model theorem and type omitting ⋮ GÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERS ⋮ Unnamed Item ⋮ Finite sets and infinite sets in weak intuitionistic arithmetic ⋮ THE MODAL LOGICS OF KRIPKE–FEFERMAN TRUTH ⋮ ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS ⋮ Combinatorial principles weaker than Ramsey's Theorem for pairs ⋮ \(\mathsf{WKL}_0\) and induction principles in model theory ⋮ REFLECTION RANKS AND ORDINAL ANALYSIS ⋮ EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS ⋮ Topological models of arithmetic ⋮ EQUIVALENCES FOR TRUTH PREDICATES ⋮ THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC ⋮ FINITIST AXIOMATIC TRUTH ⋮ Polynomially bounded recursive realizability

This page was built for publication: