Comparing Classes of Finite Structures
Algebra i logika, Tome 43 (2004) no. 6, pp. 666-701
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{AL_2004_43_6_a2,
author = {W. Calvert and D. Cummins and J. F. Knight and S. Miller},
title = {Comparing {Classes} of {Finite} {Structures}},
journal = {Algebra i logika},
pages = {666--701},
publisher = {mathdoc},
volume = {43},
number = {6},
year = {2004},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/AL_2004_43_6_a2/}
}
W. Calvert; D. Cummins; J. F. Knight; S. Miller. Comparing Classes of Finite Structures. Algebra i logika, Tome 43 (2004) no. 6, pp. 666-701. http://geodesic.mathdoc.fr/item/AL_2004_43_6_a2/