Many-valued computational logics (Q912083)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4143944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Many-valued computational logics |
scientific article; zbMATH DE number 4143944 |
Statements
Many-valued computational logics (English)
0 references
1989
0 references
This paper deals with the problem of decidability of propositional logics defined by finite generalized matrices. The notions of computational logic and of computational semantics are introduced and it is shown that for finitely-valued logics, the class of computational calculi coincides with the class of logics with computational semantics. Moreover, the uniform truth-table theoremhood verification method (uttm) is defined and the class of computational logics with uttm is characterized.
0 references
decidability of propositional logics defined by finite generalized matrices
0 references
computational logic
0 references
computational semantics
0 references
finitely-valued logics
0 references
uniform truth-table theoremhood verification method
0 references
0.95212793
0 references
0 references
