|
Published Articles >> Table of Contents >> Abstract
19th Annual IEEE Symposium on Logic in Computer Science (LICS'04)
pp. 232-241
First-Order Definable Retraction Problems for Posets and Reflexive Graphs
Victor Dalmau, University Pompeu Fabra, Spain
Andrei Krokhin, University of Warwick, UK
Benoit Larose, Concordia University, Canada
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2004.1319617
Send link to a friend
| Abstract |
|
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.
|
 Additional Information
|
Citation:
Victor 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
|
|
