Sciweavers

9 search results - page 1 / 2
» Bases of Admissible Rules of Lukasiewicz Logic
Sort
View
LOGCOM
2010
135views more  LOGCOM 2010»
13 years 3 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
LOGCOM
2010
114views more  LOGCOM 2010»
13 years 3 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
IGPL
2008
85views more  IGPL 2008»
13 years 5 months ago
Independent Bases of Admissible Rules
We show that IPC, K4, GL, and S4, as well as all logics inheriting their admissible rules, have independent bases of admissible rules. Key words: admissible rule, independent basi...
Emil Jerábek
ENTCS
2010
119views more  ENTCS 2010»
13 years 5 months ago
A Tableau Method for Checking Rule Admissibility in S4
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
Sergey Babenyshev, Vladimir V. Rybakov, Renate A. ...
CSL
2003
Springer
13 years 10 months ago
Atomic Cut Elimination for classical Logic
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explici...
Kai Brünnler