4 citations · 12 across the 7 of their papers we have counts for
7 papers
Learning Families of Algebraic Structures from Text
Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger +2
We adapt the classical notion of learning from text to computable structure theory. Our main result is a model-theoretic characterization of the learnability from text for classes…
A Lopez-Escobar Theorem for Continuous Domains
Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger +2
We prove an effective version of the Lopez-Escobar theorem for continuous domains. Let be the set of countable structures with universe in vocabulary topologized b…
On cohesive powers of linear orders
Rumen Dimitrov, Valentina Harizanov, Andrey Morozov +3
Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let , , and denote the respective order-…
Interpreting a field in its Heisenberg group
Rachael Alvir, Wesley Calvert, Grant Goodman +6
We improve on and generalize a 1960 result of Maltsev. For a field , we denote by the Heisenberg group with entries in . Maltsev showed that there is a copy of def…
Coding in graphs and linear orderings
Julia Knight, Alexandra Soskova, Stefan Vatev
There is a Turing computable embedding of directed graphs in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform interpretation; i.e., for a…
Cohesive Powers of Linear Orders
Rumen Dimitrov, Valentina Harizanov, Andrey Morozov +3
Cohesive powers of computable structures can be viewed as effective ultraproducts over effectively indecomposable sets called cohesive sets. We investigate the isomorphism types of…
Strong Jump Inversion
W. Calvert, A. Frolov, V. Harizanov +4
We say that a structure admits \emph{strong jump inversion} provided that for every oracle , if computes for some $\mathcal{C}\cong\mathcal{…