Basics of Galois Connections

DOI10.1007/978-3-540-92800-3_3zbMath1171.06301OpenAlexW1527904224MaRDI QIDQ5504699

Ferdinand Börner

Publication date: 22 January 2009

Published in: Complexity of Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92800-3_3

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (6)

The lattice and semigroup structure of multipermutations ⋮ Strong partial clones and the time complexity of SAT problems ⋮ Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem ⋮ On the construction of adjunctions between a fuzzy preposet and an unstructured set ⋮ The Complexity of Valued CSPs ⋮ Boolean max-co-clones

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closure properties for relational systems with given endomorphism structure
• On the algebraic structure of combinatorial problems
• Closed systems of functions and predicates
• Complexity Classifications of Boolean Constraint Satisfaction Problems
• The algebras of partial functions and their invariants
• Closure properties of constraints
• The complexity of maximal constraint languages
• Computer Science Logic
• Function Algebras on Finite Sets
• The complexity of satisfiability problems
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

This page was built for publication: Basics of Galois Connections