The Borel complexity of isomorphism for theories with many types

DOI10.1305/ndjfl/1172787547zbMath1124.03012OpenAlexW2052109264MaRDI QIDQ998140

David Marker

Publication date: 10 August 2007

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/815f9e0d262f16d70b56d9ac8b0038580e8b6513

zbMATH Keywords

Scott setBorel equivalence relationS-saturated model

Mathematics Subject Classification ID

Descriptive set theory (03E15) Model theory of denumerable and separable structures (03C15)

Related Items (3)

The Complexity of Classification Problems for Models of Arithmetic ⋮ The complexity of isomorphism for complete theories of linear orders with unary predicates ⋮ THE BOREL COMPLEXITY OF ISOMORPHISM FOR O-MINIMAL THEORIES

This page was built for publication: The Borel complexity of isomorphism for theories with many types