Dualities and dual pairs in Heyting algebras

DOI10.1007/S11083-010-9163-3zbMATH Open1206.06004arXiv0908.0428OpenAlexW2005947941MaRDI QIDQ603889FDOQ603889

Authors: Jan Foniok, J. Nešetřil, Claude Tardif, A. Pultr 

Publication date: 8 November 2010

Published in: Order (Search for Journal in Brave)

Abstract: We extract the abstract core of finite homomorphism dualities using the techniques of Heyting algebras and (combinatorial) categories.

Full work available at URL: https://arxiv.org/abs/0908.0428

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

zbMATH Keywords

homomorphismsfinite dualitygood characterizationstructural theorems in combinatorics

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Preorders, orders, domains and lattices (viewed as categories) (18B35) Heyting algebras (lattice-theoretic aspects) (06D20)

Cites Work

• Graph Theory and Probability
• Title not available (Why is that?)
• Consistency in networks of relations
• Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Applications of product colouring
• A Characterisation of First-Order Constraint Satisfaction Problems
• The core of a graph
• Networks of constraints: Fundamental properties and applications to picture processing
• On digraph coloring problems and treewidth duality
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• A hypergraph-free construction of highly chromatic graphs without short cycles
• Uniquely Colourable Graphs with Large Girth
• Title not available (Why is that?)
• On classes of relations and graphs determined by subobjects and factorobjects
• Duality theorems for finite structures (characterising gaps and good characterisations)
• Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
• Antichains in the homomorphism order of graphs.
• Duality and Polynomial Testing of Tree Homomorphisms
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• On colorings of graphs without short cycles
• On sparse graphs with given colorings and homomorphisms.
• Title not available (Why is that?)
• Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
• Splitting property in infinite posets
• A splitting property of maximal antichains
• Constraints, MMSNP and expander relational structures
• How to split antichains in infinite posets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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
• Title not available (Why is that?)
• Dual categories for endodualisable Heyting algebras: optimization and axiomatization
• 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
• Title not available (Why is that?)

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)