DISJUNCTIONS WITH STOPPING CONDITIONS

DOI10.1017/BSL.2019.55OpenAlexW3118621836MaRDI QIDQ5019780FDOQ5019780

Authors: Roman Kossak, Bartosz Wcisło 

Publication date: 11 January 2022

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

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

Recommendations

• The two halves of disjunctive correctness
• Truth, disjunction, and induction
• Models of \(\mathrm{PT}^-\) with internal induction for total formulae
• Interpreting the compositional truth predicate in models of arithmetic
• Compositional truth with propositional tautologies and quantifier-free correctness

zbMATH Keywords

Peano arithmeticmodels of arithmeticrecursive saturationsatisfaction classestruth theoriestruth predicates

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Philosophical aspects of logic and foundations (03A99)

Cites Work

• Full Satisfaction Classes and Recursive Saturation
• Title not available (Why is that?)
• Bounded Induction and Satisfaction Classes
• Nonstandard definability
• Truth, disjunction, and induction
• Models of \(\mathrm{PT}^-\) with internal induction for total formulae
• Models of weak theories of truth

Cited In (6)

• TRUTH AND FEASIBLE REDUCIBILITY
• Disjunctions with stopping condition
• Compositional truth with propositional tautologies and quantifier-free correctness
• Full satisfaction classes, definability, and automorphisms
• Saturation properties for compositional truth with propositional correctness
• AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW

This page was built for publication: DISJUNCTIONS WITH STOPPING CONDITIONS

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