THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS (Q5855748): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1017/jsl.2020.46 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1810.11423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scott sentences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairs of recursive structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable trees of Scott rank <i>ω</i><sub>1</sub><sup><i>CK</i></sup>, and computable approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index sets of computable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Pseudo-Well-Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new computable structures of high rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index sets and Scott sentences / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Borel classification of the isomorphism class of a countable model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robuster Scott rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Up to equimorphism, hyperarithmetic is recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scott sentences and admissible sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant sets in topology and logic / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1017/JSL.2020.46 / rank
 
Normal rank

Latest revision as of 17:37, 30 December 2024

scientific article; zbMATH DE number 7326434
Language Label Description Also known as
English
THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
scientific article; zbMATH DE number 7326434

    Statements

    THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS (English)
    0 references
    0 references
    0 references
    19 March 2021
    0 references
    Scott rank
    0 references
    linear orders
    0 references
    scattered linear orders
    0 references
    Hausdorff rank
    0 references

    Identifiers