scientific article; zbMATH DE number 1748069
From MaRDI portal
Publication:4530231
zbMATH Open1002.06001MaRDI QIDQ4530231FDOQ4530231
Authors: Brian A. Davey, Hilary A. Priestley
Publication date: 2 June 2002
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 194916
- scientific article; zbMATH DE number 5367214
- Sets and ordered structures
- Varieties and other classes of lattices. Categorical questions
- Lattices and ordered algebraic structures
- Orders, lattices and relations with applications
- Orders and lattices. Basics, approaches and applications
- Finite ordered sets. Concepts, results and applications
- Concept Lattices
latticeapplicationsformal concept analysispartial orderBoolean algebracongruencesdistributive latticesdomainsfiltersGalois connectionidealsrepresentationalgebraic latticescomplete latticesordered setscomputer scienceBoolean latticeLindenbaum algebraCPOsocial sciencefixpoint theoremsinformations systemssubalgebraic structures
Cited In (only showing first 100 items - show all)
- Groups acting on tensor products.
- Structures of oppositions in public announcement logic
- A new algorithm for Boolean matrix factorization which admits overcovering
- On the topology of the Cambrian semilattices.
- Foundations of inference
- Scholarly influence
- Composite variety-based topological theories
- Axiomatic approaches to rough approximation operators via ideal on a complete completely distributive lattice
- Trimness of closed intervals in Cambrian semilattices
- An asymmetric characterization of the congruence frame
- On A neglected path to intuitionism
- The extended permutohedron on a transitive binary relation.
- On limits and colimits of variety-based topological systems
- The TL-fuzzy rough approximation operators on a lattice
- Dynamic epistemic logics of diffusion and prediction in social networks
- Join-completions of \(L\)-ordered sets
- Fixpoints for general correctness
- Modalities for an allegorical conceptual data model
- Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
- On some semi-intuitionistic logics
- Natural duality, modality, and coalgebra
- On the logic of belief and propositional quantification
- Stanley depth and the lcm-lattice
- A note on the zero divisor graph of a lattice
- Product representation for default bilattices: an application of natural duality theory.
- Using interval arithmetic to prove that a set is path-connected
- Canonical extensions of double quasioperator algebras: an algebraic perspective on duality for certain algebras with binary operations
- Descending chains and antichains of the unary, linear, and monotone subfunction relations
- Fundamental results for pointfree convex geometry
- Representations and dualities for bounded lattices
- A minimum problem for finite sets of real numbers with nonnegative sum
- Rough sets determined by tolerances
- Information algebras in the theory of imprecise probabilities
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights
- Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets.
- On rough set and fuzzy sublattice
- Mechanised wire-wise verification of Handel-C synthesis
- Set choice problems with incomplete information about the preferences of the decision maker
- Title not available (Why is that?)
- A framework for incremental generation of closed itemsets
- Self-commuting lattice polynomial functions on chains
- Formal concept analysis via multi-adjoint concept lattices
- Aggregation and residuation
- Modal event-clock specifications for timed component-based design
- Fuzzy closure systems on \(L\)-ordered sets
- Complexity issues for preorders on finite labeled forests
- A framework for the verification of infinite-state graph transformation systems
- Countable homogeneous linearly ordered posets
- Constructive Boolean circuits and the exactness of timed ternary simulation
- Extension of fuzzy logic operators defined on bounded lattices via retractions
- Canonical extensions and discrete dualities for finitely generated varieties of lattice-based algebras
- Crawley completions of residuated lattices and algebraic completeness of substructural predicate logics
- Dijkstra, Floyd and Warshall meet Kleene
- Priestley duality for paraconsistent Nelson's logic
- On the join dependency relation in multinomial lattices
- Algebras of incidence structures: representations of regular double p-algebras
- Canonical extensions of posets.
- Definition of flat poset and existence theorems for recursive call
- A particular Galois connection between relations and set functions.
- Boolean topological distributive lattices and canonical extensions
- Distributive and completely distributive lattice extensions of ordered sets
- Algebraic modal correspondence: Sahlqvist and beyond
- Duality for double quasioperator algebras via their canonical extensions
- On ordinal sums of triangular norms on bounded lattices
- On canonicity of poset expansions
- Solving non-linear constraint satisfaction problems involving time-dependent functions
- The classification of multipartite quantum correlation
- Multi-adjoint t-concept lattices
- Dual Euclidean Artin groups and the failure of the lattice property.
- Algorithmic correspondence for intuitionistic modal mu-calculus
- Algebraic Kripke-style semantics for relevance logics
- A sharing-based approach to supporting adaptation in service compositions
- The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause
- Beyond vacuity: towards the strongest passing formula
- The \(m\)-cover posets and their applications
- From-below approximations in Boolean matrix factorization: geometry and new algorithm
- TiRS graphs and TiRS frames: a new setting for duals of canonical extensions
- Gödel algebras: interactive dualities and their applications.
- Constraint satisfaction, irredundant axiomatisability and continuous colouring
- Extending conceptualisation modes for generalised formal concept analysis
- Representing roommates' preferences with symmetric utilities
- Pseudo-polynomial functions over finite distributive lattices
- Locales as spectral spaces
- Remarks on homomorphism-homogeneous lattices and semilattices
- Involutive symmetric Gödel spaces, their algebraic duals and logic
- \(\Delta_1\)-completions of a poset.
- Dualization in lattices given by ordered sets of irreducibles
- The homomorphism equation on semilattices
- On Rough Concept Lattices
- Probabilistic argumentation systems. A new way to combine logic with probability.
- Posets of finite functions
- Concept lattices of fuzzy contexts: formal concept analysis vs. rough set theory
- Convexity on complete lattices
- Rules for aggregating information
- Gödel spaces and perfect MV-algebras
- Representation of Nelson algebras by rough sets determined by quasiorders
- Carnap on extremal axioms, ``completeness of the models, and categoricity
- Convergence of preference functions
- A fast algorithm for building lattices
- A non-commutative Priestley duality.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530231)