The strength of nonstandard methods in arithmetic

DOI10.2307/2274260zbMath0587.03048OpenAlexW2017398442MaRDI QIDQ3714082

Matt Kaufmann, H. Jerome Keisler, C. Ward Henson

Publication date: 1984

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274260

zbMATH Keywords

nonstandard analysissecond order arithmeticinduction schemeshyperintegerscomprehension schemessaturation schemes

Mathematics Subject Classification ID

Nonstandard models of arithmetic (03H15) Second- and higher-order arithmetic and fragments (03F35)

Related Items

Hyperfinite models of adapted probability logic, The Mathematical Intelligencer flunks the Olympics, Nonstandard methods in combinatorics and theoretical computer science, The strength of countable saturation, Sequences in countable nonstandard models of the natural numbers, Some nonstandard methods in combinatorial number theory, A theory of hyperfinite sets, Nonstandard Arithmetic and Reverse Mathematics, Applications of Nonstandard Models and Lebesgue Measure to Sequences of Natural Numbers

Cites Work

• Nonstandard Set Theory
• Internal set theory: A new approach to nonstandard analysis