11 citations · 37 across the 19 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2016
Hanf Number for Scott Sentences of Computable Structures
Sergey Goncharov, Julia Knight, Ioannis Souldatos
The Hanf number for a set of sentences in (or some other logic) is the least infinite cardinal such that for all , if has models in all infinite car…
math.LO2008
Structures in Familiar Classes Which Have Scott Rank
Wesley Calvert, Sergey S. Goncharov, Julia F. Knight
There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank…