Realizability and recursive set theory
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5905243 (Why is no real title available?)
- scientific article; zbMATH DE number 3427306 (Why is no real title available?)
- scientific article; zbMATH DE number 3427308 (Why is no real title available?)
- scientific article; zbMATH DE number 3825806 (Why is no real title available?)
- scientific article; zbMATH DE number 3668598 (Why is no real title available?)
- scientific article; zbMATH DE number 3556031 (Why is no real title available?)
- scientific article; zbMATH DE number 3291139 (Why is no real title available?)
- scientific article; zbMATH DE number 3360145 (Why is no real title available?)
- scientific article; zbMATH DE number 3394122 (Why is no real title available?)
- Intuitionism: An introduction to a seminar
- On the interpretation of intuitionistic number theory
- Realizability and recursive set theory
- Some Counterexamples in the Theory of Regressive Sets
Cited in
(28)- Realizability semantics for quantified modal logic: generalizing Flagg's 1985 construction
- CZF does not have the existence property
- Embeddings between partial combinatory algebras
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- Turing cones and set theory of the reals
- Indefiniteness in semi-intuitionistic set theories: on a conjecture of Feferman
- Subcountability under realizability
- scientific article; zbMATH DE number 5174279 (Why is no real title available?)
- Realisability for infinitary intuitionistic set theory
- Lifschitz realizability for intuitionistic Zermelo-Fraenkel set theory
- Certain partial conservativeness properties of intuitionistic set theory with the principle of double complement of sets
- Polynomial-time axioms of choice and polynomial-time cardinality
- Sound, totally sound, and unsound recursive equivalence types
- The disjunction and related properties for constructive Zermelo-Fraenkel set theory
- The complexity of completions in partial combinatory algebra
- EXTENSIONAL REALIZABILITY AND CHOICE FOR DEPENDENT TYPES IN INTUITIONISTIC SET THEORY
- On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
- On co-simple isols and their intersection types
- Ordinal analysis of partial combinatory algebras
- Generalizing realizability and Heyting models for constructive set theory
- Manifolds allowing RET arithmetic
- A categorical reading of the numerical existence property in constructive foundations
- Satisfiability is false intuitionistically: a question from Dana Scott
- Universality of Regular Realizability Problems
- Realizability and recursive set theory
- Induction, constructivity, and grounding
- Choice and independence of premise rules in intuitionistic set theory
- Separating the fan theorem and its weakenings. II
This page was built for publication: Realizability and recursive set theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094418)