Rings of sets
From MaRDI portal
Publication:2645756
DOI10.1215/S0012-7094-37-00334-XzbMath0017.19403OpenAlexW2006242427WikidataQ29012741 ScholiaQ29012741MaRDI QIDQ2645756
Publication date: 1937
Published in: Duke Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1215/s0012-7094-37-00334-x
Related Items (74)
Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings ⋮ Priestley duality for MV-algebras and beyond ⋮ Characterization of super-stable matchings ⋮ Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas ⋮ Towards Distributivity in FCA for Phylogenetic Data ⋮ Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas ⋮ On a dependence relation in finite lattices ⋮ Finite distributive semilattices ⋮ Recursive decomposition and bounds of the lattice of Moore co-families. ⋮ On the polytomous generalization of knowledge space theory ⋮ Distributive lattices, polyhedra, and generalized flows ⋮ Closure and preferences ⋮ Imbedding Infinitely Distributive Lattices Completely Isomorphically Into Boolean Algebras ⋮ Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality? ⋮ Canonical tilting relative generators ⋮ On transitive Boolean relations ⋮ Canonical decompositions in complete lattices ⋮ Topology on digital label images ⋮ A new type of polytomous surmise system ⋮ The Configuration Space of a Robotic Arm in a Tunnel ⋮ Complete Q‐matrices in conjunctive models on general attribute structures ⋮ Stable allocations and partially ordered sets ⋮ The complete principal divisor lattices ⋮ Ungarian Markov chains ⋮ Weak sense of direction labelings and graph embeddings ⋮ On the correspondence between granular polytomous spaces and polytomous surmising functions ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) ⋮ Tarski's theorem on intuitionistic logic, for polyhedra ⋮ The categorical equivalence between domains and interpolative generalized closure spaces ⋮ Unnamed Item ⋮ Quantum complex projective spaces from Toeplitz cubes ⋮ Extending the basic local independence model to polytomous data ⋮ Exponents of lattice-ordered algebras ⋮ Free Heyting algebra endomorphisms: Ruitenburg’s Theorem and beyond ⋮ Polynomial-time algorithms for submodular Laplacian systems ⋮ Defining rough sets as core-support pairs of three-valued functions ⋮ Consistent dually semimodular lattices ⋮ On the correspondence between knowledge structures and attribution functions ⋮ On lattice path matroid polytopes: integer points and Ehrhart polynomial ⋮ Recursive decomposition tree of a Moore co-family and closure algorithm. ⋮ On the cardinality of the \(T_0\)-topologies on a finite set ⋮ A Generalized Version of the Baker–Pixley Theorem ⋮ Sublattices of product spaces: Hulls, representations and counting ⋮ The duality between the anti-exchange closure operators and the path independent choice operators on a finite set ⋮ A GENERAL DUALITY THEORY FOR CLONES ⋮ The correlational agreement coefficient CA(\(\leq,D\))---a mathematical analysis of a descriptive goodness-of-fit measure ⋮ Which modal logic is the right one? ⋮ Endomorphism semigroups of finite subset algebras ⋮ Powers of ordered sets ⋮ Eilenberg Theorems for Free ⋮ Robust budget allocation via continuous submodular functions ⋮ Modified item tree analysis of inductive reasoning data ⋮ A geometric and combinatorial exploration of Hochschild lattices ⋮ Affinely representable lattices, stable matchings, and choice functions ⋮ The fundamental theorem of finite semidistributive lattices ⋮ A Boolean approach to the measurement of group processes and attitudes. The concept of integration as an example ⋮ On comparability of bigrassmannian permutations ⋮ Parametrization of knowledge structures ⋮ Rough set approaches in knowledge structures ⋮ A poset-based approach to embedding median graphs in hypercubes and lattices ⋮ Guarded cubical type theory ⋮ Inductive item tree analysis: corrections, improvements, and comparisons ⋮ Signed ring families and signed posets ⋮ Rough sets determined by quasiorders ⋮ Extension of M-convexity and L-convexity to polyhedral convex functions ⋮ On alternative representations for knowledge spaces ⋮ On Galois connections between polytomous knowledge structures and polytomous attributions ⋮ A real polynomial for bipartite graph minimum weight perfect matchings ⋮ A decomposition of distributive lattices ⋮ Distributive lattices have the intersection property ⋮ A topological duality for monotone expansions of semilattices ⋮ An almost general splitting theorem for modal logic ⋮ A representation of continuous lattices based on closure spaces ⋮ Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets.
This page was built for publication: Rings of sets
