|
This article is cited in 54 scientific papers (total in 54 papers)
Comparing Classes of Finite Structures
W. Calverta, D. Cumminsb, J. F. Knighta, S. Millera a University of Notre Dame
b University of Illinois at Urbana-Champaign
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.
Received: 20.10.2003
Citation:
W. Calvert, D. Cummins, J. F. Knight, S. Miller, “Comparing Classes of Finite Structures”, Algebra Logika, 43:6 (2004), 666–701; Algebra and Logic, 43:6 (2004), 374–392
Linking options:
https://www.mathnet.ru/eng/al103 https://www.mathnet.ru/eng/al/v43/i6/p666
|
Statistics & downloads: |
Abstract page: | 535 | Full-text PDF : | 155 | References: | 77 | First page: | 1 |
|