### Skapa referens, olika format (klipp och klistra)

**Harvard**

Hähnle, R. (2002) *Complexity of Many-Valued Logics*.

** BibTeX **

@inbook{

Hähnle2002,

author={Hähnle, Reiner},

title={Complexity of Many-Valued Logics},

booktitle={Beyond Two: Theory and Applications of Multiple-Valued Logic},

isbn={978-3-7908-1541-2},

pages={211-234},

abstract={As is the case for other logics, a number of complexity-related questions can be posed in the context of many-valued logic. Some of these, such as the complexity of the sets of satisfiable and valid formulas in various logics, are completely standard; others only make sense in a many-valued context. In this overview I concentrate on two kinds of complexity problems related to many-valued logic: first, I discuss the complexity of the membership problem in various languages, such as the satisfiable, respectively, the valid formulas in some well-known logics. Second, I discuss the size of representations of many-valued connectives and quantifiers, because this has a direct impact on the complexity of many kinds of deduction systems. I include results on both propositional and on first-order logic.},

year={2002},

}

** RefWorks **

RT Book, Section

SR Print

ID 178239

A1 Hähnle, Reiner

T1 Complexity of Many-Valued Logics

YR 2002

T2 Beyond Two: Theory and Applications of Multiple-Valued Logic

SN 978-3-7908-1541-2

SP 211

OP 234

AB As is the case for other logics, a number of complexity-related questions can be posed in the context of many-valued logic. Some of these, such as the complexity of the sets of satisfiable and valid formulas in various logics, are completely standard; others only make sense in a many-valued context. In this overview I concentrate on two kinds of complexity problems related to many-valued logic: first, I discuss the complexity of the membership problem in various languages, such as the satisfiable, respectively, the valid formulas in some well-known logics. Second, I discuss the size of representations of many-valued connectives and quantifiers, because this has a direct impact on the complexity of many kinds of deduction systems. I include results on both propositional and on first-order logic.

LA eng

OL 30