Zobrazeno 1 - 10
of 24
pro vyhledávání: '"03C57, 03D45"'
Autor:
Ho, Meng-Che "Turbo", Le, Khanh, Rossegger, Dino
We answer a question of Calderoni and Clay by showing that the conjugation equivalence relation of left orderings of the Baumslag-Solitar groups $\mathrm{BS}(1,n)$ is hyperfinite for any $n$. Our proof relies on a classification of $\mathrm{BS}(1,n)$
Externí odkaz:
http://arxiv.org/abs/2405.08442
We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic fields whi
Externí odkaz:
http://arxiv.org/abs/2312.04741
Autor:
Gonzalez, David, Rossegger, Dino
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 complexity and show that it only preserves $\Pi^{\mathrm{in}}_{\alpha}$ compl
Externí odkaz:
http://arxiv.org/abs/2305.07126
Autor:
Andrews, Uri, Mermelstein, Omer
We show that for a model complete strongly minimal theory whose pregeometry is flat, the recursive spectrum (SRM($T$)) is either of the form $[0,\alpha)$ for $\alpha\in \omega+2$ or $[0,n]\cup\{\omega\}$ for $n\in \omega$, or $\{\omega\}$, or contain
Externí odkaz:
http://arxiv.org/abs/2104.14550
Autor:
Paolini, Gianluca
We prove that every quasi-Hopfian finitely presented structure $A$ has a $d$-$\Sigma_2$ Scott sentence, and that if in addition $A$ is computable and $Aut(A)$ satisfies a natural computable condition, then $A$ has a computable $d$-$\Sigma_2$ Scott se
Externí odkaz:
http://arxiv.org/abs/2010.13167
Autor:
Bazhenov, Nikolay, Vatev, Stefan
We continue the study of computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree
Externí odkaz:
http://arxiv.org/abs/2001.06204
Autor:
Andrews, Uri, Mermelstein, Omer
We build a new spectrum of recursive models (SRM(T)) of a strongly minimal theory. This theory is non-disintegrated, flat, model complete, and in a language with a finite signature.
Comment: Final author version
Comment: Final author version
Externí odkaz:
http://arxiv.org/abs/1908.09387
There is a Turing computable embedding $\Phi$ of directed graphs $A$ in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform interpretation; i.e., for all directed graphs $A$, these formulas interpret $A$ in $\Phi(G)$.
Externí odkaz:
http://arxiv.org/abs/1903.06948
We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the entire elemen
Externí odkaz:
http://arxiv.org/abs/1903.00734
Publikováno v:
Algebra and Logic, vol. 60 (2021), no. 3, pp. 163-187
We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree structure. Our m
Externí odkaz:
http://arxiv.org/abs/1901.01933