Truth, disjunction, and induction

DOI10.1007/s00153-018-0657-9zbMath1477.03250arXiv1805.09890OpenAlexW2963814935WikidataQ128415550 ScholiaQ128415550MaRDI QIDQ2312097

Ali Enayat, Fedor N. Pakhomov

Publication date: 4 July 2019

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.09890

zbMATH Keywords

conservativityaxiomatic truthcompositional theory of truth

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items

Reflection algebras and conservation results for theories of iterated truth ⋮ Hyperarithmetical worm battles ⋮ Full satisfaction classes, definability, and automorphisms ⋮ The two halves of disjunctive correctness ⋮ MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE ⋮ Compositional truth with propositional tautologies and quantifier-free correctness ⋮ AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW ⋮ Pathologies in satisfaction classes ⋮ DISJUNCTIONS WITH STOPPING CONDITIONS ⋮ REFLECTION RANKS AND ORDINAL ANALYSIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From hierarchies to well-foundedness
• Deflationary truth and pathologies
• Solution of a problem of Leon Henkin
• CONSERVATIVITY FOR THEORIES OF COMPOSITIONAL TRUTH VIA CUT ELIMINATION
• Computability and Logic
• Bounded Induction and Satisfaction Classes
• Construction of Satisfaction Classes for Nonstandard Models
• REFLECTION RANKS AND ORDINAL ANALYSIS
• From Tarski to Gödel—or how to derive the second incompleteness theorem from the undefinability of truth without self-reference
• NOTES ON BOUNDED INDUCTION FOR THE COMPOSITIONAL TRUTH PREDICATE