loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th Annual IEEE Symposium on Logic in Computer Science (LICS'04)
First-Order Definable Retraction Problems for Posets and Reflexive Graphs
Turku, Finland
July 13-July 17
ISBN: 0-7695-2192-4
ASCII Text
x 
 
V?ctor Dalmau, Andrei Krokhin, Benoit Larose, "First-Order Definable Retraction Problems for Posets and Reflexive Graphs," Logic in Computer Science, Symposium on, pp. 232-241, 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2004.1319617,
author = {V?ctor Dalmau and Andrei Krokhin and Benoit Larose},
title = {First-Order Definable Retraction Problems for Posets and Reflexive Graphs},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2004},
issn = {1043-6871},
pages = {232-241},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2004.1319617},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - First-Order Definable Retraction Problems for Posets and Reflexive Graphs
SN - 1043-6871
SP232
EP241
A1 - V?ctor Dalmau,
A1 - Andrei Krokhin,
A1 - Benoit Larose,
PY - 2004
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
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.