On Languages Which are Based on Non-Standard Arithmetic

DOI10.1017/S0027763000011065zbMath0166.26101OpenAlexW1566741929MaRDI QIDQ5551148

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)

Related Items

Recursively saturated nonstandard models of arithmetic, Full satisfaction classes, definability, and automorphisms, Undefinability of truth and nonstandard models, The incompleteness theorems after 70 years, INCOMPLETENESS VIA PARADOX AND COMPLETENESS, The optimization of the domain problem. I: Basic concepts, Truth without standard models: some conceptual problems reloaded, Inductive full satisfaction classes, Abraham Robinson, 1918-1974, Deflationary truth and pathologies, CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS, Interpreting the compositional truth predicate in models of arithmetic, Other Proofs of Old Results, HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC, Nonstandard logic

Cites Work

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