Constructively Complete Finite Sets
From MaRDI portal
Recommendations
Cited in
(16)- Markov's principle, Church's thesis and Lindelöf's theorem
- Constructive sets in computable sets
- On Brouwer's continuity principle
- Completeness: when enough is enough
- Constructing finite sets from their representation functions
- Separating fragments of WLEM, LPO, and MP
- Effective Choice and Boundedness Principles in Computable Analysis
- Continuity and nondiscontinuity in constructive mathematics
- Continuity properties in constructive mathematics
- Bishop-Style Constructive Reverse Mathematics
- Strongly extensional homomorphism of implicative semigroups with apartness
- EXTENDED FRAMES AND SEPARATIONS OF LOGICAL PRINCIPLES
- On the ^0_1-fragments of the Kreisel-Putnam axiom and two variants of the linearity axiom in intuitionistic arithmetic and analysis
- Constructions of complete sets
- Some principles weaker than Markov's principle
- Finite-tight sets
This page was built for publication: Constructively Complete Finite Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030826)