Sciweavers

654 search results - page 11 / 131
» Ordered Sets and Complete Lattices
Sort
View
CORR
2011
Springer
151views Education» more  CORR 2011»
12 years 11 months ago
A New Representation Theorem for Many-valued Modal Logics
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of ...
Zoran Majkic
ATVA
2007
Springer
87views Hardware» more  ATVA 2007»
14 years 1 months ago
Latticed Simulation Relations and Games
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
Orna Kupferman, Yoad Lustig
COMBINATORICS
2000
61views more  COMBINATORICS 2000»
13 years 7 months ago
Where the Typical Set Partitions Meet and Join
The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1, . . . , pr are chosen independently and uniformly at random. The probability tha...
Boris Pittel
ISCI
2010
103views more  ISCI 2010»
13 years 6 months ago
Generalized continuous and left-continuous t-norms arising from algebraic semantics for fuzzy logics
This paper focuses on the issue of how generalizations of continuous and leftcontinuous t-norms over linearly ordered sets should be from a logical point of view. Taking into acco...
Carles Noguera, Francesc Esteva, Lluis Godo
EUSFLAT
2003
146views Fuzzy Logic» more  EUSFLAT 2003»
13 years 9 months ago
Cut equivalence of fuzzy relations
Fuzzy relations on the same domain are classified according to the equality of families of cut sets. This equality of fuzzy relations is completely characterized, not only for un...
Branimir Seselja, Andreja Tepavcevic