The following pages link to (Q5183475):
Displayed 15 items.
- Some axioms for constructive analysis (Q453178) (← links)
- Aspects of predicative algebraic set theory. II: Realizability (Q534701) (← links)
- Extraction of redundancy-free programs from constructive natural deduction proofs (Q808284) (← links)
- A modest model of records, inheritance, and bounded quantification (Q922718) (← links)
- The system \({\mathcal F}\) of variable types, fifteen years later (Q1091379) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Intuitionist type theory and the free topos (Q1148318) (← links)
- Theory of proofs (arithmetic and analysis) (Q1260035) (← links)
- From constructivism to computer science (Q1274450) (← links)
- Provability in principle and controversial constructivistic principles (Q1372941) (← links)
- Intuitionistically provable recursive well-orderings (Q1820780) (← links)
- Building continuous webbed models for system F (Q1826624) (← links)
- Unavoidable sequences in constructive analysis (Q3552398) (← links)
- Analyzing realizability by Troelstra's methods (Q5957857) (← links)
- Choice and independence of premise rules in intuitionistic set theory (Q6109095) (← links)