- Order Spectra and Polynomial-Time Recognizable Sets

@inproceedings{Fagin1974OS,
  title={- Order Spectra and Polynomial-Time Recognizable Sets},
  author={’ Ronald Fagin},
  year={1974}
}
  • ’ Ronald Fagin
  • Published 1974
1. Introduction. A finite structure is a nonempty finite set, along with certain given functions and relations on the set. For example, a finite group is a set A, along with a binary function 0: A X A + A. If u is a sentence of first-order logic, then the spectrum of a is the set of carclinalities of finite structures in which a is tine. For example, let u be the following i%&or&r 
Highly Influential
This paper has highly influenced 47 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.
444 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 444 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Bennet& On specjm

  • J. If
  • Doctoral D-on, Princeton University. Princeton…
  • 1962
Highly Influential
10 Excerpts

The complexfty of theorem-pro&g procedures, Conference Record of Third ACM Sympoa

  • S. Cook
  • on Theory of Computing,
  • 1970
Highly Influential
7 Excerpts

Contibutiona ?o the wm&l ihcory of fialocs&ac~ DoctoraI I%ueztaUon

  • R Fagin
  • 1973
2 Excerpts

Iking machInes and fhe specfm of first - order form & s wifh equality

  • A. L. Selman
  • On the tfme and tape complexity of languages
  • 1973

On the computational complexity of algotithms

  • I. D. Ullman
  • Trans . Amer . Math . Sot .
  • 1965

The intrinsic computazional difflcu!ty of functions, Logic, Methodology, and Philos

  • A. Cobham
  • (Proc. 1964 Internat. Congress). North-Holland…
  • 1965

Das Rep&entantenproblem im Pnidikutenkalkiil de? emten Stufe mit Identiillt

  • G. Asser
  • 2. Math Lqik Grundlagcn Math. 1 (1955). 252-263…
  • 1038

Similar Papers

Loading similar papers…