Date of Award

1-1-2015

Document Type

Dissertation

Degree Name

Ph.D.

Department

Mathematics

First Advisor

Nikolaos Galatos

Keywords

Distributive lattices, Finite embeddability property, Knotted axioms, Residuated lattices, Strong finite model property, Substructural logics

Abstract

Residuated lattices, although originally considered in the realm of algebra providing a general setting for studying ideals in ring theory, were later shown to form algebraic models for substructural logics. The latter are non-classical logics that include intuitionistic, relevance, many-valued, and linear logic, among others. Most of the important examples of substructural logics are obtained by adding structural rules to the basic logical calculus 𝐅𝐋. We denote by 𝖱𝖫^𝑛_π‘š the varieties of knotted residuated lattices. Examples of these knotted rules include integrality and contraction. The extension of 𝐅𝐋 by the rules corresponding to these two equations is equivalent to Gentzen’s original system 𝐋𝐉 for intuitionism. Apart from applications to logic and to abstract ring theory, residuated lattices are connected to mathematical linguistics, computer science, and quantum mechanics, among other areas. Even thought the connections to other disciplines are abundant, the current document is of purely algebraic nature.

Results in [17] establish the finite model property (FMP) for the implicational fragment of π…π‹πž extended by some knotted rules. The finite embeddability property (FEP) is known to hold for commutative 𝖱𝖫^𝑛_π‘š (π‘₯𝑦 = 𝑦π‘₯); the strong finite model property follows for the corresponding logics. Recent results by Horčík show that the word problem is undecidable for the varieties 𝖱𝖫^𝑛_π‘š when 1 ≀ π‘š < 𝑛 or 2 ≀ 𝑛 < π‘š. Therefore these varieties do not have the FEP. We refer the reader to [16] for details on how this is connected to the Burnside problems in group theory and to regularity of languages in automata theory.

In the present document, using purely algebraic methods, we prove the FEP for subvarieties of 𝖱𝖫^𝑛_π‘š and 𝖣𝖱𝖫^𝑛_π‘š that satisfy properties weaker than commutativity. The proof uses the theory of residuated frames introduced by Galatos and Jipsen .

In Chapter 1, we present the basic definitions and constructions that will be used throughout the full document. We point the reader towards Section 1.4, where we list a relevant list of varieties for which the FEP holds or not.

Chapter 2 presents a proof of the FEP for subvarieties of 𝖱𝖫^𝑛_π‘š that satisfy the identity π‘₯𝑦π‘₯ = π‘₯^2𝑦. The proof of this case relies on finding the free object over the class of pomonoids that satisfy the previous equality and π‘₯π‘š ≀ π‘₯𝑛.

Chapter 3 focuses on the study of the noncommutative equation that we use to define the varieties studied in the following two chapters. This equation arises as a natural generalization of the basic equation π‘₯𝑦π‘₯ = π‘₯^2𝑦.

Chapter 4 presents the FEP for 𝖱𝖫^𝑛_π‘š. In the general case, the free object in the class is fairly complicated, so we identify instead an object outside the class, which is both free and structured enough to allow us to prove the result. In the last section, we extend our result to cover some other subvarieties of knotted residuated lattices. These subvarieties include the cyclic, cyclic-involutive, and representable ones.

Chapter 5 details a proof for the fully distributive case. Here we enrich the free object discovered in Chapter 4 by creating the meet semilattice generated by it.

We remark that the FEP for a variety 𝒱 is equivalent to the condition that all finitely presented algebras in 𝒱 are residually finite. Varieties of semigroups with this property have been fully characterized in [20]. In particular, the variety of monoids axiomatized by π‘₯𝑦π‘₯ = π‘₯^2𝑦 has been studied and has the FEP. These results do not imply the FEP for the corresponding variety of residuated lattices, which also serves as the simplest case of our analysis.

Provenance

Recieved from ProQuest

Rights holder

Riquelmi Salvador Cardona Fuentes

File size

100 p.

File format

application/pdf

Language

en

Discipline

Mathematics, Logic

Share

COinS