Automated theorem proving for łukasiewicz logics

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)
DOI 10.1007/BF01058388
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,810
Through your library
References found in this work BETA
A Theorem About Infinite-Valued Sentential Logic.Robert McNaughton - 1951 - Journal of Symbolic Logic 16 (1):1-13.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index

Total downloads
22 ( #235,635 of 2,202,780 )

Recent downloads (6 months)
1 ( #301,722 of 2,202,780 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature