Počet záznamů: 1
On the Complexity of Propositional Logics with an Involutive Negation
- 1.0405112 - UIVT-O 20030088 RIV DE eng C - Konferenční příspěvek (zahraniční konf.)
Haniková, Zuzana
On the Complexity of Propositional Logics with an Involutive Negation.
Fuzzy logic and Technology. Zittau: EUSFLAT, 2003 - (Wagenknecht, M.; Hampel, R.), s. 636-639. ISBN 3-9808089-4-7.
[EUSFLAT 2003. An International Conference in Fuzzy Logic and Technology. Zittau (DE), 10.09.2003-12.09.2003]
Grant CEP: GA AV ČR IAA1030004
Výzkumný záměr: AV0Z1030915
Klíčová slova: basic fuzzy logic (BL) * strict basic fuzzy logic (SBL) * involutive negation * ~-standard completness * computational complexity
Kód oboru RIV: BA - Obecná matematika
Let C be the propositional calculus given by a standard SBL-algebra; C~ is obtained from C by adding an involutive negation with axioms and deduction rules. Then C~ is coNP-complete.
Trvalý link: http://hdl.handle.net/11104/0125315
Počet záznamů: 1