Intuitionistic formal theories with realizability in subrecursive classes

Annals of Pure and Applied Logic 89 (1):3-15 (1997)
  Copy   BIBTEX

Abstract

A family of formal intuitionistic theories is proposed with realizability of proved formulas in several subrecursive classes, e.g. Grzegorczyk classes, polynomial-time computable functions class, etc. xA) Algorithm extraction forxyA is shown for various classes of bounded complexity. The results on polynomial computability are closely connected to work on the Bounded Arithmetic by S. Buss

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(97)00002-x

Links

PhilArchive



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

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

On unsolvability in subrecursive classes of predicates.Forbes D. Lewis - 1979 - Notre Dame Journal of Formal Logic 20 (1):55-67.
Quantifier Elimination for a Class of Intuitionistic Theories.Ben Ellison, Jonathan Fleischmann, Dan McGinn & Wim Ruitenburg - 2008 - Notre Dame Journal of Formal Logic 49 (3):281-293.
On Kleene's recursive realizability as an interpretation for intuitionistic elementary number theory.Robert R. Tompkins - 1968 - Notre Dame Journal of Formal Logic 9 (4):289-293.
Intuitionistic Completeness and Classical Logic.D. C. McCarty - 2002 - Notre Dame Journal of Formal Logic 43 (4):243-248.
A general notion of realizability.Lars Birkedal - 2002 - Bulletin of Symbolic Logic 8 (2):266-282.
Lifschitz realizability for intuitionistic Zermelo–Fraenkel set theory.Ray-Ming Chen & Michael Rathjen - 2012 - Archive for Mathematical Logic 51 (7-8):789-818.
Review: A. S. Troelstra, J. E. Fenstad, Notions of Realizability for Intuitionistic Arithmetic and Intuitionistic Arithmetic in all Finite Types. [REVIEW]C. Smorynski - 1975 - Journal of Symbolic Logic 40 (4):625-625.
Church's thesis, continuity, and set theory.M. Beeson & A. Ščedrov - 1984 - Journal of Symbolic Logic 49 (2):630-643.
Multiple realizability and the semantic view of theories.Colin Klein - 2013 - Philosophical Studies 163 (3):683-695.
Algebraic Models of Intuitionistic Theories of Sets and Classes.Steve Awodey & Henrik Forssell - unknown
Realization of Intuitionistic Logic by Proof Polynomials.Sergei N. Artemov - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):285-301.
Provably recursive functions of constructive and relatively constructive theories.Morteza Moniri - 2010 - Archive for Mathematical Logic 49 (3):291-300.
Intuitionistic completeness for first order classical logic.Stefano Berardi - 1999 - Journal of Symbolic Logic 64 (1):304-312.
Intuitionistic autoepistemic logic.Giambattista Amati, Luigia Carlucci-Aiello & Fiora Pirri - 1997 - Studia Logica 59 (1):103-120.

Analytics

Added to PP
2014-01-16

Downloads
13 (#1,006,512)

6 months
4 (#818,853)

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

Some Classes of Recursive Functions.Andrzej Grzegorczyk - 1955 - Journal of Symbolic Logic 20 (1):71-72.

Add more references