- 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
Turing meets Schanuel
Annals of Pure and Applied Logic 167 (10):901-938 (2016)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Ax-Schanuel and strong minimality for the j-function.Vahagn Aslanyan - 2021 - Annals of Pure and Applied Logic 172 (1):102871.
Model theory of special subvarieties and Schanuel-type conjectures.Boris Zilber - 2016 - Annals of Pure and Applied Logic 167 (10):1000-1028.
Turing reducibility in the fine hierarchy.Alexander G. Melnikov, Victor L. Selivanov & Mars M. Yamaleev - 2020 - Annals of Pure and Applied Logic 171 (7):102766.
Tracing and domination in the Turing degrees.George Barmpalias - 2012 - Annals of Pure and Applied Logic 163 (5):500-505.
Computable fields and the bounded Turing reduction.Rebecca M. Steiner - 2012 - Annals of Pure and Applied Logic 163 (6):730-742.
Turing Centenary Conference: How the World Computes.S. Barry Cooper, Anuj Dawar, Martin Hyland & Benedikt Löwe - 2014 - Annals of Pure and Applied Logic 165 (9):1353-1354.
Separating families and order dimension of Turing degrees.Ashutosh Kumar & Dilip Raghavan - 2021 - Annals of Pure and Applied Logic 172 (5):102911.
Towards characterizing the >ω2-fickle recursively enumerable Turing degrees.Liling Ko - 2024 - Annals of Pure and Applied Logic 175 (4):103403.
The members of thin and minimal Π 1 0 classes, their ranks and Turing degrees.Rodney G. Downey, Guohua Wu & Yue Yang - 2015 - Annals of Pure and Applied Logic 166 (7-8):755-766.
The ibT degrees of computably enumerable sets are not dense.George Barmpalias & Andrew E. M. Lewis - 2006 - Annals of Pure and Applied Logic 141 (1):51-60.
Analytics
Added to PP
2016-06-30
Downloads
41 (#573,490)
6 months
6 (#572,300)
2016-06-30
Downloads
41 (#573,490)
6 months
6 (#572,300)
Historical graph of downloads
Citations of this work
Decidability bounds for Presburger arithmetic extended by sine.Eion Blanchard & Philipp Hieronymi - 2024 - Annals of Pure and Applied Logic 175 (10):103487.
References found in this work
Pseudo-exponentiation on algebraically closed fields of characteristic zero.Boris Zilber - 2005 - Annals of Pure and Applied Logic 132 (1):67-95.
The classical and the ω-complete arithmetic.C. Ryll-Nardzewski, Andrzej Grzegorczyk & Andrzej Mostowski - 1958 - Journal of Symbolic Logic 23 (2):188-206.
On the structure of semialgebraic sets over p-adic fields.Philip Scowcroft & Lou van den Dries - 1988 - Journal of Symbolic Logic 53 (4):1138-1164.
On the elementary theory of restricted elementary functions.Lou van den Dries - 1988 - Journal of Symbolic Logic 53 (3):796-808.
Alan Turing and the foundations of computable analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.
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-8567d8d854-kjfxj dc2