Provability in predicate product logic (Q884950)
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 5162353
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Provability in predicate product logic |
scientific article; zbMATH DE number 5162353 |
Statements
Provability in predicate product logic (English)
0 references
7 June 2007
0 references
The paper extends the theory of BL-logics introduced by \textit{P. Hájek} in 1998, exploiting the connection of the cancellative conjunctions on BL-algebras with ordered abelian groups. Then a sentence is provable if and only if it is a tautology (completeness). Moreover, closed models and the lexicographic sums are discussed and the completeness of BL-chains which are initially dense (or which are not initially dense) is studied.
0 references
BL-logic
0 references
predicate product logic
0 references
provability
0 references
0.9201806
0 references
0.9179638
0 references
0.9176227
0 references
0 references
0.91516834
0 references
0.9147107
0 references
0 references
