Dual realizability in symmetric logic

Annals of Pure and Applied Logic 113 (1-3):389-397 (2001)
  Copy   BIBTEX

Abstract

A variant of the notion of symmetric constructive realizability is introduced where the information about the symmetric constructive truth or falsity of an arithmetical formula is expressed by a single natural number. The methods of transformations of such a realization to the realizations of known kinds and those of reverse transformations are given. The formal arithmetical system based on such a realizability is investigated

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(01)00068-9

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,894

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

The Nonarithmeticity of the Predicate Logic of Strictly Primitive Recursive Realizability.Valery Plisko - forthcoming - Review of Symbolic Logic:1-30.
Arithmetic complexity of the predicate logics of certain complete arithmetic theories.Valery Plisko - 2001 - Annals of Pure and Applied Logic 113 (1-3):243-259.
Generalizing realizability and Heyting models for constructive set theory.Albert Ziegler - 2012 - Annals of Pure and Applied Logic 163 (2):175-184.
Learning based realizability for HA + EM1 and 1-Backtracking games: Soundness and completeness.Federico Aschieri - 2013 - Annals of Pure and Applied Logic 164 (6):591-617.
Realizing realizability results with classical constructions.Asaf Karagila - 2019 - Bulletin of Symbolic Logic 25 (4):429-445.
Extensional realizability.Jaap van Oosten - 1997 - Annals of Pure and Applied Logic 84 (3):317-349.
Propositional Logics of Closed and Open Substitutions over Heyting's Arithmetic.Albert Visser - 2006 - Notre Dame Journal of Formal Logic 47 (3):299-309.
A constructive analysis of learning in Peano Arithmetic.Federico Aschieri - 2012 - Annals of Pure and Applied Logic 163 (11):1448-1470.
Strong negation in intuitionistic style sequent systems for residuated lattices.Michał Kozak - 2014 - Mathematical Logic Quarterly 60 (4-5):319-334.
Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels.James Lipton & Michael J. O'Donnell - 1996 - Annals of Pure and Applied Logic 81 (1-3):187-239.

Analytics

Added to PP
2014-01-16

Downloads
34 (#749,927)

6 months
10 (#396,137)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Constructible falsity.David Nelson - 1949 - Journal of Symbolic Logic 14 (1):16-26.
On the interpretation of intuitionistic number theory.Stephen Cole Kleene - 1945 - Journal of Symbolic Logic 10 (4):109-124.

Add more references