Abstract:
We compare classes of structures using the notion of a computable embedding, which is a partial order on the classes of structures. Our attention is mainly, but not exclusively, focused on classes of finite structures. Also, a number of problems are formulated.
Keywords:computable embedding, finite prime field, finite linear order, finite-dimensional vector space over rationals, linear order.