The following pages link to (Q3214890):
Displaying 37 items.
- Relativized ordinal analysis: the case of power Kripke-Platek set theory (Q392292) (← links)
- From the weak to the strong existence property (Q448335) (← links)
- Aspects of predicative algebraic set theory. II: Realizability (Q534701) (← links)
- Integrating classical and intuitionistic type theory (Q580341) (← links)
- Intermediate logics and the de Jongh property (Q627438) (← links)
- Generalizing realizability and Heyting models for constructive set theory (Q651324) (← links)
- Certain partial conservativeness properties of intuitionistic set theory with the principle of double complement of sets (Q722147) (← links)
- Set existence property for intuitionistic theories with dependent choice (Q793723) (← links)
- Large sets in intuitionistic set theory (Q796524) (← links)
- Aspects of predicative algebraic set theory. I: Exact completion (Q958492) (← links)
- The lack of definable witnesses and provably recursive functions in intuitionistic set theories (Q1071017) (← links)
- Arithmetic transfinite induction and recursive well-orderings (Q1071019) (← links)
- Lindenbaum algebras of intuitionistic theories and free categories (Q1092043) (← links)
- Realizability and recursive set theory (Q1094418) (← links)
- On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis (Q1102283) (← links)
- Kleene computable functionals and the higher order existence property (Q1104319) (← links)
- Nondeducibility of the uniformization principles from Church's thesis in intuitionistic set theory (Q1114683) (← links)
- Intuitionist type theory and the free topos (Q1148318) (← links)
- The consistency of some intuitionistic and constructive principles with a set theory (Q1167160) (← links)
- Theory of proofs (arithmetic and analysis) (Q1260035) (← links)
- The scope of Feferman's semi-intuitionistic set theories and his second conjecture (Q1740613) (← links)
- Typing and computational properties of lambda expressions (Q1819575) (← links)
- Towards a computation system based on set theory (Q1825191) (← links)
- Lifschitz realizability for intuitionistic Zermelo-Fraenkel set theory (Q1938396) (← links)
- A categorical reading of the numerical existence property in constructive foundations (Q2080594) (← links)
- Models of intuitionistic set theory in subtoposes of nested realizability toposes (Q2344624) (← links)
- CZF does not have the existence property (Q2637709) (← links)
- Realisability for infinitary intuitionistic set theory (Q2700803) (← links)
- Ordered combinatory algebras and realizability (Q2973254) (← links)
- Implicative algebras: a new foundation for realizability and forcing (Q5139288) (← links)
- Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions (Q5253934) (← links)
- Classical realizability and arithmetical formulæ (Q5360216) (← links)
- Rules and arithmetics (Q5937848) (← links)
- Type theories, toposes and constructive set theory: Predicative aspects of AST (Q5957856) (← links)
- Analyzing realizability by Troelstra's methods (Q5957857) (← links)
- EXTENSIONAL REALIZABILITY AND CHOICE FOR DEPENDENT TYPES IN INTUITIONISTIC SET THEORY (Q6095977) (← links)
- Choice and independence of premise rules in intuitionistic set theory (Q6109095) (← links)
