Infinite sets that Satisfy the Principle of Omniscience in any Variety of Constructive Mathematics

DOI10.2178/jsl.7803040zbMath1308.03060OpenAlexW2049268966MaRDI QIDQ2869900

Martín Hötzel Escardó

Publication date: 7 January 2014

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

Full work available at URL: https://projecteuclid.org/euclid.jsl/1389032274

zbMATH Keywords

selection functionsconstructive omniscience principles

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Decidability of theories and sets of sentences (03B25) Foundations of classical theories (including reverse mathematics) (03B30) Functionals in proof theory (03F10) Metamathematics of constructive systems (03F50) Subsystems of classical logic (including intuitionistic logic) (03B20) Axiom of choice and related propositions (03E25)

Related Items

Countable sets versus sets that are countable in reverse mathematics, Completeness and decidability results for CTL in constructive type theory, The intrinsic topology of Martin-Löf universes, Surveyable sets, On Brouwer's continuity principle, Unnamed Item, On the Cantor–Bendixson rank of a set that is searchable in Gödel’s T, On the Computability of the Fan Functional, Exploring mathematical objects from custom-tailored mathematical universes

Cites Work

• Unnamed Item
• Constructivist and structuralist foundations: Bishop's and Lawvere's theories of sets
• Constructivism in mathematics. An introduction. Volume I
• Ishihara's proof technique in constructive analysis
• Dependent Types at Work