Počet záznamů: 1  

Term Satisfiability in FLew-Algebras

  1. 1.
    SYSNO ASEP0439177
    Druh ASEPJ - Článek v odborném periodiku
    Zařazení RIVJ - Článek v odborném periodiku
    Poddruh JČlánek ve WOS
    NázevTerm Satisfiability in FLew-Algebras
    Tvůrce(i) Haniková, Zuzana (UIVT-O) SAI, RID, ORCID
    Savický, Petr (UIVT-O) SAI, RID, ORCID
    Zdroj.dok.Theoretical Computer Science. - : Elsevier - ISSN 0304-3975
    Roč. 631, 6 June (2016), s. 1-15
    Poč.str.15 s.
    Jazyk dok.eng - angličtina
    Země vyd.NL - Nizozemsko
    Klíč. slovasubstructural logic ; FLew-algebra ; MV-algebra ; satisfiability ; computational complexity
    Vědní obor RIVBA - Obecná matematika
    Obor OECDPure mathematics
    CEPGBP202/12/G061 GA ČR - Grantová agentura ČR
    Institucionální podporaUIVT-O - RVO:67985807
    UT WOS000377839900001
    EID SCOPUS84977943182
    DOI10.1016/j.tcs.2016.03.009
    AnotaceFLew-algebras form the algebraic semantics of the full Lambek calculus with exchange and weakening. We investigate two relations, called satisfiability and positive satisfiability, between FLew-terms and FLew-algebras. For each FLew-algebra, the sets of its satisfiable and positively satisfiable terms can be viewed as fragments of its existential theory; we identify and investigate the complements as fragments of its universal theory. We offer characterizations of those algebras that (positively) satisfy just those terms that are satisfiable in the two-element Boolean algebra providing its semantics to classical propositional logic. In case of positive satisfiability, these algebras are just the nontrivial weakly contractive algebras. In case of satisfiability, we give a characterization by means of another property of the algebra, the existence of a two-element congruence. Further, we argue that (positive) satisfiability problems in FLew-algebras are computationally hard. Some previous results in the area of term satisfiabilty in MV-algebras or BL-algebras, are thus brought to a common footing with, e.g., known facts on satisfiability in Heyting algebras.
    PracovištěÚstav informatiky
    KontaktTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Rok sběru2017
Počet záznamů: 1  

  Tyto stránky využívají soubory cookies, které usnadňují jejich prohlížení. Další informace o tom jak používáme cookies.