Relativized realizability in intuitionistic arithmetic of all finite types
From MaRDI portal
Publication:4177565
DOI10.2307/2271946zbMath0395.03038OpenAlexW1994999396MaRDI QIDQ4177565
Publication date: 1978
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2271946
Related Items
Realizability Models Separating Various Fan Theorems, Arithmetical conservation results, EXTENSIONAL REALIZABILITY AND CHOICE FOR DEPENDENT TYPES IN INTUITIONISTIC SET THEORY, Constructive forcing, CPS translations and witness extraction in Interactive realizability, Quick cut-elimination for strictly positive cuts, Proof-theoretical analysis: Weak systems of functions and classes, Generalizing realizability and Heyting models for constructive set theory, On Relating Theories: Proof-Theoretical Reduction, Proof Theory of Constructive Systems: Inductive Types and Univalence, A semantical proof of De Jongh's theorem, Remarks on Herbrand normal forms and Herbrand realizations, Extended bar induction in applicative theories, Some results on cut-elimination, provable well-orderings, induction and reflection, On Goodman realizability, A Computational Interpretation of Forcing in Type Theory, Relative and modified relative realizability
