Punctual Copies of Algebraic Structures


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

We estimate the complexity of constructing a punctual “online” copy of an algebraic structure. We establish a general upper bound as well as optimal bounds for classes of Boolean algebras, abelian p-groups, and linear orders. Moreover, the methods developed here are applied to solving Montalbán’s open problem (2013) about copyable linear orders.

About the authors

M. V. Zubkov

Kazan (Volga Region) Federal University

Author for correspondence.
Email: Maxim.Zubkov@kpfu.ru
Russian Federation, Kazan

I. Sh. Kalimullin

Kazan (Volga Region) Federal University

Author for correspondence.
Email: Iskander.Kalimullin@kpfu.ru
Russian Federation, Kazan

A. G. Melnikov

Massey University

Author for correspondence.
Email: A.Melnikov@massey.ac.nz
New Zealand, Albany

A. N. Frolov

Kazan (Volga Region) Federal University

Author for correspondence.
Email: a.frolov.kpfu@gmail.com
Russian Federation, Kazan


Copyright (c) 2019 Pleiades Publishing, Ltd.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies