Complexity ranks of countable models
From MaRDI portal
Publication:998136
DOI10.1305/NDJFL/1172787543zbMATH Open1125.03026OpenAlexW2085054174MaRDI QIDQ998136FDOQ998136
Publication date: 10 August 2007
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1172787543
Recommendations
- scientific article; zbMATH DE number 3896909
- Computability-Theoretic Complexity of Countable Structures
- Decidability and the number of countable models
- Algorithmic complexity of countable models of strongly minimal theories
- Definability for model counting
- The classification of countable models of set theory
- scientific article; zbMATH DE number 1556962
- scientific article; zbMATH DE number 32280
- Counting finite models
- scientific article; zbMATH DE number 2204765
Model theory of ordered structures; o-minimality (03C64) Descriptive set theory (03E15) Model theory of denumerable and separable structures (03C15)
Cited In (7)
- INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES
- Scott ranks of models of a theory
- AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS
- A robuster Scott rank
- SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
- Scott rank of Boolean algebras
- Complexity of Ehrenfeucht models
This page was built for publication: Complexity ranks of countable models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998136)
