Sergei Tupailo. Realization of analysis into explicit mathematics. The Journal of Symbolic Logic, vol. 66 , pp. 1848–1864 [Book Review]

Bulletin of Symbolic Logic 9 (1):42-43 (2003)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s1079898600004741

Links

PhilArchive



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

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

Realization of Analysis into Explicit Mathematics.Sergei Tupailo - 2003 - Bulletin of Symbolic Logic 9 (1):42-43.
Realization of analysis into explicit mathematics.Sergei Tupailo - 2001 - Journal of Symbolic Logic 66 (4):1848-1864.
Realization of Analysis into Explicit Mathematics.Sergei Tupailo - 2001 - Journal of Symbolic Logic 66 (4):1848-1864.
Realization of constructive set theory into explicit mathematics: a lower bound for impredicative Mahlo universe.Sergei Tupailo - 2003 - Annals of Pure and Applied Logic 120 (1-3):165-196.
Notation Systems for Infinitary Derivations.Wilfried Buchholz & Sergei Tupailo - 2002 - Bulletin of Symbolic Logic 8 (3):437-439.
On the intuitionistic strength of monotone inductive definitions.Sergei Tupailo - 2004 - Journal of Symbolic Logic 69 (3):790-798.
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.
Power Types in Explicit Mathematics?Gerhard Jager - 1997 - Journal of Symbolic Logic 62 (4):1142-1146.
Power types in explicit mathematics?Gerhard Jäger - 1997 - Journal of Symbolic Logic 62 (4):1142-1146.
Systems of explicit mathematics with non-constructive μ-operator and join.Thomas Glaß & Thomas Strahm - 1996 - Annals of Pure and Applied Logic 82 (2):193-219.
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 & Andrea Cantini - 2002 - Bulletin of Symbolic Logic 8 (4):534-535.
Reflections on reflections in explicit mathematics.Gerhard Jäger & Thomas Strahm - 2005 - Annals of Pure and Applied Logic 136 (1-2):116-133.
First Steps into Metapredicativity in Explicit Mathematics.Andrea Cantini - 2002 - Bulletin of Symbolic Logic 8 (4):535-536.
Sergei N. Artemov. Explicit provability and constructive semantics. The bulletin of symbolic logic, vol. 7 , pp. 1–36. [REVIEW]Jeremy D. Avigad - 2002 - Bulletin of Symbolic Logic 8 (3):432-433.

Analytics

Added to PP
2014-03-22

Downloads
31 (#515,349)

6 months
9 (#307,343)

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

No references found.

Add more references