Studia Logica 52 (2):183 - 195 (1993)
This paper is concerned with decision proceedures for the 0-valued ukasiewicz logics,. It is shown how linear algebra can be used to construct an automated theorem checker. Two decision proceedures are described which depend on a linear programming package. An algorithm is given for the verification of consequence relations in, and a connection is made between theorem checking in two-valued logic and theorem checking in which implies that determing of a -free formula whether it takes the value one is NP-complete problem
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
A Theorem About Infinite-Valued Sentential Logic.Robert McNaughton - 1951 - Journal of Symbolic Logic 16 (1):1-13.
Citations of this work BETA
No citations found.
Similar books and articles
The Simple Substitution Property of Gödel's Intermediate Propositional Logics Sn's.Katsumi Sasaki - 1990 - Studia Logica 49 (4):471 - 481.
Systematization of Finite Many-Valued Logics Through the Method of Tableaux.Walter A. Carnielli - 1987 - Journal of Symbolic Logic 52 (2):473-493.
Identity in Modal Logic Theorem Proving.Francis J. Pelletier - 1993 - Studia Logica 52 (2):291 - 308.
Connection Tableau Calculi with Disjunctive Constraints.Ortrun Ibens - 2002 - Studia Logica 70 (2):241 - 270.
N-Valued Logics and Łukasiewicz–Moisil Algebras.George Georgescu - 2005 - Axiomathes 16 (1-2):123-136.
Added to index2009-01-28
Total downloads22 ( #225,213 of 2,158,934 )
Recent downloads (6 months)1 ( #353,777 of 2,158,934 )
How can I increase my downloads?