Upper and lower bounds for first order expressibility
Journal of Computer and System Sciences · 1982 · 255 citations · 15 references
Lower BoundComputational ComplexityHigher-order LogicFirst Order ExpressibilityComputability Theory
15
Generalized first-order spectra and polynomial-time recognizable sets
Ronald Fagin · Medical Entomology and Zoology · 1974
Statistical Signal ProcessingEngineeringApproximation Theory+5
832 citations
An application of games to the completeness problem for formalized theories
Andrzej Ehrenfeucht · Fundamenta Mathematicae · 1961
610 citations
Probabilities on finite models
Ronald Fagin · Journal of Symbolic Logic · 1976
332 citations
Probabilities on finite models
Ronald Fagin · Journal of Symbolic Logic · 1976
244 citations
On the Tape Complexity of Deterministic Context-Free Languages
I. Hal Sudborough · Journal of the ACM · 1978
227 citations