Archive for Mathematical Logic 52 (1-2):91-112 (2013)
AbstractResults of R. Miller in 2009 proved several theorems about algebraic fields and computable categoricity. Also in 2009, A. Frolov, I. Kalimullin, and R. Miller proved some results about the degree spectrum of an algebraic field when viewed as a subfield of its algebraic closure. Here, we show that the same computable categoricity results also hold for finite-branching trees under the predecessor function and for connected, finite-valence, pointed graphs, and we show that the degree spectrum results do not hold for these trees and graphs. We also offer an explanation for why the degree spectrum results distinguish these classes of structures: although all three structures are algebraic structures, the fields are what we call effectively algebraic
Similar books and articles
A Real of Strictly Positive Effective Packing Dimension That Does Not Compute a Real of Effective Packing Dimension One.Chris J. Conidis - 2012 - Journal of Symbolic Logic 77 (2):447-474.
Effective Cut-Elimination for a Fragment of Modal Mu-Calculus.Grigori Mints - 2012 - Studia Logica 100 (1-2):279-287.
Future of Ethically Effective Leadership.Chaudhary Imran Sarwar - 2013 - Journal of Business Ethics 113 (1):81-89.
Effective Complexity as a Measure of Information Content.James W. McAllister - 2003 - Philosophy of Science 70 (2):302-307.
Effective Packing Dimension and Traceability.Rod Downey & Keng Meng Ng - 2010 - Notre Dame Journal of Formal Logic 51 (2):279-290.
Emergence in Effective Field Theories.Jonathan Bain - 2013 - European Journal for Philosophy of Science 3 (3):257-273.
The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Added to PP
Historical graph of downloads
Citations of this work
Bi‐Embeddability Spectra and Bases of Spectra.Ekaterina Fokina, Dino Rossegger & Luca San Mauro - 2019 - Mathematical Logic Quarterly 65 (2):228-236.
Classifications of Computable Structures.Karen Lange, Russell Miller & Rebecca M. Steiner - 2018 - Notre Dame Journal of Formal Logic 59 (1):35-59.
References found in this work
Degrees of Categoricity of Computable Structures.Ekaterina B. Fokina, Iskander Kalimullin & Russell Miller - 2010 - Archive for Mathematical Logic 49 (1):51-67.
Degrees Coded in Jumps of Orderings.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (4):1034-1042.
D-Computable Categoricity for Algebraic Fields.Russell Miller - 2009 - Journal of Symbolic Logic 74 (4):1325 - 1351.
Spectra of Structures and Relations.Valentina S. Harizanov & Russel G. Miller - 2007 - Journal of Symbolic Logic 72 (1):324 - 348.