Pages that link to "Item:Q5843995"
From MaRDI portal
The following pages link to On the interpretation of intuitionistic number theory (Q5843995):
Displaying 50 items.
- On hyperarithmetical realizability (Q268079) (← links)
- Some obstacles facing a semantic foundation for constructive mathematics (Q320173) (← links)
- Natural factors of the Muchnik lattice capturing IPC (Q385809) (← links)
- Intuitionistic completeness of first-order logic (Q392280) (← links)
- A modal type theory for formalizing trusted communications (Q420842) (← links)
- From the weak to the strong existence property (Q448335) (← links)
- Natural factors of the Medvedev lattice capturing IPC (Q481874) (← links)
- Aspects of predicative algebraic set theory. II: Realizability (Q534701) (← links)
- Metric spaces in synthetic topology (Q651311) (← links)
- Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves (Q673628) (← links)
- Realizability and intuitionistic logic (Q792319) (← links)
- Propositions and specifications of programs in Martin-Löf's type theory (Q800719) (← links)
- General recursive realizability and basic logic (Q828116) (← links)
- Fuzzy constructive logic (Q843607) (← links)
- Proof-theoretical analysis: Weak systems of functions and classes (Q911585) (← links)
- On strong normalization and type inference in the intersection type discipline (Q930868) (← links)
- Primitive recursive selection functions for existential assertions over abstract algebras (Q941429) (← links)
- Typing termination in a higher-order concurrent imperative language (Q979082) (← links)
- Kripke models, distributive lattices, and Medvedev degrees (Q995672) (← links)
- Programs as proofs: A synopsis (Q1051424) (← links)
- A proof description language and its reduction system (Q1055769) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- Realizability and recursive set theory (Q1094418) (← links)
- A small complete category (Q1112159) (← links)
- Recursion over realizability structures (Q1173956) (← links)
- A bridge between constructive logic and computer programming (Q1179711) (← links)
- The disjunction property of intermediate propositional logics (Q1181482) (← links)
- Modified realizability and predicate logic (Q1274048) (← links)
- From constructivism to computer science (Q1274450) (← links)
- Intuitionism and effective descriptive set theory (Q1688967) (← links)
- A semantic hierarchy for intuitionistic logic (Q1740610) (← links)
- On partial disjunction properties of theories containing Peano arithmetic (Q1756504) (← links)
- The computational content of arithmetical proofs (Q1762353) (← links)
- A classical view of the intuitionistic continuum (Q1923572) (← links)
- Realizing Brouwer's sequences (Q1923574) (← links)
- Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels (Q1923579) (← links)
- Lifschitz realizability for intuitionistic Zermelo-Fraenkel set theory (Q1938396) (← links)
- Paradox and potential infinity (Q1947035) (← links)
- An epistemic approach to paraconsistency: a logic of evidence and truth (Q2053983) (← links)
- A categorical reading of the numerical existence property in constructive foundations (Q2080594) (← links)
- Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability (Q2113424) (← links)
- On measure quantifiers in first-order arithmetic (Q2117748) (← links)
- Randomising realizability (Q2117768) (← links)
- The effects of effects on constructivism (Q2133168) (← links)
- Parametric Church's thesis: synthetic computability without choice (Q2151397) (← links)
- Numerical existence property and categories with an internal copy (Q2198319) (← links)
- Intuitionistic fixed point logic (Q2220485) (← links)
- General recursive realizability and intuitionistic logic (Q2246818) (← links)
- Extended fuzzy constructive logic (Q2253863) (← links)
- On paradoxes in normal form (Q2288281) (← links)
