Embeddings of Computable Structures
Abstract
We study what the existence of a classical embedding between computable structures implies about the existence of computable embeddings. In particular, we consider the effect of fixing and varying the computable presentations of the computable structuresOther Versions
No versions found
(no proxy)My notes
Similar books and articles
Computable bi-embeddable categoricity.Luca San Mauro,Nikolay Bazhenov,Ekaterina Fokina &Dino Rossegger -2018 -Algebra and Logic 5 (57):392-396.
Turing computable embeddings.Julia Knight,Sara Miller &M. Vanden Boom -2007 -Journal of Symbolic Logic 72 (3):901-918.
Turing computable embeddings.F. Knight Julia,Miller Sara &M. Vanden Boom -2007 -Journal of Symbolic Logic 72 (3):901-918.
Computable Embeddings and Strongly Minimal Theories.J. Chisholm,J. F. Knight &S. Miller -2007 -Journal of Symbolic Logic 72 (3):1031 - 1040.
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey,Bart Kastermans &Steffen Lempp -2009 -Journal of Symbolic Logic 74 (4):1352 - 1366.
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.
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.
The Block Relation in Computable Linear Orders.Michael Moses -2011 -Notre Dame Journal of Formal Logic 52 (3):289-305.
Computable metrization.Tanja Grubba,Matthias Schröder &Klaus Weihrauch -2007 -Mathematical Logic Quarterly 53 (4‐5):381-395.
Spectra of Structures and Relations.Valentina S. Harizanov &Russel G. Miller -2007 -Journal of Symbolic Logic 72 (1):324 - 348.
Analytics
Added to PP
2010-09-13
Downloads
42 (#592,818)
6 months
11 (#332,310)
2010-09-13
Downloads
42 (#592,818)
6 months
11 (#332,310)
Historical graph of downloads
How can I increase my downloads?References found in this work
Effective categoricity of equivalence structures.Wesley Calvert,Douglas Cenzer,Valentina Harizanov &Andrei Morozov -2006 -Annals of Pure and Applied Logic 141 (1):61-78.
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.
Home |New books and articles |Bibliographies |Philosophy journals |About PhilPapers |API |Contact us |Code of conduct
PhilPapers logo byAndrea Andrews andMeghan Driscoll.
This site uses cookies and Google Analytics (see ourterms & conditions for details regarding the privacy implications).Use of this site is subject toterms & conditions.
All rights reserved byThe PhilPapers Foundation
Server: philpapers-web-54b44b69b7-k24bk uwo