Skip to main content

Existential positive types and preservation under homomorphisms

Publication ,  Conference
Rossman, B
Published in: Proceedings - Symposium on Logic in Computer Science
October 25, 2005

We prove the Finite Homomorphism Preservation Theorem: a first-order formula is preserved under homomorphisms on finite structures iff it is equivalent in the finite to an existential positive formula. We also strengthen the classical homomorphism preservation theorem by showing that a formula is preserved under homomorphisms on all structures iff it is equivalent to an existential positive formula of the same quantifier rank. Our method involves analysis of existential positive types and a new notion of existential positive saturation. © 2005 IEEE.

Duke Scholars

Published In

Proceedings - Symposium on Logic in Computer Science

ISSN

1043-6871

Publication Date

October 25, 2005

Start / End Page

467 / 476
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Rossman, B. (2005). Existential positive types and preservation under homomorphisms. In Proceedings - Symposium on Logic in Computer Science (pp. 467–476).
Rossman, B. “Existential positive types and preservation under homomorphisms.” In Proceedings - Symposium on Logic in Computer Science, 467–76, 2005.
Rossman B. Existential positive types and preservation under homomorphisms. In: Proceedings - Symposium on Logic in Computer Science. 2005. p. 467–76.
Rossman, B. “Existential positive types and preservation under homomorphisms.” Proceedings - Symposium on Logic in Computer Science, 2005, pp. 467–76.
Rossman B. Existential positive types and preservation under homomorphisms. Proceedings - Symposium on Logic in Computer Science. 2005. p. 467–476.

Published In

Proceedings - Symposium on Logic in Computer Science

ISSN

1043-6871

Publication Date

October 25, 2005

Start / End Page

467 / 476