Construction of Satisfaction Classes for Nonstandard Models

DOI10.4153/CMB-1981-045-3MaRDI QIDQ3924205zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Peano arithmeticsatisfaction of nonstandard formulas

Mathematics Subject Classification ID

Nonstandard models of arithmetic (03H15)

Cited in

(39)

• 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
• An addition to Rosser's theorem
• TRUTH AND FEASIBLE REDUCIBILITY
• Neutrally expandable models of arithmetic
• INCOMPLETENESS VIA PARADOX AND COMPLETENESS
• Deflationary truth and the ontology of expressions
• 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
• Compositional truth with propositional tautologies and quantifier-free correctness
• AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW
• Pathologies in satisfaction classes
• Saturation properties for compositional truth with propositional correctness
• A theory of implicit commitment
• Satisfaction classes with approximate disjunctive correctness
• An isomorphism theorem for models of weak König's lemma without primitive recursion
• Nonstandard definability
• Inductive full satisfaction classes
• Deflationary truth and pathologies

This page was built for publication: Construction of Satisfaction Classes for Nonstandard Models

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