Completeness theorem for the logic characterized by distributive bilattices (Q2721572)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Completeness theorem for the logic characterized by distributive bilattices |
scientific article; zbMATH DE number 1616246
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completeness theorem for the logic characterized by distributive bilattices |
scientific article; zbMATH DE number 1616246 |
Statements
30 January 2002
0 references
axiom system
0 references
completeness theorem
0 references
distributive bilattices
0 references
logic DBL
0 references
Completeness theorem for the logic characterized by distributive bilattices (English)
0 references
The author gives an affirmative solution to the question ``Are there any logics characterized by distributive bilattices?'' He introduces some results about distributive bilattices and the logic DBL. Main results: 1. A sequent \(A\vdash B\) is provable in DBL if and only if \(A\vdash B\) is valid. 2. The logic DBL is decidable.
0 references
