Sciweavers

65 search results - page 5 / 13
» logcom 2006
Sort
View
LOGCOM
2000
103views more  LOGCOM 2000»
15 years 2 days ago
A geometric proof of confluence by decreasing diagrams
The criterion for confluence using decreasing diagrams is a generalization of several well-known confluence criteria act rewriting, such as the strong confluence lemma. We give a ...
Jan Willem Klop, Vincent van Oostrom, Roel C. de V...
LOGCOM
2002
92views more  LOGCOM 2002»
14 years 12 months ago
Operators and Laws for Combining Preference Relations
The paper is a theoretical study of a generalization of the lexicographic rule for combining ordering relations. We define the concept of priority operator: a priority operator ma...
Hajnal Andréka, Mark Ryan, Pierre-Yves Scho...
LOGCOM
2010
85views more  LOGCOM 2010»
14 years 10 months ago
The Logic of Quasi-MV Algebras
The algebraic theory of quasi-MV algebras, generalisations of MV algebras arising in quantum computation, is by now rather well-developed. Although it is possible to define sever...
Félix Bou, Francesco Paoli, Antonio Ledda, ...
LOGCOM
2010
114views more  LOGCOM 2010»
14 years 10 months ago
Admissible Rules of Lukasiewicz Logic
We investigate admissible rules of Lukasiewicz multi-valued propositional logic. We show that admissibility of multiple-conclusion rules in Lukasiewicz logic, as well as validity ...
Emil Jerábek
LOGCOM
2010
135views more  LOGCOM 2010»
14 years 10 months ago
Bases of Admissible Rules of Lukasiewicz Logic
We construct explicit bases of single-conclusion and multiple-conclusion admissible rules of propositional Lukasiewicz logic, and we prove that every formula has an admissibly sat...
Emil Jerábek