scientific article; zbMATH DE number 1144041

zbMATH Open0889.03053MaRDI QIDQ4384146FDOQ4384146

Authors: Petr Hájek, Pavel Pudlák 

Publication date: 20 April 1998

Title of this publication is not available (Why is that?)

zbMATH Keywords

consistencyinterpretabilitybounded arithmeticmodel theoryconservativityrecursion theoryincompletenessprovabilityself-referenceindicatorsfragments of arithmeticdefinable cutsreflexive theoriescombinatorics in fragmentsfoundations of arithmetic of natural numberspartial truth definitionswitnessing functions

Mathematics Subject Classification ID

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

Cited In (79)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4384146)