1 - 4 of 4 articles
Branching time logics have been studied in computer science since the 1980s primarily to model the tree of computations for discrete transition systems. Inconsistency measures for propositional logic have been studied since the early 2000s by AI researchers. This paper introduces inconsistency...
is the modal logic of directed partial pre-orders and/or the modal logic of reflexive and transitive relational frames with a final cluster. It holds a distinguished position in philosophical logic, where it has been advocated as the ‘correct’ logic of knowledge; it has also found interesting...
Let MK3 and MK3 be Kleene's strong 3-valued matrix with only one and two designated values, respectively. Next, let MK3 (resp., MK3 ) be defined exactly as MK3 (resp., MK3 ), except that the characteristic Łukasiewicz-type negation of Kleene's strong 3-valued matrix is replaced by a ‘Gödel-type’...
Pretabularity is the attribute of logics that are not characterised by finite matrices, but all of whose proper extensions are. Two of the first-known pretabular logics were Dummett’s famous super-intuitionistic logic LC and the well-known semi-relevance logic RM (= R-Mingle). In this paper, we...
Read and print from thousands of top scholarly journals.
Continue with Facebook
Log in with Microsoft
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.