Realizability and Shanin's Algorithm for the Constructive Deciphering of Mathematical Sentences

Journal of Symbolic Logic 27 (2):243-244 (1962)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2964155

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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

Axiomatizing higher-order Kleene realizability.Jaap van Oosten - 1994 - Annals of Pure and Applied Logic 70 (1):87-111.
In Domain Realizability, not all Functionals on C[–1, 1] are Continuous.Martín Escardó & Thomas Streicher - 2002 - Mathematical Logic Quarterly 48 (S1):41-44.
A constructive proof of the Peter‐Weyl theorem.Thierry Coquand & Bas Spitters - 2005 - Mathematical Logic Quarterly 51 (4):351-359.
Dual realizability in symmetric logic.I. D. Zaslavsky - 2001 - Annals of Pure and Applied Logic 113 (1-3):389-397.
Combinator realizability of constructive finite type analysis.John Staples - 1973 - In A. R. D. Mathias & H. Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York: Springer Verlag. pp. 253--273.
Unavoidable sequences in constructive analysis.Joan Rand Moschovakis - 2010 - Mathematical Logic Quarterly 56 (2):205-215.
A nonstandard proof of a lemma from constructive measure theory.David A. Ross - 2006 - Mathematical Logic Quarterly 52 (5):494-497.
Russian Text Ignored.P. Shanin - 1956 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 2 (1-4):27-36.
A realizability interpretation for classical analysis.Henry Towsner - 2004 - Archive for Mathematical Logic 43 (7):891-900.
Extensional realizability.Jaap van Oosten - 1997 - Annals of Pure and Applied Logic 84 (3):317-349.
On Weak Markov's Principle.Ulrich Kohlenbach - 2002 - Mathematical Logic Quarterly 48 (S1):59-65.
Realizing Brouwer's sequences.Richard E. Vesley - 1996 - Annals of Pure and Applied Logic 81 (1-3):25-74.
Strictly Primitive Recursive Realizability, II. Completeness with Respect to Iterated Reflection and a Primitive Recursive $\omega$ -Rule.Zlatan Damnjanovic - 1998 - Notre Dame Journal of Formal Logic 39 (3):363-388.
A general notion of realizability.Lars Birkedal - 2002 - Bulletin of Symbolic Logic 8 (2):266-282.
Confined modified realizability.Gilda Ferreira & Paulo Oliva - 2010 - Mathematical Logic Quarterly 56 (1):13-28.

Analytics

Added to PP
2015-02-05

Downloads
3 (#1,650,745)

6 months
3 (#902,269)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Analyzing realizability by Troelstra's methods.Joan Rand Moschovakis - 2002 - Annals of Pure and Applied Logic 114 (1-3):203-225.

Add more citations

References found in this work

No references found.

Add more references