![Complexity classes / Structural complexity theory / FO / Finite model theory / Computational complexity theory / IP / Homomorphism / NP / Reduction / Symbol / P versus NP problem / Model theory Complexity classes / Structural complexity theory / FO / Finite model theory / Computational complexity theory / IP / Homomorphism / NP / Reduction / Symbol / P versus NP problem / Model theory](https://www.pdfsearch.io/img/13d1452171e33a1a3da6261f18ad6af9.jpg) Date: 2009-11-10 10:55:46Complexity classes Structural complexity theory FO Finite model theory Computational complexity theory IP Homomorphism NP Reduction Symbol P versus NP problem Model theory | | The complexity of positive first-order logic without equality∗ Florent Madelaine Univ Clermont1, EA2146, Laboratoire d’algorithmique et d’image de Clermont-Ferrand, Aubi`ere, F-63170, France. fmadelaine@laic.u-clerAdd to Reading ListSource URL: www.bedewell.comDownload Document from Source Website File Size: 281,57 KBShare Document on Facebook
|