The following pages link to (Q4215635):
Displaying 28 items.
- Realizability for Peano arithmetic with winning conditions in HON games (Q345704) (← links)
- Intuitionistic completeness of first-order logic (Q392280) (← links)
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control (Q444460) (← links)
- Aspects of predicative algebraic set theory. II: Realizability (Q534701) (← links)
- Realizability models refuting Ishihara's boundedness principle (Q714714) (← links)
- Mathematics based on incremental learning -- excluded middle and inductive inference (Q817838) (← links)
- Primitive recursive selection functions for existential assertions over abstract algebras (Q941429) (← links)
- Functional interpretations of linear and intuitionistic logic (Q964504) (← links)
- Algebraic proofs of cut elimination (Q1349247) (← links)
- A constructive game semantics for the language of linear logic (Q1361252) (← links)
- Arithmetical conservation results (Q1688961) (← links)
- Uniform Heyting arithmetic (Q1772775) (← links)
- Realization of constructive set theory into explicit mathematics: A lower bound for impredicative Mahlo universe (Q1861330) (← links)
- Saturated models of universal theories (Q1861531) (← links)
- On measure quantifiers in first-order arithmetic (Q2117748) (← links)
- On the independence of premiss axiom and rule (Q2204366) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\) (Q2344720) (← links)
- Strongly uniform bounds from semi-constructive proofs (Q2498902) (← links)
- The Logic of Justification (Q2971696) (← links)
- Verificationism and Classical Realizability (Q3305313) (← links)
- (Q4957786) (← links)
- Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions (Q5253934) (← links)
- Logical problems of functional interpretations (Q5957851) (← links)
- Analyzing realizability by Troelstra's methods (Q5957857) (← links)
- EXTENSIONAL REALIZABILITY AND CHOICE FOR DEPENDENT TYPES IN INTUITIONISTIC SET THEORY (Q6095977) (← links)
- Choice and independence of premise rules in intuitionistic set theory (Q6109095) (← links)
- Revisiting the conservativity of fixpoints over intuitionistic arithmetic (Q6178470) (← links)
