scientific article; zbMATH DE number 3432235
From MaRDI portal
Publication:5183475
zbMath0275.02036MaRDI QIDQ5183475
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computability and recursion theory (03D99) Intuitionistic mathematics (03F55) Proof theory and constructive mathematics (03F99)
Related Items (15)
The system \({\mathcal F}\) of variable types, fifteen years later ⋮ Provability in principle and controversial constructivistic principles ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ Choice and independence of premise rules in intuitionistic set theory ⋮ Intuitionist type theory and the free topos ⋮ Some axioms for constructive analysis ⋮ A modest model of records, inheritance, and bounded quantification ⋮ Unavoidable sequences in constructive analysis ⋮ Aspects of predicative algebraic set theory. II: Realizability ⋮ Analyzing realizability by Troelstra's methods ⋮ Theory of proofs (arithmetic and analysis) ⋮ From constructivism to computer science ⋮ Intuitionistically provable recursive well-orderings ⋮ Building continuous webbed models for system F ⋮ Extraction of redundancy-free programs from constructive natural deduction proofs
This page was built for publication:
