The following pages link to (Q3679172):
Displayed 50 items.
- Singular coverings and non‐uniform notions of closed set computability (Q3528149) (← links)
- AXIOMS FOR DETERMINATENESS AND TRUTH (Q3580669) (← links)
- Metrization Theorem for Space-Times: From Urysohn’s Problem towards Physically Useful Constructive Mathematics (Q3586016) (← links)
- Elementary explicit types and polynomial time operations (Q3632522) (← links)
- The knaster-tarski fixed-point theorem is not uniformly constructive (Q3800032) (← links)
- On the Lebesgue measurability of continuous functions in constructive analysis (Q3971805) (← links)
- Polynomial time operations in explicit mathematics (Q4358055) (← links)
- Reflection principles for synthetic theories of smooth manifolds (Q4378768) (← links)
- Wellordering proofs for metapredicative Mahlo (Q4532614) (← links)
- Applicable Mathematics in a Minimal Computational Theory of Sets (Q4553281) (← links)
- Validating Brouwer's continuity principle for numbers using named exceptions (Q4640313) (← links)
- Collapsing partial combinatory algebras (Q4645804) (← links)
- The axiom of choice and combinatory logic (Q4650272) (← links)
- Ranked partial structures (Q4650273) (← links)
- TRUNCATION AND SEMI-DECIDABILITY NOTIONS IN APPLICATIVE THEORIES (Q4692077) (← links)
- Some logical metatheorems with applications in functional analysis (Q4819747) (← links)
- Strong and Uniform Continuity – the Uniform Space Case (Q4827619) (← links)
- Singular Coverings and Non-Uniform Notions of Closed Set Computability (Q4918031) (← links)
- COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS (Q4984865) (← links)
- Nets and reverse mathematics (Q4995602) (← links)
- Free Definite Description Theory – Sequent Calculi and Cut Elimination (Q5006839) (← links)
- ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS (Q5015728) (← links)
- Bishop-Style Constructive Reverse Mathematics (Q5024576) (← links)
- SENSE AND REFERENCE FROM A CONSTRUCTIVIST STANDPOINT (Q5037522) (← links)
- Effective applicative structures (Q5057467) (← links)
- Image of Soviet and Russian logic in the West. Latter Half of the XXth Century (Q5059702) (← links)
- A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC (Q5082051) (← links)
- (Q5091143) (← links)
- Monotone recursive definition of predicates and its realizability interpretation (Q5096211) (← links)
- Adding proof objects and inductive definition mechanisms to frege structures (Q5096212) (← links)
- From term models to domains (Q5096213) (← links)
- (Q5109510) (← links)
- Five stages of accepting constructive mathematics (Q5122448) (← links)
- The Brouwer invariance theorems in reverse mathematics (Q5135421) (← links)
- COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS (Q5207560) (← links)
- SEPARATING THE FAN THEOREM AND ITS WEAKENINGS II (Q5207562) (← links)
- A mechanization of strong Kleene logic for partial functions (Q5210785) (← links)
- Feferman on Computability (Q5214780) (← links)
- Unfolding Schematic Systems (Q5214786) (← links)
- The Operational Penumbra: Some Ontological Aspects (Q5214788) (← links)
- Proof Theory of Constructive Systems: Inductive Types and Univalence (Q5214792) (← links)
- (Q5224157) (← links)
- Principles of bar induction and continuity on Baire space (Q5224158) (← links)
- Full Cut Elimination and Interpolation for Intuitionistic Logic with Existence Predicate (Q5241408) (← links)
- Constructive Recursive Functions, Church’s Thesis, and Brouwer’s Theory of the Creating Subject: Afterthoughts on a Parisian Joint Session (Q5250212) (← links)
- Type Theories from Barendregt’s Cube for Theorem Provers (Q5251190) (← links)
- A Computational Interpretation of Forcing in Type Theory (Q5253929) (← links)
- Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions (Q5253934) (← links)
- Realizability Models Separating Various Fan Theorems (Q5326379) (← links)
- CONSTRUCTIVE GEOMETRY AND THE PARALLEL POSTULATE (Q5346689) (← links)