DISJUNCTIONS WITH STOPPING CONDITIONS

DOI10.1017/BSL.2019.55OpenAlexW3118621836MaRDI QIDQ5019780

Bartosz Wcisło, Roman Kossak

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

zbMATH Keywords

Peano arithmeticmodels of arithmetictruth theoriesrecursive saturationsatisfaction classestruth predicates

Mathematics Subject Classification ID

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

Related Items (4)

Full satisfaction classes, definability, and automorphisms ⋮ TRUTH AND FEASIBLE REDUCIBILITY ⋮ Compositional truth with propositional tautologies and quantifier-free correctness ⋮ AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW

Cites Work

• Unnamed Item
• Nonstandard definability
• Truth, disjunction, and induction
• Models of weak theories of truth
• Bounded Induction and Satisfaction Classes
• Full Satisfaction Classes and Recursive Saturation
• MODELS OF PT^– WITH INTERNAL INDUCTION FOR TOTAL FORMULAE

This page was built for publication: DISJUNCTIONS WITH STOPPING CONDITIONS