Transductions in arithmetic
From MaRDI portal
Publication:904144
DOI10.1016/j.apal.2015.11.002zbMath1357.03043MaRDI QIDQ904144
Publication date: 12 January 2016
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2015.11.002
03B25: Decidability of theories and sets of sentences
03F30: First-order arithmetic and fragments
03F45: Provability logics and related algebras (e.g., diagonalizable algebras)
03F25: Relative consistency and interpretations
Related Items
The Interpretation Existence Lemma, A NOTE ON DERIVABILITY CONDITIONS, Arithmetical completeness theorems for monotonic modal logics, The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The unprovability of small inconsistency. A study of local and global interpretability
- The logic of \(\Pi_ 1\)-conservativity
- A paradox regained
- A note on syntactical treatments of modality
- Provability: The emergence of a mathematical modality
- Provability interpretations of modal logic
- On the algebraization of a Feferman's predicate. (The algebraization of theories which express Theor; X)
- Peano's smart children: A provability logical study of systems with built-in consistency
- The logic of \(\Pi_ 1\)-conservativity continued
- A smart child of Peano's
- Possible-worlds semantics for modal notions conceived as predicates
- The interpretability logic of all reasonable arithmetical theories. The new conjecture
- Provability algebras and proof-theoretic ordinals. I
- A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic
- Slow consistency
- The role of quantifier alternations in cut elimination
- On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
- Can We Make the Second Incompleteness Theorem Coordinate Free?
- Solution of a problem of Leon Henkin
- Arithmetization of metamathematics in a general setting
- Reflection principles and provability algebras in formal arithmetic
- The Henkin Sentence
- A lattice of chapters of mathematics (interpretations between theorems [theories)]
- Modal Matters for Interpretability Logics
- CARDINAL ARITHMETIC IN THE STYLE OF BARON VON MÜNCHHAUSEN
- Cuts, consistency statements and interpretations
- Provability logic—a short introduction
- Biological Perspectives Irreversible Lithium-Induced Neuropathy: Two Cases
- Some Prime Elements in the Lattice of Interpretability Types
- The interpretability logic of Peano arithmetic
- The Second Incompleteness Theorem: Reflections and Ruminations
- Computer Science Logic
- Cut Elimination In Situ
- Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories
- A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic
- No future
