Formalized recursive functionals and formalized realizability

DOI10.1090/memo/0089zbMath0184.02004OpenAlexW1983523043MaRDI QIDQ5575558

Stephen C. Kleene

Publication date: 1969

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/memo/0089

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (25)

Unnamed Item ⋮ The Mathematical Work of S.C.Kleene ⋮ A classical view of the intuitionistic continuum ⋮ Realizing Brouwer's sequences ⋮ Hardwiring truth in functional interpretations ⋮ Intuitionism and effective descriptive set theory ⋮ Choice and independence of premise rules in intuitionistic set theory ⋮ The FAN principle and weak König's lemma in Herbrandized second-order arithmetic ⋮ ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS ⋮ INTUITIONISTIC ANALYSIS AT THE END OF TIME ⋮ On the independence of premiss axiom and rule ⋮ From the weak to the strong existence property ⋮ Some axioms for constructive analysis ⋮ Unavoidable sequences in constructive analysis ⋮ Brouwer's constructivism ⋮ Unnamed Item ⋮ Über das Markov-Prinzip II ⋮ Analyzing realizability by Troelstra's methods ⋮ The creating subject, the Brouwer-Kripke schema, and infinite proofs ⋮ Theory of proofs (arithmetic and analysis) ⋮ Primitive recursion in the abstract ⋮ MARKOV’S PRINCIPLE AND SUBSYSTEMS OF INTUITIONISTIC ANALYSIS ⋮ Solovay's relative consistency proof for FIM and BI ⋮ Quantitative classical realizability ⋮ Descriptions in mathematical logic

This page was built for publication: Formalized recursive functionals and formalized realizability