On the interpretation of intuitionistic number theory

DOI10.2307/2269016zbMath0063.03260OpenAlexW2043566933WikidataQ29038352 ScholiaQ29038352MaRDI QIDQ5843995

Publication date: 1945

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2269016

Related Items

Choice and independence of premise rules in intuitionistic set theory, DISJUNCTION AND EXISTENCE PROPERTIES IN MODAL ARITHMETIC, Stateful Realizers for Nonstandard Analysis, Cardinality reduction theorem for logics QHC and QH4, Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability, Parallelism in realizability models, Propositional Calculus and Realizability, PREDICATIVISM AS A FORM OF POTENTIALISM, On hyperarithmetical realizability, THE AXIOM OF CHOICE IS FALSE INTUITIONISTICALLY (IN MOST CONTEXTS), An Application of the Yankov Characteristic Formulas, A Generalized Realizability and Intuitionistic Logic, Kleene's Amazing Second Recursion Theorem, General recursive realizability and basic logic, Recursive Functions and Intuitionistic Number Theory, Quantum Control in the Unitary Sphere: Lambda-S1 and its Categorical Model, The effects of effects on constructivism, Homotopical patch theory, Realizability and recursive set theory, Fuzzy constructive logic, On Church’s thesis in cubical assemblies, Some obstacles facing a semantic foundation for constructive mathematics, CZF does not have the existence property, Parametric Church's thesis: synthetic computability without choice, A small complete category, The Mathematical Work of S.C.Kleene, A classical view of the intuitionistic continuum, Realizing Brouwer's sequences, Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels, Natural factors of the Muchnik lattice capturing IPC, Intuitionistic completeness of first-order logic, Intuitive counterexamples for constructive fallacies, THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY, Intuitionism and effective descriptive set theory, Lifschitz realizability for intuitionistic Zermelo-Fraenkel set theory, A modal type theory for formalizing trusted communications, Classical realizability and arithmetical formulæ, Numerical existence property and categories with an internal copy, Paradox and potential infinity, The Logic of Justification, Proof-theoretical analysis: Weak systems of functions and classes, Specifying Peirce's law in classical realizability, Ordered combinatory algebras and realizability, On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC, Realisability for infinitary intuitionistic set theory, From the weak to the strong existence property, Unnamed Item, Metric spaces in synthetic topology, Intuitionistic fixed point logic, Recursion over realizability structures, Implicative algebras: a new foundation for realizability and forcing, On strong normalization and type inference in the intersection type discipline, Natural factors of the Medvedev lattice capturing IPC, A bridge between constructive logic and computer programming, The disjunction property of intermediate propositional logics, Primitive recursive selection functions for existential assertions over abstract algebras, Explicit Provability and Constructive Semantics, Verificationism and Classical Realizability, On the Constructive and Computational Content of Abstract Mathematics, On Relating Theories: Proof-Theoretical Reduction, A semantic hierarchy for intuitionistic logic, Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves, A Survey of Classical Realizability, BROUWER’S WEAK COUNTEREXAMPLES AND TESTABILITY: FURTHER REMARKS, On (co)products of partial combinatory algebras, with an application to pushouts of realizability toposes, General recursive realizability and intuitionistic logic, On partial disjunction properties of theories containing Peano arithmetic, Extended fuzzy constructive logic, Aspects of predicative algebraic set theory. II: Realizability, REALIZABILITY SEMANTICS FOR QUANTIFIED MODAL LOGIC: GENERALIZING FLAGG’S 1985 CONSTRUCTION, The computational content of arithmetical proofs, THE LOGIC OF JUSTIFICATION, Realizability interpretation of PA by iterated limiting PCA, Simplified Reducibility Proofs of Church-Rosser for β- and βη-reduction, Typing termination in a higher-order concurrent imperative language, Unnamed Item, Analyzing realizability by Troelstra's methods, Arithmetic complexity of the predicate logics of certain complete arithmetic theories, Dual realizability in symmetric logic, Kripke models, distributive lattices, and Medvedev degrees, A survey of predicate realizability logic, Mass problems and intuitionistic higher-order logic, On paradoxes in normal form, A Survey of Propositional Realizability Logic, The Context of Inference, An epistemic approach to paraconsistency: a logic of evidence and truth, Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1, The Dedekind reals in abstract Stone duality, Modified realizability and predicate logic, From constructivism to computer science, Confined modified realizability, On the realizations of predicate formulas, A categorical reading of the numerical existence property in constructive foundations, A homotopy-theoretic model of function extensionality in the effective topos, Programs as proofs: A synopsis, Realizability and intuitionistic logic, A proof description language and its reduction system, On the Blok-Esakia Theorem, Aspects of Categorical Recursion Theory, Propositions and specifications of programs in Martin-Löf's type theory, Nikolai Aleksandrovich Shanin (obituary), Recursive Functions and Intuitionistic Number Theory, Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability, On measure quantifiers in first-order arithmetic, Randomising realizability, A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction

Cites Work