Analytic computable structure theory and $$L^p$$ L p -spaces part 2
Archive for Mathematical Logic:1-17 (forthcoming)
| Abstract |
Suppose \ is a computable real. We extend previous work of Clanin, Stull, and McNicholl by determining the degrees of categoricity of the separable \ spaces whose underlying measure spaces are atomic but not purely atomic. In addition, we ascertain the complexity of associated projection maps.
|
| Keywords | No keywords specified (fix it) |
| Categories |
No categories specified (categorize this paper) |
| DOI | 10.1007/s00153-019-00697-4 |
| Options |
Edit this record
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
Degrees of Categoricity and the Hyperarithmetic Hierarchy.Barbara F. Csima, Johanna N. Y. Franklin & Richard A. Shore - 2013 - Notre Dame Journal of Formal Logic 54 (2):215-231.
Degrees of Categoricity of Computable Structures.Ekaterina B. Fokina, Iskander Kalimullin & Russell Miller - 2010 - Archive for Mathematical Logic 49 (1):51-67.
Computably Isometric Spaces.Alexander G. Melnikov - 2013 - Journal of Symbolic Logic 78 (4):1055-1085.
Citations of this work BETA
No citations found.
Similar books and articles
Computability of Compact Operators on Computable Banach Spaces with Bases.Vasco Brattka & Ruth Dillhage - 2007 - Mathematical Logic Quarterly 53 (4‐5):345-364.
Computability and Continuity in Computable Metric Partial Algebras Equipped with Computability Structures.F. Dahlgren - 2004 - Mathematical Logic Quarterly 50 (4):486.
Finite Computable Dimension Does Not Relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.
Classifications of Computable Structures.Karen Lange, Russell Miller & Rebecca M. Steiner - 2018 - Notre Dame Journal of Formal Logic 59 (1):35-59.
Prime Models of Finite Computable Dimension.Pavel Semukhin - 2009 - Journal of Symbolic Logic 74 (1):336-348.
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.
Effectivity in Spaces with Admissible Multirepresentations.Matthias Schröder - 2002 - Mathematical Logic Quarterly 48 (S1):78-90.
Applications of Kolmogorov Complexity to Computable Model Theory.B. Khoussainov, P. Semukhin & F. Stephan - 2007 - Journal of Symbolic Logic 72 (3):1041 - 1054.
Computability of Solutions of Operator Equations.Volker Bosserhoff - 2007 - Mathematical Logic Quarterly 53 (4):326-344.
Computable Structures of Rank.J. F. Knight & J. Millar - 2010 - Journal of Mathematical Logic 10 (1):31-43.
Computable Structures of Rank Omega (Ck)(1).J. F. Knight & J. Millar - 2010 - Journal of Mathematical Logic 10 (1):31-43.
Π10 Classes and Orderable Groups.Reed Solomon - 2002 - Annals of Pure and Applied Logic 115 (1-3):279-302.
On Computability Theoretic Properties of Structures and Their Cartesian Products.Bakhadyr Khoussainov - 2000 - Mathematical Logic Quarterly 46 (4):467-476.
Chainable and Circularly Chainable Semicomputable Sets in Computable Topological Spaces.Eugen Čičković, Zvonko Iljazović & Lucija Validžić - 2019 - Archive for Mathematical Logic 58 (7-8):885-897.
Analytics
Added to PP index
2019-11-01
Total views
1 ( #1,358,153 of 2,270,950 )
Recent downloads (6 months)
1 ( #835,177 of 2,270,950 )
2019-11-01
Total views
1 ( #1,358,153 of 2,270,950 )
Recent downloads (6 months)
1 ( #835,177 of 2,270,950 )
How can I increase my downloads?
Downloads
Sorry, there are not enough data points to plot this chart.
Sorry, there are not enough data points to plot this chart.
