V. Dalmau
First-Order Definable Retraction Problems for Posets and Reflexive Graphs
Dalmau, V.; Krokhin, A.; Larose, B.
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.
Citation
Dalmau, V., Krokhin, A., & Larose, B. (2023, July). First-Order Definable Retraction Problems for Posets and Reflexive Graphs. Presented at 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04), Turku, Finland
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04) |
Start Date | Jul 13, 2023 |
End Date | Jul 17, 2004 |
Publication Date | Jan 1, 2004 |
Deposit Date | Mar 30, 2010 |
Publicly Available Date | Apr 6, 2010 |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 232-241 |
Series Title | Proceedings of 19th International Symposium on Logic in Computer Science {(LICS'04) |
Book Title | 19th annual IEEE symposium on logic in computer science, LICS'04, 13-17 July 2004, Turku, Finland ; proceedings. |
ISBN | 9780769521923 |
DOI | https://doi.org/10.1109/lics.2004.1319617 |
Public URL | https://durham-repository.worktribe.com/output/1163692 |
Publisher URL | http://doi.ieeecomputersociety.org/10.1109/LICS.2004.1319617 |
Files
Published Conference Proceeding
(170 Kb)
PDF
Copyright Statement
©2004 IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
You might also like
Topology and adjunction in promise constraint satisfaction
(2023)
Journal Article
Algebraic Approach to Promise Constraint Satisfaction
(2021)
Journal Article
Robust algorithms with polynomial loss for near-unanimity CSPs
(2019)
Journal Article
Towards a characterization of constant-factor approximable Finite-Valued CSPs
(2018)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search