scientific article; zbMATH DE number 1145524
From MaRDI portal
Publication:4384760
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.
Recommendations
Cited in
(13)- Permutability of rules in lattice theory.
- scientific article; zbMATH DE number 5872048 (Why is no real title available?)
- scientific article; zbMATH DE number 4210204 (Why is no real title available?)
- scientific article; zbMATH DE number 5163096 (Why is no real title available?)
- scientific article; zbMATH DE number 640717 (Why is no real title available?)
- scientific article; zbMATH DE number 679715 (Why is no real title available?)
- Logics of variable inclusion and the lattice of consequence relations
- THE POSET OF ALL LOGICS I: INTERPRETATIONS AND LATTICE STRUCTURE
- scientific article; zbMATH DE number 5214898 (Why is no real title available?)
- Finite axiomatizability of logics of distributive lattices with negation
- Lattices of Intermediate Theories via Ruitenburg's Theorem
- Cut elimination and word problems for varieties of lattices
- Cardinalities of proper ideals in some lattices of strengthenings of the intuitionistic propositional logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4384760)