Zobrazeno 1 - 10
of 152
pro vyhledávání: '"HARIZANOV, VALENTINA"'
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear orderings ha
Externí odkaz:
http://arxiv.org/abs/2401.14598
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
A cohesive power of a structure is an effective analog of the classical ultrapower of a structure. We start with a computable structure, and consider its countable ultrapower over a cohesive set of natural numbers. A cohesive set is an infinite set o
Externí odkaz:
http://arxiv.org/abs/2304.03371
Autor:
Dimitrov, Rumen, Harizanov, Valentina, Morozov, Andrey, Shafer, Paul, Soskova, Alexandra A., Vatev, Stefan V.
Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the ration
Externí odkaz:
http://arxiv.org/abs/2009.00340
Autor:
Alvir, Rachael, Calvert, Wesley, Goodman, Grant, Harizanov, Valentina, Knight, Julia, Morozov, Andrey, Miller, Russell, Soskova, Alexandra, Weisshaar, Rose
We improve on and generalize a 1960 result of Maltsev. For a field $F$, we denote by $H(F)$ the Heisenberg group with entries in $F$. Maltsev showed that there is a copy of $F$ defined in $H(F)$, using existential formulas with an arbitrary non-commu
Externí odkaz:
http://arxiv.org/abs/2006.11805
Autor:
Dimitrov, Rumen, Harizanov, Valentina, Morozov, Andrey, Shafer, Paul, Soskova, Alexandra, Vatev, Stefan
Cohesive powers of computable structures can be viewed as effective ultraproducts over effectively indecomposable sets called cohesive sets. We investigate the isomorphism types of cohesive powers $\Pi _{C}% \mathcal{L}$ for familiar computable linea
Externí odkaz:
http://arxiv.org/abs/1901.04786
The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of investiga
Externí odkaz:
http://arxiv.org/abs/1811.01224
We define notions of generically and coarsely computable relations and structures and functions between structures. We investigate the existence and uniqueness of equivalence structures in the context of these definitions
Externí odkaz:
http://arxiv.org/abs/1808.02782
Publikováno v:
Journal of the London Mathematical Society; Nov2024, Vol. 110 Issue 5, p1-26, 26p
Autor:
Calvert, Wesley, Harizanov, Valentina, Omodeo, Eugenio G., Policriti, Alberto, Shlapentokh, Alexandra
Publikováno v:
Notices of the American Mathematical Society; Aug2024, Vol. 71 Issue 7, p898-907, 10p