Satisfaction classes with approximate disjunctive correctness
From MaRDI portal
Cites work
- ∏ 0 1 Classes and Degrees of Theories
- Axiomatic theories of truth
- Bounded Induction and Satisfaction Classes
- Conservativity for theories of compositional truth via cut elimination
- Construction of Satisfaction Classes for Nonstandard Models
- Deflationary truth and pathologies
- DISJUNCTIONS WITH STOPPING CONDITIONS
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- scientific article; zbMATH DE number 3528224 (Why is no real title available?)
- scientific article; zbMATH DE number 1215493 (Why is no real title available?)
- scientific article; zbMATH DE number 227056 (Why is no real title available?)
- Interpreting the compositional truth predicate in models of arithmetic
- Local collection and end-extensions of models of compositional truth
- MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
- Nonstandard characterizations of recursive saturation and resplendency
- Nonstandard definability
- Notes on bounded induction for the compositional truth predicate
- On Languages Which are Based on Non-Standard Arithmetic
- Pathologies in satisfaction classes
- Results on automorphisms of recursively saturated models of PA
- The structure of models of Peano arithmetic
- The two halves of disjunctive correctness
- TRUTH AND FEASIBLE REDUCIBILITY
- Truth, disjunction, and induction
This page was built for publication: Satisfaction classes with approximate disjunctive correctness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6938601)
