Effective algebraicity

Archive for Mathematical Logic 52 (1-2):91-112 (2013)

Abstract
Results 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
Keywords Computability  Computable categoricity  Algebraic field  Computable graph  Computable tree
Categories (categorize this paper)
DOI 10.1007/s00153-012-0308-5
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 38,992
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

A Shorter Model Theory.Wilfrid Hodges - 2000 - Studia Logica 64 (1):133-134.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2013-10-27

Total views
14 ( #494,811 of 2,319,691 )

Recent downloads (6 months)
2 ( #605,822 of 2,319,691 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature