532 search results - page 23 / 107 » The Logic of Quasi-MV Algebras |
MLQ
2008
13 years 9 months ago
2008
In this paper we carry out an algebraic investigation of the Weak Nilpotent Minimum logic (WNM) and its t-norm based axiomatic extensions. We consider the algebraic counterpart of...
AMAST
1991
Springer
14 years 1 months ago
1991
Springer
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
FSS
2006
13 years 9 months ago
2006
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
WADT
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Computational systems are often represented by means of Kripke structures, and related using simulations. We propose rewriting logic as a flexible and executable framewo...
ICALP
2001
Springer
14 years 2 months ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....