Feasible Operations and Applicative Theories Based on λη

, &
Bulletin of Symbolic Logic 8 (4):534 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/797964

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

Review: Thomas Strahm, Polynomial Time Operations in Explicit Mathematics ; Andrea Cantini, Feasible Operations and Applicative Theories Based on $\lambda \eta $. [REVIEW]Fernando Ferreira - 2002 - Bulletin of Symbolic Logic 8 (4):534-535.
Thomas Strahm. Polynomial time operations in explicit mathematics. The journal of symbolic logic, vol. 62 , pp. 575–594. - Andrea Cantini. Feasible operations and applicative theories based on λη. Mathematical logic quarterly, vol. 46 , pp. 291–312. [REVIEW]Fernando Ferreira - 2002 - Bulletin of Symbolic Logic 8 (4):534-535.
Feasible Operations and Applicative Theories Based on λη.Andrea Cantini - 2000 - Mathematical Logic Quarterly 46 (3):291-312.
Elementary explicit types and polynomial time operations.Daria Spescha & Thomas Strahm - 2009 - Mathematical Logic Quarterly 55 (3):245-258.
Totality in applicative theories.Gerhard Jäger & Thomas Strahm - 1995 - Annals of Pure and Applied Logic 74 (2):105-120.
On the proof theory of type two functionals based on primitive recursive operations.David Steiner & Thomas Strahm - 2006 - Mathematical Logic Quarterly 52 (3):237-252.
Remarks on applicative theories.Andrea Cantini - 2005 - Annals of Pure and Applied Logic 136 (1-2):91-115.
Truth in applicative theories.Reinhard Kahle - 2001 - Studia Logica 68 (1):103-128.
Realisability in weak systems of explicit mathematics.Daria Spescha & Thomas Strahm - 2011 - Mathematical Logic Quarterly 57 (6):551-565.
Polynomial time operations in explicit mathematics.Thomas Strahm - 1997 - Journal of Symbolic Logic 62 (2):575-594.
Polynomial Time Operations in Explicit Mathematics.Thomas Strahm - 1997 - Journal of Symbolic Logic 62 (2):575-594.
A feasible theory of truth over combinatory algebra.Sebastian Eberhard - 2014 - Annals of Pure and Applied Logic 165 (5):1009-1033.
Applicative theories for the polynomial hierarchy of time and its levels.Reinhard Kahle & Isabel Oitavem - 2013 - Annals of Pure and Applied Logic 164 (6):663-675.
The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories.Gerhard Jäger & Dieter Probst - 2011 - Annals of Pure and Applied Logic 162 (8):647-660.
Universes over Frege structures.Reinhard Kahle - 2003 - Annals of Pure and Applied Logic 119 (1-3):191-223.

Analytics

Added to PP
2022-11-14

Downloads
2 (#1,755,150)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Andrea Cantini
Università degli Studi di Firenze
Fernando Ferreira

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references