- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A note on computable real fields
Journal of Symbolic Logic 35 (2):239-241 (1970)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Canonical forms for definable subsets of algebraically closed and real closed valued fields.Jan E. Holly - 1995 - Journal of Symbolic Logic 60 (3):843-860.
Relative Randomness and Real Closed Fields.Alexander Raichev - 2005 - Journal of Symbolic Logic 70 (1):319 - 330.
Groundwork for weak analysis.António M. Fernandes & Fernando Ferreira - 2002 - Journal of Symbolic Logic 67 (2):557-578.
The approximation structure of a computably approximable real.George Barmpalias - 2003 - Journal of Symbolic Logic 68 (3):885-922.
Some model theory for almost real closed fields.Françoise Delon & Rafel Farré - 1996 - Journal of Symbolic Logic 61 (4):1121-1152.
Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.
Alan Turing and the foundations of computable analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.
The computable dimension of trees of infinite height.Russell Miller - 2005 - Journal of Symbolic Logic 70 (1):111-141.
The Block Relation in Computable Linear Orders.Michael Moses - 2011 - Notre Dame Journal of Formal Logic 52 (3):289-305.
Analytics
Added to PP
2009-01-28
Downloads
27 (#584,888)
6 months
10 (#261,125)
2009-01-28
Downloads
27 (#584,888)
6 months
10 (#261,125)
Historical graph of downloads
Citations of this work
Domain representability of metric spaces.Jens Blanck - 1997 - Annals of Pure and Applied Logic 83 (3):225-247.
Degree spectra of real closed fields.Russell Miller & Victor Ocasio González - 2019 - Archive for Mathematical Logic 58 (3-4):387-411.
Computable dimension for ordered fields.Oscar Levin - 2016 - Archive for Mathematical Logic 55 (3-4):519-534.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-659b74868d-nj4fk uwo