The complexity of positive first-order logic without equality FLORENT MADELAINE Clermont Universit, Universit d’Auvergne, LIMOS. CNRS, UMR 6158, LIMOS. and - Finite model theory - Document - PDFSEARCH.IO

First Page	Meta Content
	The complexity of positive first-order logic without equality FLORENT MADELAINE Clermont Universit, Universit d’Auvergne, LIMOS. CNRS, UMR 6158, LIMOS. and Add to Reading List Document Date: 2011-01-14 21:47:14 Open Document File Size: 317,48 KB Share Result on Facebook

The complexity of positive first-order logic without equality FLORENT MADELAINE Clermont Universit, Universit d’Auvergne, LIMOS. CNRS, UMR 6158, LIMOS. andAdd to Reading List