Quantified Representation of Uncertainty and Imprecision 1998
DOI: 10.1007/978-94-017-1735-9_2
|View full text |Cite
|
Sign up to set email alerts
|

Multi-Valued Logics

Abstract: This is the final version of a survey on many-valued logic to appear as Chapter 2 of Volume 1 "Quantified Representation of Uncertainty and Imprecision" of a "Handbook of Defensible Reasoning and Uncertainty Management Systems" to be published by Kluwer. The editors of the Handbook are D. Gabbay and P. Smets, and the editors of Volume 1 are D. Gillies and P. Smets. Contents 4 Why many-valued logic? 30 References 31

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2003
2003
2018
2018

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 70 publications
(92 reference statements)
0
6
0
Order By: Relevance
“…82 See also Panti [209], p.48, §2.5.1 Bochvar's and Kleene's systems: "In addition to 0 and 1 for false and true, they have a third value 2. While for Łukasiewicz the third value stands for possible, or not yet detennined, from Bochvar's point of view it stands for paradoxical, or meaningless.…”
Section: Ex Contradictione Quodlibet (Ecq)mentioning
confidence: 99%
See 1 more Smart Citation
“…82 See also Panti [209], p.48, §2.5.1 Bochvar's and Kleene's systems: "In addition to 0 and 1 for false and true, they have a third value 2. While for Łukasiewicz the third value stands for possible, or not yet detennined, from Bochvar's point of view it stands for paradoxical, or meaningless.…”
Section: Ex Contradictione Quodlibet (Ecq)mentioning
confidence: 99%
“…] Also Langer [171] reaffirms these comments (emphasis added in bold font. Italic font is in the original): 209 The same theorem may follow from more than one possible selection of premises ... But contradictory theorems can never follow from consistent postulates.…”
Section: Lnc Is the Test For Consistency Of An Axiomatic Systemmentioning
confidence: 99%
“…This issue is well known from primitive recursive function theory. The formal definition of the emptiness test is based on the Kleene's system of "strong connectives" [31]. 3 The corresponding operations of the three valued logic are negation ¬ 3 , disjunction ∨ 3 , and conjunction ∧ 3 .…”
Section: Emptiness Test Of Annotated Dfamentioning
confidence: 99%
“…emptiness test is based on the Kleene's system of "strong connectives" (Panti, 1995). (The special definition of implications of this system is not required in the presented approach.)…”
Section: Emptiness Test Of Annotated Fsamentioning
confidence: 99%