Sciweavers

654 search results - page 5 / 131
» Ordered Sets and Complete Lattices
Sort
View
EUSFLAT
2009
181views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Fuzzy Concept Lattice is Made by Proto-Fuzzy Concepts
Abstract-- An L-fuzzy context is a triple consisting of a set of objects, a set of attributes and an L-fuzzy binary relation between them. An l-cut is a classical context over the ...
Ondrej Kridlo, Stanislav Krajci
DCG
2008
90views more  DCG 2008»
13 years 7 months ago
Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that t...
Louis J. Billera, Samuel K. Hsiao, J. Scott Provan
LFCS
2007
Springer
14 years 1 months ago
Density Elimination and Rational Completeness for First-Order Logics
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
Agata Ciabattoni, George Metcalfe
ISMVL
2008
IEEE
126views Hardware» more  ISMVL 2008»
14 years 1 months ago
Betweenness, Metrics and Entropies in Lattices
We investigate a class of metrics on lattices that are compatible with the partial order defined by the lattice using the ternary relation of betweenness that can be naturally de...
Dan A. Simovici
ORDER
2008
86views more  ORDER 2008»
13 years 7 months ago
Comparison of MacNeille, Canonical, and Profinite Completions
Using duality theory, we give necessary and sufficient conditions for the MacNeille, canonical, and profinite completions of distributive lattices, Heyting algebras, and Boolean al...
Guram Bezhanishvili, Jacob Vosmaer