Computability and uncountable linear orders. I: Computable categoricity.
From MaRDI portal
Recommendations
Cites work
- Concerning similarity transformations of linearly ordered sets
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- scientific article; zbMATH DE number 1302869 (Why is no real title available?)
- Maximal sets in -recursion theory
- On the recursive functions of ordinal numbers
- Uncomplemented C(X)-Subalgebras of C(X)
Cited in
(9)- Linear orders with distinguished function symbol
- Countably categorical theories
- Cohesive powers of linear orders
- Computable categoricity for pseudo-exponential fields of _1
- Uniform procedures in uncountable structures
- Finding bases of uncountable free abelian groups is usually difficult
- The Complexity of the Collection of Countable Linear Orders of the form I + I
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
- An undecidable linear order that is \(n\)-decidable for all \(n\)
This page was built for publication: Computability and uncountable linear orders. I: Computable categoricity.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5251361)