The strength of countable saturation

DOI10.1007/S00153-017-0567-2MaRDI QIDQ2402967zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Benno van den Berg, Eyvind Martol Briseid, Pavol Safarik

Publication date 15 September 2017

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1605.02534, https://hdl.handle.net/10642/5448

zbMATH Keywords

proof theorynonstandard analysissaturation principlesarithmetic in all finite types

Mathematics Subject Classification ID

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

Abstract: We determine the proof-theoretic strength of the principle of countable saturation in the context of the systems for nonstandard arithmetic introduced in our earlier work.

Recommendations

• On the strength of nonstandard analysis
• scientific article; zbMATH DE number 3861160
• A functional interpretation for nonstandard arithmetic
• scientific article; zbMATH DE number 2236625
• Making the hyperreal line both saturated and complete

Cites work

• scientific article; zbMATH DE number 1215497 (Why is no real title available?)
• scientific article; zbMATH DE number 3231083 (Why is no real title available?)
• A functional interpretation for nonstandard arithmetic
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• Constructivism in mathematics. An introduction. Volume I
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• On the strength of nonstandard analysis
• Radically Elementary Probability Theory. (AM-117)
• Reverse mathematics and parameter-free transfer
• The Herbrand functional interpretation of the double negation shift
• The strength of nonstandard methods in arithmetic
• The syntax of nonstandard analysis
• Ultrapowers as sheaves on a category of ultrafilters
• Ultrasheaves and double negation

Cited in

(1)

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

This page was built for publication: The strength of countable saturation

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