scientific article

From MaRDI portal
Publication:3214890

zbMath0272.02038MaRDI QIDQ3214890

Harvey M. Friedman

Publication date: 1973


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



Related Items (37)

Lindenbaum algebras of intuitionistic theories and free categoriesRealizability and recursive set theoryCZF does not have the existence propertyOn the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysisKleene computable functionals and the higher order existence propertyNondeducibility of the uniformization principles from Church's thesis in intuitionistic set theoryRelativized ordinal analysis: the case of power Kripke-Platek set theoryEXTENSIONAL REALIZABILITY AND CHOICE FOR DEPENDENT TYPES IN INTUITIONISTIC SET THEORYLifschitz realizability for intuitionistic Zermelo-Fraenkel set theoryChoice and independence of premise rules in intuitionistic set theoryIntermediate logics and the de Jongh propertyIntuitionist type theory and the free toposClassical realizability and arithmetical formulæOrdered combinatory algebras and realizabilityRealisability for infinitary intuitionistic set theoryFrom the weak to the strong existence propertyThe consistency of some intuitionistic and constructive principles with a set theoryGeneralizing realizability and Heyting models for constructive set theoryImplicative algebras: a new foundation for realizability and forcingThe scope of Feferman's semi-intuitionistic set theories and his second conjectureAspects of predicative algebraic set theory. I: Exact completionAspects of predicative algebraic set theory. II: RealizabilityRules and arithmeticsIntegrating classical and intuitionistic type theoryCertain partial conservativeness properties of intuitionistic set theory with the principle of double complement of setsType theories, toposes and constructive set theory: Predicative aspects of ASTAnalyzing realizability by Troelstra's methodsTheory of proofs (arithmetic and analysis)Typing and computational properties of lambda expressionsTowards a computation system based on set theoryA categorical reading of the numerical existence property in constructive foundationsSet existence property for intuitionistic theories with dependent choiceConstructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of ConstructionsLarge sets in intuitionistic set theoryModels of intuitionistic set theory in subtoposes of nested realizability toposesThe lack of definable witnesses and provably recursive functions in intuitionistic set theoriesArithmetic transfinite induction and recursive well-orderings







This page was built for publication: