27 search results - page 5 / 6 » Admissible Rules of Lukasiewicz Logic |
113
click to vote
APAL
2006
15 years 25 days ago
2006
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
112
Voted
IANDC
2010
14 years 11 months ago
2010
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
130
Voted
AIML
2006
15 years 2 months ago
2006
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference ...
107
Voted
CIA
2004
Springer
15 years 6 months ago
2004
Springer
Given a specification of communication rules in a multiagent system (in the form of protocols, ACL semantics, etc.), the question of how to design appropriate agents that can oper...
113
Voted
JUCS
2006
15 years 22 days ago
2006
Abstract: Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of...