Author
Jason Block
results may include different authors with the same name
3 papers
We take two approaches to classifying the complexity of Presburger models: Scott analysis and degree spectra. In particular, we investigate the possible Scott sentence complexities and possible degree spectra of models of Presburger…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
Although $S_\infty$ (the group of all permutations of $\mathbb{N}$) is size continuum, both it and its closed subgroups can be presented as the set of paths through a countable tree. The subgroups of $S_\infty$ that can be presented this…