The strength of countable saturation

DOI10.1007/s00153-017-0567-2zbMath1417.03291arXiv1605.02534OpenAlexW2382512141WikidataQ59528206 ScholiaQ59528206MaRDI QIDQ2402967

Pavol Safarik, Eyvind Briseid, Benno van den Berg

Publication date: 15 September 2017

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

Full work available at URL: https://arxiv.org/abs/1605.02534

zbMATH Keywords

proof theorynonstandard analysisarithmetic in all finite typessaturation principles

Mathematics Subject Classification ID

Functionals in proof theory (03F10) Metamathematics of constructive systems (03F50) Nonstandard models in mathematics (03H05) Relative consistency and interpretations (03F25) Nonstandard analysis (26E35) Nonstandard arithmetic (number-theoretic aspects) (11U10)

Related Items

To be or not to be constructive, that is not the question

Cites Work

• Unnamed Item
• Unnamed Item
• Ultrasheaves and double negation
• A functional interpretation for nonstandard arithmetic
• The syntax of nonstandard analysis
• Constructivism in mathematics. An introduction. Volume I
• Reverse mathematics and parameter-free transfer
• Ultrapowers as sheaves on a category of ultrafilters
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• The strength of nonstandard methods in arithmetic
• On the strength of nonstandard analysis
• Radically Elementary Probability Theory. (AM-117)
• THE HERBRAND FUNCTIONAL INTERPRETATION OF THE DOUBLE NEGATION SHIFT
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics