4 citations · 4 across the 3 of their papers we have counts for
3 papers
math.LO2026
Computable Scott Sentences and the Friedman-Stanley embedding
David Gonzalez, Julia Knight
Friedman and Stanley developed the notion of Borel reducibility and illustrated its use in comparing classification problems for some familiar classes of countable structures. For…
math.LO2023★ 4 cited
Scott sentence complexities of linear orderings
David Gonzalez, Dino Rossegger
We study possible Scott sentence complexities of linear orderings using two approaches. First, we investigate the effect of the Friedman-Stanley embedding on Scott sentence complex…
math.LO2022
The -Vaught's Conjecture
David Gonzalez, Antonio Montalbán
We introduce the -Vaught's conjecture, a strengthening of the infinitary Vaught's conjecture. We believe that if one were to prove the infinitary Vaught's conjecture in a struct…