scientific article

zbMath0272.02038MaRDI QIDQ3214890

Harvey M. Friedman

Publication date: 1973

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Intuitionistic mathematics (03F55) Intermediate logics (03B55) Proof theory and constructive mathematics (03F99)

Related Items (37)

Lindenbaum algebras of intuitionistic theories and free categories ⋮ Realizability and recursive set theory ⋮ CZF does not have the existence property ⋮ On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis ⋮ Kleene computable functionals and the higher order existence property ⋮ Nondeducibility of the uniformization principles from Church's thesis in intuitionistic set theory ⋮ Relativized ordinal analysis: the case of power Kripke-Platek set theory ⋮ EXTENSIONAL REALIZABILITY AND CHOICE FOR DEPENDENT TYPES IN INTUITIONISTIC SET THEORY ⋮ Lifschitz realizability for intuitionistic Zermelo-Fraenkel set theory ⋮ Choice and independence of premise rules in intuitionistic set theory ⋮ Intermediate logics and the de Jongh property ⋮ Intuitionist type theory and the free topos ⋮ Classical realizability and arithmetical formulæ ⋮ Ordered combinatory algebras and realizability ⋮ Realisability for infinitary intuitionistic set theory ⋮ From the weak to the strong existence property ⋮ The consistency of some intuitionistic and constructive principles with a set theory ⋮ Generalizing realizability and Heyting models for constructive set theory ⋮ Implicative algebras: a new foundation for realizability and forcing ⋮ The scope of Feferman's semi-intuitionistic set theories and his second conjecture ⋮ Aspects of predicative algebraic set theory. I: Exact completion ⋮ Aspects of predicative algebraic set theory. II: Realizability ⋮ Rules and arithmetics ⋮ Integrating classical and intuitionistic type theory ⋮ Certain partial conservativeness properties of intuitionistic set theory with the principle of double complement of sets ⋮ Type theories, toposes and constructive set theory: Predicative aspects of AST ⋮ Analyzing realizability by Troelstra's methods ⋮ Theory of proofs (arithmetic and analysis) ⋮ Typing and computational properties of lambda expressions ⋮ Towards a computation system based on set theory ⋮ A categorical reading of the numerical existence property in constructive foundations ⋮ Set existence property for intuitionistic theories with dependent choice ⋮ Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions ⋮ Large sets in intuitionistic set theory ⋮ Models of intuitionistic set theory in subtoposes of nested realizability toposes ⋮ The lack of definable witnesses and provably recursive functions in intuitionistic set theories ⋮ Arithmetic transfinite induction and recursive well-orderings

This page was built for publication: