Počet záznamů: 1
Term satisfiability in FLew-algebras
- 1.
SYSNO ASEP 0439176 Druh ASEP V - Výzkumná zpráva Zařazení RIV Záznam nebyl označen do RIV Název Term satisfiability in FLew-algebras Tvůrce(i) Haniková, Zuzana (UIVT-O) SAI, RID, ORCID
Savický, Petr (UIVT-O) SAI, RID, ORCIDVyd. údaje Cornell University, 2015 Edice arXiv.org e-Print archive Č. sv. edice arXiv:1501.02250 [cs.LO] Poč.str. 24 s. Jazyk dok. eng - angličtina Země vyd. US - Spojené státy americké Klíč. slova substructural logic ; FLew-algebra ; MV-algebra ; satisfiability ; computational complexity Vědní obor RIV BA - Obecná matematika CEP GBP202/12/G061 GA ČR - Grantová agentura ČR Institucionální podpora UIVT-O - RVO:67985807 Anotace FLew-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 Kontakt Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Rok sběru 2015
Počet záznamů: 1