Basics of Galois Connections
From MaRDI portal
Publication:5504699
DOI10.1007/978-3-540-92800-3_3zbMATH Open1171.06301OpenAlexW1527904224MaRDI QIDQ5504699FDOQ5504699
Authors: 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
Recommendations
Cites Work
- Complexity classifications of Boolean constraint satisfaction problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Closure properties of constraints
- Function Algebras on Finite Sets
- The complexity of satisfiability problems
- On the algebraic structure of combinatorial problems
- The algebras of partial functions and their invariants
- The complexity of maximal constraint languages
- Closed systems of functions and predicates
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- Title not available (Why is that?)
- Computer Science Logic
- Closure properties for relational systems with given endomorphism structure
- Title not available (Why is that?)
Cited In (24)
- Biclosed binary relations and Galois connections
- Title not available (Why is that?)
- Title not available (Why is that?)
- The lattice and semigroup structure of multipermutations
- Title not available (Why is that?)
- Some relations between closure operators, inner operators and connections
- Galois Connections for Generalized Functions and Relational Constraints
- The Complexity of Valued CSPs
- A Galois connection between distance functions and inequality relations
- Galois connections and operators
- Static Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some Galois connections in elementary number theory
- Title not available (Why is that?)
- Strong partial clones and the time complexity of SAT problems
- Title not available (Why is that?)
- Boolean max-co-clones
- On the construction of adjunctions between a fuzzy preposet and an unstructured set
- A more important Galois connection between distance functions and inequality relations
- A Galois connection in the social network
- A Galois connection
- Title not available (Why is that?)
- Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem
This page was built for publication: Basics of Galois Connections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504699)