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)
| Abstract | This article has no associated abstract. (fix it) |
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.1017/s1079898600004741 |
| Options |
Edit this record
Mark as duplicate
Export citation
Request removal from index
|
Download options
Our Archive
Upload a copy of this paper Check publisher's policy Papers currently archived: 50,447
External links
- From the Publisher via CrossRef (no proxy)
- doc.rero.ch
(no proxy) - journals.cambridge.org (no proxy)
- cambridge.org (no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
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.Jeremy D. Avigad - 2002 - Bulletin of Symbolic Logic 8 (3):432-433.
Analytics
Added to PP index
2014-03-22
Total views
18 ( #529,830 of 2,326,367 )
Recent downloads (6 months)
4 ( #212,154 of 2,326,367 )
2014-03-22
Total views
18 ( #529,830 of 2,326,367 )
Recent downloads (6 months)
4 ( #212,154 of 2,326,367 )
How can I increase my downloads?
Downloads
