All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Term Satisfiability in FLew-Algebras

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F16%3A00439177" target="_blank" >RIV/67985807:_____/16:00439177 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.tcs.2016.03.009" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2016.03.009</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.tcs.2016.03.009" target="_blank" >10.1016/j.tcs.2016.03.009</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Term Satisfiability in FLew-Algebras

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10101 - Pure mathematics

Result continuities

  • Project

    <a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2016

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Theoretical Computer Science

  • ISSN

    0304-3975

  • e-ISSN

  • Volume of the periodical

    631

  • Issue of the periodical within the volume

    6 June

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    15

  • Pages from-to

    1-15

  • UT code for WoS article

    000377839900001

  • EID of the result in the Scopus database

    2-s2.0-84977943182