Three complexity problems in quantified fuzzy logic (Q5951916): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/sLogica/Montagna01, #quickstatements; #temporary_batch_1739530294150 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56083688 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1011958407631 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1580732237 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/sLogica/Montagna01 / rank | |||
Normal rank | |||
Latest revision as of 11:51, 14 February 2025
scientific article; zbMATH DE number 1687432
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
