Abstract: We extract the abstract core of finite homomorphism dualities using the techniques of Heyting algebras and (combinatorial) categories.
Recommendations
- Functor category dualities for varieties of Heyting algebras
- Dual categories for endodualisable Heyting algebras: optimization and axiomatization
- Unification, finite duality and projectivity in varieties of Heyting algebras
- Duality for finite Hilbert algebras
- Optimal natural dualities for varieties of Heyting algebras
Cites work
- scientific article; zbMATH DE number 5595959 (Why is no real title available?)
- scientific article; zbMATH DE number 3515489 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 1310540 (Why is no real title available?)
- scientific article; zbMATH DE number 927067 (Why is no real title available?)
- scientific article; zbMATH DE number 1420978 (Why is no real title available?)
- A Characterisation of First-Order Constraint Satisfaction Problems
- A hypergraph-free construction of highly chromatic graphs without short cycles
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- A splitting property of maximal antichains
- Antichains in the homomorphism order of graphs.
- Applications of product colouring
- Consistency in networks of relations
- Constraints, MMSNP and expander relational structures
- Duality and Polynomial Testing of Tree Homomorphisms
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- Graph Theory and Probability
- How to split antichains in infinite posets
- Networks of constraints: Fundamental properties and applications to picture processing
- On chromatic number of finite set-systems
- On chromatic number of graphs and set-systems
- On classes of relations and graphs determined by subobjects and factorobjects
- On colorings of graphs without short cycles
- On digraph coloring problems and treewidth duality
- On sparse graphs with given colorings and homomorphisms.
- Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
- Splitting property in infinite posets
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The core of a graph
- Uniquely Colourable Graphs with Large Girth
Cited in
(11)- In praise of homomorphisms
- Heyting algebras. Duality theory. Translated from the Russian by A. Evseev
- Unification, finite duality and projectivity in varieties of Heyting algebras
- Dual categories for endodualisable Heyting algebras: optimization and axiomatization
- scientific article; zbMATH DE number 1877041 (Why is no real title available?)
- Functor category dualities for varieties of Heyting algebras
- On the general coloring problem
- Heyting algebras with dual pseudocomplementation
- Discriminator varieties of double-Heyting algebras
- Natural continuity space structures on dual Heyting algebras
- scientific article; zbMATH DE number 794254 (Why is no real title available?)
This page was built for publication: Dualities and dual pairs in Heyting algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603889)
