Crawley completions of residuated lattices and algebraic completeness of substructural predicate logics (Q454386)

From MaRDI portal
Revision as of 02:42, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Crawley completions of residuated lattices and algebraic completeness of substructural predicate logics
scientific article

    Statements

    Crawley completions of residuated lattices and algebraic completeness of substructural predicate logics (English)
    0 references
    0 references
    1 October 2012
    0 references
    In this paper, the author discusses Crawley completions of residuated lattices. While MacNeille completions and canonical completions of residuated lattices have been studied by many researchers (including the author), Crawley completions have indeed been studied in many important algebraic structures but not much in residuated lattices. It is known that Crawley completions are regular. Here, the regularity of a completion means that all existing infinite joins and meets in the original algebra are preserved in the completion algebra. Regularity of a completion is an important concept for showing the algebraic completeness of a given logic. In the case of propositional logics, for showing the algebraic completeness, it is enough to consider the Lindenbaum algebra for a given logic. However, in the case of predicate logics it is not enough to consider the Lindenbaum algebras, since the Lindenbaum algebras for predicate logics are not complete and, moreover, such algebras are not free algebras in general, while the Lindenbaum algebras for propositional logics are free. So, for showing algebraic completeness of predicate logics, it is also necessary to add some extra valuation (called safe valuation in this paper). However, still in this setting, one has not as much information as in the case of propositional logics; therefore further investigation of the completions used to construct complete algebras is indispensable in general. Various completions have been investigated, but one of the advantages of Crawley completions is to preserve the joint infinite distributivity law (JID), while MacNeille completions lack this property. The author also studies algebraic structures with Heyting implication. It is known that the JID holds in any algebra in which Heyting implication exists; conversely, if the JID holds in a complete algebra, then we can define Heyting implication. The author proves the equivalence of the following for each commutative residuated lattice \(\mathfrak{A}\): \(\bullet\) The MacNeille completion of \(\mathfrak{A}\) has the JID. \(\bullet\) The algebra \(\mathfrak{A}\) has the JID, and moreover every complete ideal of \(\mathfrak{A}\) is normal. Moreover, he proves that if an algebra has Heyting implication, then Heyting implication exists also in the MacNeille completion of the algebra. Therefore he concludes that the MacNeille completion and the Crawley completion coincide in this setting. Finally, he discusses logical consequences of the Crawley completion of algebras for algebraic completeness of substructural predicate logics: \(\bullet\) Algebraic completeness using Crawley completion. \(\bullet\) Substructural logics adding the axiom schemes that correspond to the JID. \(\bullet\) Conservativity of Heyting implication. \(\bullet\) Ideal completion and existential quantifier-free fragments of logics. This paper contains a deep investigation of the logical consequences of the completions of residuated lattices.
    0 references
    regular completions
    0 references
    Crawley completions
    0 references
    infinite distributivities
    0 references
    residuated lattices
    0 references
    algebraic completeness
    0 references
    substructural predicate logics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references