Overspill and fragments of arithmetic

DOI10.1007/BF01622877zbMath0677.03046OpenAlexW1967022936MaRDI QIDQ1123191

S. H. Smith

Publication date: 1989

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01622877

zbMATH Keywords

collectioninductionoverspill

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15)

Related Items (8)

Models of arithmetic and categories with finiteness conditions ⋮ 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 ⋮ On the scheme of induction for bounded arithmetic formulas ⋮ Pell equations and exponentiation in fragments of arithmetic ⋮ Rudimentary relations and primitive recursion: A toolbox ⋮ Algebraic combinatorics in bounded induction ⋮ Existentially closed structures and Gödel's second incompleteness theorem ⋮ An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency

Cites Work

• Forcing, arithmetic, division rings
• Bounded existential induction
• Parameter-Free Universal Induction
• Gödel's Second incompleteness theorem for Q
• Completeness Theorems, Incompleteness Theorems and Models of Arithmetic

This page was built for publication: Overspill and fragments of arithmetic