Cuts, consistency statements and interpretations
From MaRDI portal
Publication:3686709
DOI10.2307/2274231zbMATH Open0569.03024OpenAlexW2169685450WikidataQ57310302 ScholiaQ57310302MaRDI QIDQ3686709FDOQ3686709
Authors: Pavel Pudlák
Publication date: 1985
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274231
Cites Work
- Title not available (Why is that?)
- Axiomatizability by a schema
- Modal analysis of generalized rosser sentences
- Gödel's Second incompleteness theorem for Q
- Bounds for proof-search and speed-up in the predicate calculus
- Fundamenta Mathematicae: An Examination of Its Founding and Significance
- Relative Interpretations
- On certain lattices of degrees of interpretability
- Redundancies in the Hilbert-Bernays derivability conditions for Gödel's second incompleteness theorem
Cited In (54)
- The unprovability of small inconsistency. A study of local and global interpretability
- Interpretability degrees of finitely axiomatized sequential theories
- A note on typed truth and consistency assertions
- 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000. La Sorbonne, Paris, France, July 23-31, 2000
- On the number of steps in proofs
- Deflationary truth and the ontology of expressions
- How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
- On \(\mathsf{Q}\)
- Sequence encoding without induction
- Rules and arithmetics
- Faith \& falsity
- The formalization of interpretability
- Transductions in arithmetic
- SELF-REFERENCE UPFRONT: A STUDY OF SELF-REFERENTIAL GÖDEL NUMBERINGS
- Equational treatment of first-order logic
- Fragment of Nonstandard Analysis with a Finitary Consistency Proof
- Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic
- Sequential theories and infinite distributivity in the lattice of chapters
- Friedman-reflexivity
- Current research on Gödel's incompleteness theorems
- On the provability logic of bounded arithmetic
- The second incompleteness theorem and bounded interpretations
- Reflection algebras and conservation results for theories of iterated truth
- Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem
- Self-verifying axiom systems, the incompleteness theorem and related reflection principles
- Passive induction and a solution to a Paris-Wilkie open question
- Order types of models of fragments of Peano arithmetic
- Recursive functions and existentially closed structures
- The interpretation existence lemma
- The small-is-very-small principle
- The predicative Frege hierarchy
- Title not available (Why is that?)
- Pairs, sets and sequences in first-order theories
- On mathematical instrumentalism
- An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency
- The arithmetics of a theory
- A note on proofs of falsehood
- Categorical characterizations of the natural numbers require primitive recursion
- The implicit commitment of arithmetical theories and its semantic core
- The axiom system \(\mathrm{I}\Sigma_{0}\) manages to simultaneously obey and evade the Herbrandized version of the second incompleteness theorem
- A note on the interpretability logic of finitely axiomatized theories
- Herbrand consistency of some arithmetical theories
- A generalization of the second incompleteness theorem and some exceptions to it
- Truth and speed-up
- 2005 Annual Meeting of the Association for Symbolic Logic
- Peano Corto and Peano Basso: a study of local induction in the context of weak theories
- AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW
- The logical strength of compositional principles
- Bounded arithmetic, proof complexity and two papers of Parikh
- A small reflection principle for bounded arithmetic
- Another look at the second incompleteness theorem
- On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency
- Consistency and the theory of truth
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05
This page was built for publication: Cuts, consistency statements and interpretations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686709)