The Complexity of Lukasiewicz Logic

被引：0

作者：

Goldstern, Martin ^{[1
]}

机构：

[1] Vienna Univ Technol, Vienna, Austria

来源：

2013 IEEE 43RD INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL 2013) | 2013年

关键词：

D O I：

10.1109/ISMVL.2013.58

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Lukasiewicz logic is a [0, 1]-valued fuzzy logic with two disjunctions, corresponding to the maximum operation and (truncated) addition. The set of valid formulas for this logic is a complete Pi(0)(2) set. We give a proof of this result and discuss two variants of this logic: a syntactic variant in which only the classical connectives are allowed, and a semantic variant where we restrict the models to structures with decidable relations.

引用

页码：176 / 181

页数：6