Lewis Dichotomies in Many-Valued Logics

Studia Logica 100 (6):1271-1290 (2012)
Abstract
In 1979, H. Lewis shows that the computational complexity of the Boolean satisfiability problem dichotomizes, depending on the Boolean operations available to formulate instances: intractable (NP-complete) if negation of implication is definable, and tractable (in P) otherwise [21]. Recently, an investigation in the same spirit has been extended to nonclassical propositional logics, modal logics in particular [2, 3]. In this note, we pursue this line in the realm of many-valued propositional logics, and obtain complexity classifications for the parameterized satisfiability problem of two pertinent samples, Kleene and Gödel logics
Keywords Parameterized satisfiability  Complexity dichotomy  Many-valued logics
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,351
External links
  •   Try with proxy.
  • Through your library Configure
    References found in this work BETA
    Alfred Horn (1969). Free L-Algebras. Journal of Symbolic Logic 34 (3):475-480.
    Citations of this work BETA

    No citations found.

    Similar books and articles
    Volker Weber (2009). Branching-Time Logics Repeatedly Referring to States. Journal of Logic, Language and Information 18 (4):593-624.
    Analytics

    Monthly downloads

    Added to index

    2012-11-15

    Total downloads

    3 ( #223,856 of 1,088,371 )

    Recent downloads (6 months)

    1 ( #69,449 of 1,088,371 )

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.