Comparing Classes of Finite Structures

By W. Calvert, Desmond F. Cummins, Sara Miller, Julia F. Knight. 2004

71 citations recorded by the source corpus.

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.

Subfields: Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/a5bebd1f7f25792c164ebe992dc7b6b71c4e2fcc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

V. Harizanov
C. Maher
Julia F. Knight
Alexandra Shlapentokh

Citations in the corpus

Algebraic Number Fields (2006, background): “There are two different notions of effective embedding introduced in [5].”