On the Complexity of Propositional Logics with an Involutive Negation.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F03%3A06030088" target="_blank" >RIV/67985807:_____/03:06030088 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On the Complexity of Propositional Logics with an Involutive Negation.
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/IAA1030004" target="_blank" >IAA1030004: Mathematical foundations of inference under vagueness and uncertainty</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
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
Article name in the collection
Fuzzy logic and Technology.
ISBN
3-9808089-4-7
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
636-639
Publisher name
EUSFLAT
Place of publication
Zittau
Event location
Zittau [DE]
Event date
Sep 10, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—