Skip to main navigation Skip to search Skip to main content

ON UNSUPERSTABLE THEORIES IN GDST

  • Miguel Moreno

Research output: Contribution to journalArticlepeer-review

Abstract

We study the -Borel-reducibility of isomorphism relations of complete first-order theories by using coloured trees. Under some cardinality assumptions, we show the following: For all theories T and T', if T is classifiable and T' is unsuperstable, then the isomorphism of models of T' is strictly above the isomorphism of models of T with respect to -Borel-reducibility.

Original languageEnglish
Pages (from-to)1720-1746
Number of pages27
JournalJournal of Symbolic Logic
Volume89
Issue number4
DOIs
StatePublished - 1 Dec 2024

Bibliographical note

Publisher Copyright:
© The Author(s), 2023.

Keywords

  • Ehrenfeucht-Mostowski models
  • classification theory
  • coloured trees
  • generalized descriptive set theory
  • isomorphism

Fingerprint

Dive into the research topics of 'ON UNSUPERSTABLE THEORIES IN GDST'. Together they form a unique fingerprint.

Cite this