The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1 School of Engineering and Computing Sciences, Durham University,

First Page		Document Content
Date: 2010-06-03 07:34:14 Computational complexity theory Complexity classes Theory of computation FO PSPACE IP NP P Reduction Homomorphism SO		The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1 School of Engineering and Computing Sciences, Durham University, Add to Reading List Source URL: www.bedewell.com Download Document from Source Website File Size: 230,66 KB Share Document on Facebook

	Every Hodge class on a product of two complex projective K3 surfaces induces a homomorphism of rational Hodge structures between the respective transcendental lattices. Under the hypothesis that this morphism is an isome DocID: 1uej3 - View Document
	Chapter V. Isogenies. In this chapter we define the notion of an isogeny, and we discuss some basic examples, including the multiplication by an integer n != 0 and the relative Frobenius homomorphism in characteristic p DocID: 1u749 - View Document
	Faithfully flat descent Wouter Zomervrucht, November 6, Faithfully flat morphisms A ring homomorphism A → B is faithfully flat if for every sequence N 0 → N → N 00 of Amodules we have that N 0 → N → N 0 DocID: 1t91Z - View Document
	Introduction to the Minimum Cost Homomorphism Problem for Directed and Undirected Graphs Gregory Gutin∗ Eun Jung Kim† DocID: 1sZBc - View Document
	The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1 School of Engineering and Computing Sciences, Durham University, DocID: 1rtIQ - View Document