Rings of sets
From MaRDI portal
Publication:2645756
Cited in
(99)- Inductive item tree analysis: corrections, improvements, and comparisons
- Rough sets determined by quasiorders
- A decomposition of distributive lattices
- Canonical decompositions in complete lattices
- Exponents of lattice-ordered algebras
- Consistent dually semimodular lattices
- Endomorphism semigroups of finite subset algebras
- Parametrization of knowledge structures
- On alternative representations for knowledge spaces
- On a dependence relation in finite lattices
- Canonical tilting relative generators
- Tarski's theorem on intuitionistic logic, for polyhedra
- The correlational agreement coefficient CA(\(\leq,D\))---a mathematical analysis of a descriptive goodness-of-fit measure
- A Boolean approach to the measurement of group processes and attitudes. The concept of integration as an example
- Extension of M-convexity and L-convexity to polyhedral convex functions
- Topology on digital label images
- On lattice path matroid polytopes: integer points and Ehrhart polynomial
- Robust budget allocation via continuous submodular functions
- A geometric and combinatorial exploration of Hochschild lattices
- The fundamental theorem of finite semidistributive lattices
- Rough set approaches in knowledge structures
- On Galois connections between polytomous knowledge structures and polytomous attributions
- A real polynomial for bipartite graph minimum weight perfect matchings
- A topological duality for monotone expansions of semilattices
- Priestley duality for MV-algebras and beyond
- Finite distributive semilattices
- On the polytomous generalization of knowledge space theory
- Closure and preferences
- Extending the basic local independence model to polytomous data
- Polynomial-time algorithms for submodular Laplacian systems
- Defining rough sets as core-support pairs of three-valued functions
- On the correspondence between knowledge structures and attribution functions
- Recursive decomposition tree of a Moore co-family and closure algorithm.
- On the cardinality of the \(T_0\)-topologies on a finite set
- Powers of ordered sets
- Guarded cubical type theory
- Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets.
- Sublattices of product spaces: Hulls, representations and counting
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings
- Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality?
- Stable allocations and partially ordered sets
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- The categorical equivalence between domains and interpolative generalized closure spaces
- Shortest reconfiguration paths in the solution space of Boolean formulas
- Recursive decomposition and bounds of the lattice of Moore co-families.
- Modified item tree analysis of inductive reasoning data
- Quantum complex projective spaces from Toeplitz cubes
- The configuration space of a robotic arm in a tunnel
- On comparability of bigrassmannian permutations
- A general duality theory for clones
- Signed ring families and signed posets
- scientific article; zbMATH DE number 7439427 (Why is no real title available?)
- A representation of continuous lattices based on closure spaces
- Towards Distributivity in FCA for Phylogenetic Data
- Eilenberg Theorems for Free
- Free Heyting algebra endomorphisms: Ruitenburg’s Theorem and beyond
- Imbedding Infinitely Distributive Lattices Completely Isomorphically Into Boolean Algebras
- Shortest reconfiguration paths in the solution space of Boolean formulas
- A Generalized Version of the Baker–Pixley Theorem
- On transitive Boolean relations
- Distributive lattices have the intersection property.
- Affinely representable lattices, stable matchings, and choice functions
- The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
- Which modal logic is the right one?
- A new type of polytomous surmise system
- Distributive lattices, polyhedra, and generalized flows
- Complete Q‐matrices in conjunctive models on general attribute structures
- Ungarian Markov chains
- On the correspondence between granular polytomous spaces and polytomous surmising functions
- The complete principal divisor lattices
- Weak sense of direction labelings and graph embeddings
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- Abelian envelopes of exact categories and highest weight categories
- On stable assignments generated by choice functions of mixed type
- Rowmotion on \(m\)-Tamari and biCambrian lattices
- Non-distributive lattices, stable matchings, and linear optimization
- Parameterized complexity of submodular minimization under uncertainty
- A categorical equivalence between \(\mathsf{Q} \)-domains and interpolative generalized \(\mathsf{Q} \)-closure spaces
- A Stone-type duality for semilattices with adjunctions
- Approximation operator applications in polytomous knowledge structures
- Covering dimension of finite distributive lattices
- On endomorphism universality of sparse graph classes
- Posetal diagrams for logically-structured semistrict higher categories
- Finding diverse minimum s-t cuts
- Dimensions of knowledge structures
- Stable matchings, choice functions, and linear orders
- Between weak and Bruhat: the middle order on permutations
- Representation of convex geometries of convex dimension 3 by spheres
- Von Neumann-Morgenstern stability and internal closedness in matching theory
- Parameterized complexity of submodular minimization under uncertainty
- Automating boundary filling in cubical type theories
- Surface cluster algebra expansion formulae via loop graphs
- Diamond-kite meshes: adaptive quadrilateral meshing and orthogonal circle packing
- Suppes' Theorem For Probability Logic
- A Sound and Complete Calculus for Probability Inequalities
- Finding diverse solutions in combinatorial problems with a distributive lattice structure
- A poset-based approach to embedding median graphs in hypercubes and lattices
- An almost general splitting theorem for modal logic
- Characterization of super-stable matchings
This page was built for publication: Rings of sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2645756)