Show simple item record

dc.contributor.authorChen, Hubert
dc.contributor.authorMüller, Moritz
dc.date.accessioned2014-02-07T17:47:10Z
dc.date.available2014-02-07T17:47:10Z
dc.date.issued2013-03-29
dc.identifier.citationLogical Methods in Computer Science 9(1) : (2013) // Article N. 15es
dc.identifier.issn1860-5974
dc.identifier.issn10.2168/LMCS-9(1:15)2013
dc.identifier.urihttp://hdl.handle.net/10810/11388
dc.description23 p. -- An extended abstract of this work appears in the proceedings of the 2012 ACM/IEEE Symposium on Logic in Computer Sciencees
dc.description.abstractWe prove an algebraic preservation theorem for positive Horn definability in aleph-zero categorical structures. In particular, we define and study a construction which we call the periodic power of a structure, and define a periomorphism of a structure to be a homomorphism from the periodic power of the structure to the structure itself. Our preservation theorem states that, over an aleph-zero categorical structure, a relation is positive Horn definable if and only if it is preserved by all periomorphisms of the structure. We give applications of this theorem, including a new proof of the known complexity classification of quantified constraint satisfaction on equality templates.es
dc.description.sponsorshipThe first author was partially supported by the Spanish program "Ramon y Cajal" and MICINN grant TIN2010-20967-C04-02. The first author was also supported by by Spanish Project FORMALISM(TIN2007-66523), by the Basque Government Project S-PE12UN050(SAI12/219), and by the University of the Basque Country under grant UFI11/45. The second author thanks the FWF (Austrian Science Fund) for its support through Project P 24654 N25.es
dc.language.isoenges
dc.publisherLogical Methods in Computer Science c/o Institut f. Theoretische Informatik, Technische Universität Braunschweiges
dc.rightsinfo:eu-repo/semantics/openAccesses
dc.subjectalgebraic preservation theoremes
dc.subjectquantified constraint satisfactiones
dc.subjectpolymorphismses
dc.subjectcomplexity classificationes
dc.titleAn Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfactiones
dc.typeinfo:eu-repo/semantics/articlees
dc.rights.holder© H. Chen and M. Müller. This work is licensed under the Creative Commons Attribution-NoDerivs License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nd/2.0/ or send a letter to Creative Commons, 171 Second St, Suite 300, San Fra ncisco, CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germanyes
dc.relation.publisherversionhttp://www.lmcs-online.org/ojs/viewarticle.php?id=1223&layout=abstractes
dc.departamentoesLenguajes y sistemas informáticoses_ES
dc.departamentoeuHizkuntza eta sistema informatikoakes_ES
dc.subject.categoriaCOMPUTER SCIENCE, MULTIDISCIPLINARY
dc.subject.categoriaTHEORETICAL COMPUTER SCIENCE


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record