No label defined (Q4384760)
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 1145524
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1145524 |
Statements
5 January 1999
0 references
lattice of propositional logics
0 references
word problem
0 references
finitely generated logics
0 references
algorithm
0 references
0.7596754431724548
0 references
0.7499648332595825
0 references
0.7493001818656921
0 references
0.7415095567703247
0 references
The author considers logics whose formulas have a single variable. He denotes by \(L\) the set of these logics (in a canonical way \(L\) is a lattice) and by \(L'\) the set of finitely generated logics. In the first part of this paper, the author proves that every finite lattice is imbedded in a canonical way in \(L'\) and every infinitely denumerable lattice is imbedded in \(L\). In the second part of the paper, he constructs an algorithm to solve the problem of equality of two words from finite logics.
0 references