Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Rachel Alvir"'
Publikováno v:
The Journal of Symbolic Logic. 86:1706-1720
We define the Scott complexity of a countable structure to be the least complexity of a Scott sentence for that structure. This is a finer notion of complexity than Scott rank: it distinguishes between whether the simplest Scott sentence is $\Sigma _
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a6354eff0984ec13542d6bc7c7c3288
https://doi.org/10.1017/jsl.2021.4
https://doi.org/10.1017/jsl.2021.4
