Several papers concerning computable categoricity

Bulletin of Symbolic Logic 18 (1):131 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Equivalence structures and isomorphisms in the difference hierarchy.Douglas Cenzer, Geoffrey LaForte & Jeffrey Remmel - 2009 - Journal of Symbolic Logic 74 (2):535-556.
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.
Computable categoricity of trees of finite height.Steffen Lempp, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Journal of Symbolic Logic 70 (1):151-215.
d-computable Categoricity for Algebraic Fields.Russell Miller - 2009 - Journal of Symbolic Logic 74 (4):1325 - 1351.
Categoricity and indefinite extensibility.James Walmsley - 2002 - Proceedings of the Aristotelian Society 102 (3):217–235.
Limitwise monotonic functions, sets, and degrees on computable domains.Asher M. Kach & Daniel Turetsky - 2010 - Journal of Symbolic Logic 75 (1):131-154.
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions.Martin Davis (ed.) - 1965 - Hewlett, NY, USA: Dover Publication.
Uncomputably Noisy Ergodic Limits.Jeremy Avigad - 2012 - Notre Dame Journal of Formal Logic 53 (3):347-350.
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.
Categoricity and ranks.Jürgen Saffe - 1984 - Journal of Symbolic Logic 49 (4):1379-1392.
Categoricity transfer in simple finitary abstract elementary classes.Tapani Hyttinen & Meeri Kesälä - 2011 - Journal of Symbolic Logic 76 (3):759 - 806.
Computable Isomorphisms of Boolean Algebras with Operators.Bakhadyr Khoussainov & Tomasz Kowalski - 2012 - Studia Logica 100 (3):481-496.

Analytics

Added to PP
2013-10-27

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references