100 search results - page 12 / 20 » A Schemata Calculus for Propositional Logic |
95
Voted
JSYML
2000
15 years 4 days ago
2000
The class of weakly algebrizable logics is defined as the class of logics having monotonic and injective Leibniz operator. We show that "monotonicity" cannot be discarde...
103
click to vote
DEON
2010
Springer
15 years 5 months ago
2010
Springer
In 1926, Mally proposed the first formal deontic system. As Mally and others soon realized, this system had some rather strange consequences. We show that the strangeness of Mally...
106
click to vote
LACL
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. In order to analyse the semantics of natural language sentences a translation into a partial type logic using lexical and logical combinators is presented. The sentences ...
102
Voted
CADE
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
99
Voted
CADE
2004
Springer
16 years 20 days ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...