Relativized realizability in intuitionistic arithmetic of all finite types

DOI10.2307/2271946MaRDI QIDQ4177565zbMATH OpenOpenAlexFDO

Authors Nicolas D. Goodman

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

zbMATH Keywords

Finite TypesIntuitionistic ArithmeticPartial Recursive FunctionsRelativized Realizability

Mathematics Subject Classification ID

Intuitionistic mathematics (03F55)

Cited in

(16)

• Some results on cut-elimination, provable well-orderings, induction and reflection
• Arithmetical conservation results
• A semantical proof of De Jongh's theorem
• Remarks on Herbrand normal forms and Herbrand realizations
• Relative and modified relative realizability
• On Goodman realizability
• On Relating Theories: Proof-Theoretical Reduction
• Proof theory of constructive systems: inductive types and univalence
• A computational interpretation of forcing in type theory
• Realizability Models Separating Various Fan Theorems
• Constructive forcing, CPS translations and witness extraction in interactive realizability
• EXTENSIONAL REALIZABILITY AND CHOICE FOR DEPENDENT TYPES IN INTUITIONISTIC SET THEORY
• Quick cut-elimination for strictly positive cuts
• Generalizing realizability and Heyting models for constructive set theory
• Extended bar induction in applicative theories
• Proof-theoretical analysis: Weak systems of functions and classes

This page was built for publication: Relativized realizability in intuitionistic arithmetic of all finite types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4177565)