Realizability and recursive set theory

Annals of Pure and Applied Logic 32:153-183 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(86)90050-3

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,458

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Generalizing realizability and Heyting models for constructive set theory.Albert Ziegler - 2012 - Annals of Pure and Applied Logic 163 (2):175-184.
Models of intuitionistic set theory in subtoposes of nested realizability toposes.Samuele Maschio & Thomas Streicher - 2015 - Annals of Pure and Applied Logic 166 (6):729-739.
Cobham recursive set functions.Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller & Neil Thapen - 2016 - Annals of Pure and Applied Logic 167 (3):335-369.
Classical descriptive set theory as a refinement of effective descriptive set theory.Yiannis N. Moschovakis - 2010 - Annals of Pure and Applied Logic 162 (3):243-255.
Generalized extensional realizability.L. Gordeev - 1988 - Annals of Pure and Applied Logic 38 (1):106.
Recursive categoricity and recursive stability.John N. Crossley, Alfred B. Manaster & Michael F. Moses - 1986 - Annals of Pure and Applied Logic 31:191-204.
Recursive automorphisms of recursive linear orderings.Steven Schwarz - 1984 - Annals of Pure and Applied Logic 26 (1):69-73.
Generic objects in recursion theory II: Operations on recursive approximation spaces.A. Nerode & J. B. Remmel - 1986 - Annals of Pure and Applied Logic 31:257-288.
From realizability to induction via dependent intersection.Aaron Stump - 2018 - Annals of Pure and Applied Logic 169 (7):637-655.
Realizability for Peano arithmetic with winning conditions in HON games.Valentin Blot - 2017 - Annals of Pure and Applied Logic 168 (2):254-277.

Analytics

Added to PP
2014-01-16

Downloads
24 (#911,194)

6 months
5 (#1,043,573)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Constructive validity is nonarithmetic.Charles McCarty - 1988 - Journal of Symbolic Logic 53 (4):1036-1041.

View all 17 citations / Add more citations

References found in this work

On the interpretation of intuitionistic number theory.Stephen Cole Kleene - 1945 - Journal of Symbolic Logic 10 (4):109-124.
Some applications of Kleene's methods for intuitionistic systems.Harvey Friedman - 1973 - In A. R. D. Mathias & Hartley Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York,: Springer Verlag. pp. 113--170.
Realizability: a retrospective survey.S. C. Kleene - 1973 - In A. R. D. Mathias & Hartley Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York,: Springer Verlag. pp. 95--112.
Intuitionism: An introduction to a seminar. [REVIEW]Charles McCarty - 1983 - Journal of Philosophical Logic 12 (2):105 - 149.

Add more references