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 [Book Review]

Bulletin of Symbolic Logic 8 (4):534-535 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2178/bsl/1182353929

Links

PhilArchive



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

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.
Elementary explicit types and polynomial time operations.Daria Spescha & Thomas Strahm - 2009 - Mathematical Logic Quarterly 55 (3):245-258.
Feasible Operations and Applicative Theories Based on λη.Andrea Cantini - 2000 - Mathematical Logic Quarterly 46 (3):291-312.
Polynomial Time Operations in Explicit Mathematics.Thomas Strahm & Andrea Cantini - 2002 - Bulletin of Symbolic Logic 8 (4):534-535.
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.
Realisability in weak systems of explicit mathematics.Daria Spescha & Thomas Strahm - 2011 - Mathematical Logic Quarterly 57 (6):551-565.
Review: Thomas Strahm, S. Barry Cooper, John K. Truss, First Steps into Metapredicativity in Explicit Mathematics. [REVIEW]Andrea Cantini - 2002 - Bulletin of Symbolic Logic 8 (4):535-536.
A theory of rules for enumerated classes of functions.Andreas Schlüter - 1995 - Archive for Mathematical Logic 34 (1):47-63.
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.
The provably terminating operations of the subsystem of explicit mathematics.Dieter Probst - 2011 - Annals of Pure and Applied Logic 162 (11):934-947.
Two papers by T. Strahm and by A. Cantini on explicit mathematics. [REVIEW]Fernando Ferreira - 2002 - Bulletin of Symbolic Logic 8 (4):534-534.
Cantini Andrea. Logical frameworks for truth and abstraction. An axiomatic study. Studies in logic and the foundations of mathematics, vol. 135. Elsevier, Amsterdam etc. 1996, xii + 461 pp. [REVIEW]Thomas Strahm - 1998 - Journal of Symbolic Logic 63 (1):328-329.
REVIEWS-Two papers-Explicit mathematics.T. Strahm, A. Cantini & Fernando Ferreira - 2002 - Bulletin of Symbolic Logic 8 (4):534-534.
Extending constructive operational set theory by impredicative principles.Andrea Cantini - 2011 - Mathematical Logic Quarterly 57 (3):299-322.

Analytics

Added to PP
2014-03-24

Downloads
39 (#379,248)

6 months
2 (#1,015,942)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references