DISJUNCTIONS WITH STOPPING CONDITIONS
From MaRDI portal
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
Cites work
- Bounded Induction and Satisfaction Classes
- Full Satisfaction Classes and Recursive Saturation
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- Models of \(\mathrm{PT}^-\) with internal induction for total formulae
- Models of weak theories of truth
- Nonstandard definability
- Truth, disjunction, and induction
Cited in
(9)- Interpreting the compositional truth predicate in models of arithmetic
- 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
- Disjunctions with stopping condition
- Saturation properties for compositional truth with propositional correctness
- Satisfaction classes with approximate disjunctive correctness
- An isomorphism theorem for models of weak König's lemma without primitive recursion
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)
