The complexity of isomorphism for complete theories of linear orders with unary predicates-Reference-Cited by-同舟云学术

The complexity of isomorphism for complete theories of linear orders with unary predicates

Published:2017-02-09 Issue:3-4 Volume:56 Page:289-307
ISSN:0933-5846
Container-title:Archive for Mathematical Logic
language:en
Short-container-title:Arch. Math. Logic

Author:

Rast Richard^ORCID

Publisher

Springer Science and Business Media LLC

Subject

Logic,Philosophy

Link

http://link.springer.com/content/pdf/10.1007/s00153-017-0525-z.pdf

Reference17 articles.

1. Barwise, J.: Back and forth through infinitary logic. In: Morley, M.D., Barwise, J. (eds.) Studies in Model Theory, Studies in Mathematics, vol. 8, pp. 5–34. Mathematical Association of America, Buffalo (1973)

2. Friedman, H., Stanley, L.: A Borel reducibility theory for classes of countable structures. J. Symb. Log. 54, 894–914 (1989)

3. Gao, S.: Invariant Descriptive Set Theory, Chapman & Hall/CRC Pure and Applied Mathematics. CRC Press, Boca Raton (2008)

4. Hjorth, G., Kechris, A., Louveau, A.: Borel equivalence relations induced by actions of the symmetric group. Ann. Pure Appl. Log. 92, 63–112 (1998)

5. Kechris, A.: Classical Descriptive Set Theory, Graduate Texts in Mathematics, 1st edn. Springer, New York (1995)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Characterizing the existence of a Borel complete expansion;Fundamenta Mathematicae;2023

2. AROUND RUBIN’S “THEORIES OF LINEAR ORDER”;The Journal of Symbolic Logic;2020-10-27

3. Stationarily ordered types and the number of countable models;Annals of Pure and Applied Logic;2020-03