- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Linear orders with distinguished function symbol
Archive for Mathematical Logic 48 (1):63-76 (2009)
Abstract
We consider certain linear orders with a function on them, and discuss for which types of functions the resulting structure is or is not computably categorical. Particularly, we consider computable copies of the rationals with a fixed-point free automorphism, and also ω with a non-decreasing functionOther Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Cohesive powers of structures.Valentina Harizanov & Keshav Srinivasan - 2024 - Archive for Mathematical Logic 63 (5):679-702.
On superstable generic structures.Koichiro Ikeda & Hirotaka Kikyo - 2012 - Archive for Mathematical Logic 51 (5):591-600.
Degree spectra of the successor relation of computable linear orderings.Jennifer Chubb, Andrey Frolov & Valentina Harizanov - 2009 - Archive for Mathematical Logic 48 (1):7-13.
Generalization of Shapiro’s theorem to higher arities and noninjective notations.Dariusz Kalociński & Michał Wrocławski - 2022 - Archive for Mathematical Logic 62 (1):257-288.
Model completeness of generic graphs in rational cases.Hirotaka Kikyo - 2018 - Archive for Mathematical Logic 57 (7-8):769-794.
On categoricity of scattered linear orders of constructive ranks.Andrey Frolov & Maxim Zubkov - 2025 - Archive for Mathematical Logic 64 (1):279-297.
On categoricity of scattered linear orders of constructive ranks.Andrey Frolov & Maxim Zubkov - 2025 - Archive for Mathematical Logic 64 (1):279-297.
Degrees of isomorphism types and countably categorical groups.Aleksander Ivanov - 2012 - Archive for Mathematical Logic 51 (1):93-98.
Pointwise complexity of the derivative of a computable function.Ethan McCarthy - 2021 - Archive for Mathematical Logic 60 (7):981-994.
A computably stable structure with no Scott family of finitary formulas.Peter Cholak, Richard A. Shore & Reed Solomon - 2006 - Archive for Mathematical Logic 45 (5):519-538.
Analytics
Added to PP
2013-12-01
Downloads
98 (#221,949)
6 months
9 (#328,796)
2013-12-01
Downloads
98 (#221,949)
6 months
9 (#328,796)
Historical graph of 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.
Computably categorical structures and expansions by constants.Peter Cholak, Sergey Goncharov, Bakhadyr Khoussainov & Richard Shore - 1999 - Journal of Symbolic Logic 64 (1):13-37.
Recursively rigid Boolean algebras.Jeffrey B. Remmel - 1987 - Annals of Pure and Applied Logic 36:39-52.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-99fc7d78b-dwqgq uwo