- 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 computable embeddings and coding families of sets
In S. Barry Cooper (ed.), How the World Computes. pp. 539--548 (2012)
Abstract
This article has no associated abstract. (fix it)Author's Profile
My notes
Similar books and articles
Self-Embeddings of Computable Trees.Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl & Reed Solomon - 2008 - Notre Dame Journal of Formal Logic 49 (1):1-37.
Embeddings of Computable Structures.Asher M. Kach, Oscar Levin & Reed Solomon - 2010 - Notre Dame Journal of Formal Logic 51 (1):55-68.
Turing computable embeddings.F. Knight Julia, Miller Sara & M. Vanden Boom - 2007 - Journal of Symbolic Logic 72 (3):901-918.
On Turing degrees of points in computable topology.Iraj Kalantari & Larry Welch - 2008 - Mathematical Logic Quarterly 54 (5):470-482.
Spectra of Structures and Relations.Valentina S. Harizanov & Russel G. Miller - 2007 - Journal of Symbolic Logic 72 (1):324 - 348.
Is there a nonrecursive decidable equational theory?Benjamin Wells - 2002 - Minds and Machines 12 (2):301-324.
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.
Index sets and parametric reductions.Rod G. Downey & Michael R. Fellows - 2001 - Archive for Mathematical Logic 40 (5):329-348.
Prime models of finite computable dimension.Pavel Semukhin - 2009 - Journal of Symbolic Logic 74 (1):336-348.
On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin.Keng Meng Ng - 2009 - Notre Dame Journal of Formal Logic 50 (4):469-493.
A decomposition of the Rogers semilattice of a family of d.c.e. sets.Serikzhan A. Badaev & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (2):618-640.
Codable sets and orbits of computably enumerable sets.Leo Harrington & Robert I. Soare - 1998 - Journal of Symbolic Logic 63 (1):1-28.
Classes of Ulm type and coding rank-homogeneous trees in other structures.E. Fokina, J. F. Knight, A. Melnikov, S. M. Quinn & C. Safranski - 2011 - Journal of Symbolic Logic 76 (3):846 - 869.
Analytics
Added to PP
2014-01-28
Downloads
16 (#883,649)
6 months
2 (#1,232,442)
2014-01-28
Downloads
16 (#883,649)
6 months
2 (#1,232,442)
Historical graph of downloads
Author's Profile
References found in this work
Enumerations in computable structure theory.Sergey Goncharov, Valentina Harizanov, Julia Knight, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Annals of Pure and Applied Logic 136 (3):219-246.
Classes of Ulm type and coding rank-homogeneous trees in other structures.E. Fokina, J. F. Knight, A. Melnikov, S. M. Quinn & C. Safranski - 2011 - Journal of Symbolic Logic 76 (3):846 - 869.
Intrinsic bounds on complexity and definability at limit levels.John Chisholm, Ekaterina B. Fokina, Sergey S. Goncharov, Valentina S. Harizanov, Julia F. Knight & Sara Quinn - 2009 - Journal of Symbolic Logic 74 (3):1047-1060.
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-l2pxr uwo