The following pages link to (Q3679172):
Displayed 50 items.
- Dynamical algebraic structures, pointfree topological spaces and Hilbert's program. (Structures algébriques dynamiques, espaces topologiques sans points et programme de Hilbert) (Q2575772) (← links)
- A feasible theory of truth over combinatory algebra (Q2637706) (← links)
- CZF does not have the existence property (Q2637709) (← links)
- Strongly Noetherian rings and constructive ideal theory (Q2643522) (← links)
- Radical theory of Scott-open filters (Q2682912) (← links)
- Realisability for infinitary intuitionistic set theory (Q2700803) (← links)
- Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory (Q2747729) (← links)
- The Relevance of Computation Irreducibility as Computation Universality in Economics (Q2929344) (← links)
- Verified Methods for Computing Pareto Sets: General Algorithmic Analysis (Q2930551) (← links)
- On the Semantics of Intensionality (Q2988392) (← links)
- Realisability in weak systems of explicit mathematics (Q3107339) (← links)
- The principle of pointfree continuity (Q3121524) (← links)
- A proof–technique in uniform space theory (Q3160570) (← links)
- Unitary Theories, Unitary Categories (Q3178243) (← links)
- Ordinal Analysis of Intuitionistic Power and Exponentiation Kripke Platek Set Theory (Q3305554) (← links)
- The Operational Perspective: Three Routes (Q3305557) (← links)
- 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)