Graduate studies at Western
Studia Logica 52 (2):183 - 195 (1993)
|Abstract||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)|
|Through your library||Configure|
Similar books and articles
Katsumi Sasaki (1990). The Simple Substitution Property of Gödel's Intermediate Propositional Logics Sn's. Studia Logica 49 (4):471 - 481.
N. Shankar (1994). Metamathematics, Machines, and Gödel's Proof. Cambridge University Press.
Walter A. Carnielli (1987). Systematization of Finite Many-Valued Logics Through the Method of Tableaux. Journal of Symbolic Logic 52 (2):473-493.
Hiroakira Ono (1986). Craig's Interpolation Theorem for the Intuitionistic Logic and its Extensions—a Semantical Approach. Studia Logica 45 (1):19 - 33.
Francis J. Pelletier (1993). Identity in Modal Logic Theorem Proving. Studia Logica 52 (2):291 - 308.
Ortrun Ibens (2002). Connection Tableau Calculi with Disjunctive Constraints. Studia Logica 70 (2):241 - 270.
George Georgescu (2006). N-Valued Logics and Łukasiewicz–Moisil Algebras. Axiomathes 16 (1-2):123-136.
Added to index2009-01-28
Total downloads3 ( #213,863 of 739,764 )
Recent downloads (6 months)0
How can I increase my downloads?