English

Term satisfiability in FL$_\mathrm{ew}$-algebras

Logic in Computer Science 2016-08-01 v2 Logic

Abstract

FLew_\mathrm{ew}-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_\mathrm{ew}-terms and FLew_\mathrm{ew}-algebras. For each FLew_\mathrm{ew}-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 FLew_\mathrm{ew}-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_\mathrm{ew}-algebras are computationally hard. Some previous results in the area of term satisfiability in MV-algebras or BL-algebras are thus brought to a common footing with known facts on satisfiability in Heyting algebras.

Keywords

Cite

@article{arxiv.1501.02250,
  title  = {Term satisfiability in FL$_\mathrm{ew}$-algebras},
  author = {Zuzana Haniková and Petr Savický},
  journal= {arXiv preprint arXiv:1501.02250},
  year   = {2016}
}

Comments

the revised version, which benefits from the comments of a reviewer for Theoretical Computer Science, corrects a few minor errors, some parts are reorganized for clarity, and Theorem 5.1 is slightly stronger than in the original version

R2 v1 2026-06-22T07:56:45.048Z