On Languages Which are Based on Non-Standard Arithmetic

DOI10.1017/S0027763000011065MaRDI QIDQ5551148zbMATH OpenOpenAlexFDO

Authors Abraham Robinson

Publication date 1963

Published in Nagoya Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0027763000011065

zbMATH Keywords

algebraic logic, model theory

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites work

• Completeness in the theory of types
• Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory

Cited in

(16)

• The optimization of the domain problem. I: Basic concepts
• Interpreting the compositional truth predicate in models of arithmetic
• Full satisfaction classes, definability, and automorphisms
• Recursively saturated nonstandard models of arithmetic
• Abraham Robinson, 1918-1974
• Other Proofs of Old Results
• Current research on Gödel's incompleteness theorems
• Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
• INCOMPLETENESS VIA PARADOX AND COMPLETENESS
• Truth without standard models: some conceptual problems reloaded
• Nonstandard logic
• Undefinability of truth and nonstandard models
• The incompleteness theorems after 70 years
• Satisfaction classes with approximate disjunctive correctness
• Inductive full satisfaction classes
• Deflationary truth and pathologies

This page was built for publication: On Languages Which are Based on Non-Standard Arithmetic

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