Three complexity problems in quantified fuzzy logic (Q5951916)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1687432
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three complexity problems in quantified fuzzy logic |
scientific article; zbMATH DE number 1687432 |
Statements
Three complexity problems in quantified fuzzy logic (English)
0 references
13 May 2002
0 references
It is proved that the set of standard tautologies of predicate Product Logic and of predicate Basic Logic, as well as the set of standard-satisfiable formulas of predicate Basic Logic are not arithmetical. Also, solutions of some problems proposed by \textit{P. Hájek} [``Fuzzy logic and arithmetical hierarchy. III'', Stud. Log. 68, 129-142 (2001; Zbl 0988.03042] are given.
0 references
predicate logic
0 references
many valued logics
0 references
undecidability
0 references
0.8680901527404785
0 references
0.8534530997276306
0 references
0.8485538363456726
0 references
0.848553478717804
0 references
0.8406469821929932
0 references
