loading...
First-Order Definable Retraction Problems for Posets and Reflexive Graphs
Turku, Finland July 13-July 17
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2004.131961719th Annual IEEE Symposium on Logic i ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
V?ctor Dalmau, University Pompeu Fabra, Spain
Andrei Krokhin, University of Warwick, UK
Benoit Larose, Concordia University, Canada
A retraction from a structure P to its substructure Q is a homomorphism from P onto Q that is the identity on Q. We present an algebraic condition which completely characterises all posets and all reflexive graphs Q with the following property: the class of all posets or reflexive graphs, respectively, that admit a retraction onto Q is first-order definable.
Citation:
V?ctor Dalmau, Andrei Krokhin, Benoit Larose, "First-Order Definable Retraction Problems for Posets and Reflexive Graphs," lics, pp.232-241, 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.