- 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
Laforte, G., see Downey, R
Annals of Pure and Applied Logic 95 (1-3):287 (1998)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Completing pseudojump operators.R. Coles, R. Downey, C. Jockusch & G. LaForte - 2005 - Annals of Pure and Applied Logic 136 (3):297-333.
Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
Addendum to “computably enumerable sets and quasi-reducibility”.R. Downey, G. LaForte & A. Nies - 1999 - Annals of Pure and Applied Logic 98 (1-3):295.
Decomposition and infima in the computably enumerable degrees.Rodney G. Downey, Geoffrey L. Laforte & Richard A. Shore - 2003 - Journal of Symbolic Logic 68 (2):551-579.
A δ02 set with barely σ02 degree.Rod Downey, Geoffrey Laforte & Steffen Lempp - 1999 - Journal of Symbolic Logic 64 (4):1700 - 1718.
A $Delta^02$ Set with Barely $Sigma^02$ Degree.Rod Downey, Geoffrey Laforte & Steffen Lempp - 1999 - Journal of Symbolic Logic 64 (4):1700-1718.
On Downey's conjecture.Marat M. Arslanov, Iskander Sh Kalimullin & Steffen Lempp - 2010 - Journal of Symbolic Logic 75 (2):401-441.
A C.E. Real That Cannot Be SW-Computed by Any Ω Number.George Barmpalias & Andrew E. M. Lewis - 2006 - Notre Dame Journal of Formal Logic 47 (2):197-209.
Schnorr trivial sets and truth-table reducibility.Johanna N. Y. Franklin & Frank Stephan - 2010 - Journal of Symbolic Logic 75 (2):501-521.
Serious Comedy: The Philosophical and Theological Significance of Tragic and Comic Writing in the Western Tradition.Patrick Downey - 2000 - Lexington Books.
Why Godel's theorem cannot refute computationalism: A reply to Penrose.Geoffrey LaForte, Patrick J. Hayes & Kenneth M. Ford - 1998 - Artificial Intelligence 104 (1-2):265-286.
2001 european summer meeting of the association for symbolic logic logic colloquium'01.Itay Neeman, Alexander Leitsch, Toshiyasu Arai, Steve Awodey, James Cummings, Rod Downey & Harvey Friedman - 2002 - Bulletin of Symbolic Logic 8 (1):111-180.
Nonhemimaximal degrees and the high/low hierarchy.Fang Chengling & Wu Guohua - 2012 - Journal of Symbolic Logic 77 (2):433-446.
Analytics
Added to PP
2014-03-22
Downloads
6 (#1,434,892)
6 months
6 (#512,819)
2014-03-22
Downloads
6 (#1,434,892)
6 months
6 (#512,819)
Historical graph of downloads
Citations of this work
Theories without the tree property of the second kind.Artem Chernikov - 2014 - Annals of Pure and Applied Logic 165 (2):695-723.
Dp-Minimality: Basic Facts and Examples.Alfred Dolich, John Goodrick & David Lippel - 2011 - Notre Dame Journal of Formal Logic 52 (3):267-288.
Expansions of o-minimal structures by dense independent sets.Alfred Dolich, Chris Miller & Charles Steinhorn - 2016 - Annals of Pure and Applied Logic 167 (8):684-706.
On lovely pairs of geometric structures.Alexander Berenstein & Evgueni Vassiliev - 2010 - Annals of Pure and Applied Logic 161 (7):866-878.
Amalgamation of types in pseudo-algebraically closed fields and applications.Zoé Chatzidakis - 2019 - Journal of Mathematical Logic 19 (2):1950006.
References found in this work
Simple theories.Byunghan Kim & Anand Pillay - 1997 - Annals of Pure and Applied Logic 88 (2-3):149-164.
Notes on the stability of separably closed fields.Carol Wood - 1979 - Journal of Symbolic Logic 44 (3):412-416.
Some remarks on definable equivalence relations in o-minimal structures.Anand Pillay - 1986 - Journal of Symbolic Logic 51 (3):709-714.
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-7c76586df8-4c2ch uwo