4 citations · 13 across the 9 of their papers we have counts for
9 papers
Punctually Standard and Nonstandard Models of Natural Numbers
Nikolay Bazhenov, Ivan Georgiev, Dariusz Kalociński +2
Abstract models of computation often treat the successor function on as a primitive operation, even though its low-level implementations correspond to non-trivial…
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-…
A Note on Computable Embeddings for Ordinals and Their Reverses
Nikolay Bazhenov, Stefan Vatev
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 si…
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…