Construction of Satisfaction Classes for Nonstandard Models
From MaRDI portal
Publication:3924205
DOI10.4153/CMB-1981-045-3zbMath0471.03054MaRDI QIDQ3924205
Henryk Kotlarski, Stanisław Krajewski, Alistair H. Lachlan
Publication date: 1981
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cmb-1981-045-3
03H15: Nonstandard models of arithmetic
Related Items
An addition to Rosser's theorem, TRUTH AND FEASIBLE REDUCIBILITY, Neutrally expandable models of arithmetic, INCOMPLETENESS VIA PARADOX AND COMPLETENESS, NOTES ON BOUNDED INDUCTION FOR THE COMPOSITIONAL TRUTH PREDICATE, Kernels, truth and satisfaction, MINIMAL TRUTH AND INTERPRETABILITY, The two halves of disjunctive correctness, MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE, Deflationary truth and the ontology of expressions, Nonstandard definability, Inductive full satisfaction classes, Deflationary truth and pathologies, On the number of steps in proofs, Transplendent models: expansions omitting a type, Possible-worlds semantics for modal notions conceived as predicates, A system of complete and consistent truth, Interpreting the compositional truth predicate in models of arithmetic, The implicit commitment of arithmetical theories and its semantic core, Cut elimination for systems of transparent truth with restricted initial sequents, Truth and the philosophy of mathematics, Reflecting and unfolding, Full satisfaction classes, definability, and automorphisms, Truth, disjunction, and induction, A note on the variety of satisfaction classes, Local collection and end-extensions of models of compositional truth, TRUTH AND SPEED-UP, Relative Truth Definability of Axiomatic Truth Theories, CONSISTENCY AND THE THEORY OF TRUTH, Lindenbaum’s Lemma via Open Induction, CONSERVATIVITY FOR THEORIES OF COMPOSITIONAL TRUTH VIA CUT ELIMINATION, Remarks on weak notions of saturation in models of Peano arithmetic
