532 search results - page 14 / 107 » The Logic of Quasi-MV Algebras |
118
Voted
AML
2006
15 years 1 months ago
2006
Lukasiewicz's infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Lukasiewicz algebra on the unit real interva...
107
Voted
APAL
2010
15 years 1 months ago
2010
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
LICS
1998
IEEE
15 years 6 months ago
1998
IEEE
In his well-known paper \How computer should think" ( Be77b]) Belnap argues that four-valued semantics is a very suitable setting for computerized reasoning. In this paper we...
138
click to vote
AMAST
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We develop an algebraic modal logic that combines epistemic and dynamic modalities with a view to modelling information acquisition (learning) by automated agents in a ch...
118
Voted
SIGMOD
2004
ACM
16 years 1 months ago
2004
ACM
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...