{"id":{"repo_id":"denver","oai_identifier":"oai:digitalcommons.du.edu:etd-3452"},"canonical_url":"https://search.ndltd.org/etd/denver/oai:digitalcommons.du.edu:etd-3452","repository":{"repo_id":"denver","name":"University of Denver","base_url":"https://digitalcommons.du.edu/do/oai/"},"display":{"title":"Diagrams in Involutive Residuated Lattices","abstract":"First, we show that every distributive lattice-ordered pregroup can be embedded into a functional algebra over an integral chain, thereby improving the existing Cayley/Holland style embedding theorem. Using this result, we demonstrate that the variety of all dis tributive lattice-ordered pregroups is generated by the functional algebra on the integers. Additionally, we prove that the equational theory of this variety is decidable. Next, we establish that DLP is equal to the join of its subvarieties LPn, where 𝑛 ∈ ℤ+, consisting of 𝑛-periodic ℓ-pregroups. We also prove that every algebra in LPn can be embedded into the subalgebra 𝙵𝑛(Ω) of 𝑛-periodic elements of 𝙵(Ω), for some integral chain Ω. This representation shows that, for every 𝑛, the variety LPn is generated by the single algebra 𝙵𝑛(ℚ →⨯ℤ), noting that the chain ℚ →⨯ℤ is independent of 𝑛. We further establish that every algebra in LPn can be embedded into the wreath product of an ℓ-group and 𝙵𝑛(ℤ), highlighting the significant role of the simple 𝑛-periodic ℓ-pregroup 𝙵𝑛(ℤ). We also show that the join of the varieties 𝖵(𝙵𝑛(ℤ)) equals DLP and thus matches the join of the varieties LPn, even though 𝖵(𝙵𝑛(ℤ)) ≠ LPn for any single 𝑛. In this way, DLP has two different well-behaved approximations. Additionally, we demonstrate that, for every 𝑛, the equational theory of 𝙵𝑛(ℤ) is decidable. Using the wreath product decomposition, we establish that the equational theory of LPn is also decidable. Applying similar strategies, we investigate certain varieties of full weakening relations on a chain and prove the decidability of these varieties. We also present the construction of a potential non-distributive ℓ-pregroup and provide preliminary results towards proving this claim.","abstract_html":"First, we show that every distributive lattice-ordered pregroup can be embedded into a functional algebra over an integral chain, thereby improving the existing Cayley/Holland style embedding theorem. Using this result, we demonstrate that the variety of all dis tributive lattice-ordered pregroups is generated by the functional algebra on the integers. Additionally, we prove that the equational theory of this variety is decidable. Next, we establish that DLP is equal to the join of its subvarieties LPn, where 𝑛 ∈ ℤ+, consisting of 𝑛-periodic ℓ-pregroups. We also prove that every algebra in LPn can be embedded into the subalgebra 𝙵𝑛(Ω) of 𝑛-periodic elements of 𝙵(Ω), for some integral chain Ω. This representation shows that, for every 𝑛, the variety LPn is generated by the single algebra 𝙵𝑛(ℚ →⨯ℤ), noting that the chain ℚ →⨯ℤ is independent of 𝑛. We further establish that every algebra in LPn can be embedded into the wreath product of an ℓ-group and 𝙵𝑛(ℤ), highlighting the significant role of the simple 𝑛-periodic ℓ-pregroup 𝙵𝑛(ℤ). We also show that the join of the varieties 𝖵(𝙵𝑛(ℤ)) equals DLP and thus matches the join of the varieties LPn, even though 𝖵(𝙵𝑛(ℤ)) ≠ LPn for any single 𝑛. In this way, DLP has two different well-behaved approximations. Additionally, we demonstrate that, for every 𝑛, the equational theory of 𝙵𝑛(ℤ) is decidable. Using the wreath product decomposition, we establish that the equational theory of LPn is also decidable. Applying similar strategies, we investigate certain varieties of full weakening relations on a chain and prove the decidability of these varieties. We also present the construction of a potential non-distributive ℓ-pregroup and provide preliminary results towards proving this claim.","abstract_has_math":false,"creators":["Gallardo, Isis A."],"institution":null,"degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":null,"degree_department":null,"school":null,"contributors":["Nikolaos Galatos","Michael Kinyon","Petr Vojtěchovský","Mandi Schaeffer Fry","Mohammad Mahoor"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:55:07Z","subjects":["Decidability","Diagrams","Generation","Involutive","Residuated lattices","Algebra","Applied Mathematics","Mathematics","Number Theory","Physical Sciences and Mathematics"],"languages":["English (eng)"],"rights":["<p>Copyright is held by the author. User is responsible for all copyright compliance.</p>","Isis A. Gallardo"],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.du.edu/etd/2455","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.du.edu/etd/2455","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.du.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.du.edu%3Aetd-3452","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Nikolaos Galatos","Michael Kinyon","Petr Vojtěchovský","Mandi Schaeffer Fry","Mohammad Mahoor"]},{"key":"dc:creator","label":"Author","values":["Gallardo, Isis A."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2025-09-27T07:00:00Z"]},{"key":"dc:date.copyright","label":"Dc Date Copyright","values":["2024-08-01T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2024-08-24T07:00:00Z"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Decidability","Diagrams","Generation","Involutive","Residuated lattices","Algebra","Applied Mathematics","Mathematics","Number Theory","Physical Sciences and Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English (eng)"]},{"key":"dc:rights","label":"Dc Rights","values":["<p>Copyright is held by the author. User is responsible for all copyright compliance.</p>"]},{"key":"dc:rights.holder","label":"Dc Rights Holder","values":["Isis A. Gallardo"]},{"key":"dc:rights.license","label":"Dc Rights License","values":["all_rights_reserved"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.du.edu/etd/2455"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["First, we show that every distributive lattice-ordered pregroup can be embedded into a functional algebra over an integral chain, thereby improving the existing Cayley/Holland style embedding theorem. Using this result, we demonstrate that the variety of all dis tributive lattice-ordered pregroups is generated by the functional algebra on the integers. Additionally, we prove that the equational theory of this variety is decidable. Next, we establish that DLP is equal to the join of its subvarieties LPn, where 𝑛 ∈ ℤ+, consisting of 𝑛-periodic ℓ-pregroups. We also prove that every algebra in LPn can be embedded into the subalgebra 𝙵𝑛(Ω) of 𝑛-periodic elements of 𝙵(Ω), for some integral chain Ω. This representation shows that, for every 𝑛, the variety LPn is generated by the single algebra 𝙵𝑛(ℚ →⨯ℤ), noting that the chain ℚ →⨯ℤ is independent of 𝑛. We further establish that every algebra in LPn can be embedded into the wreath product of an ℓ-group and 𝙵𝑛(ℤ), highlighting the significant role of the simple 𝑛-periodic ℓ-pregroup 𝙵𝑛(ℤ). We also show that the join of the varieties 𝖵(𝙵𝑛(ℤ)) equals DLP and thus matches the join of the varieties LPn, even though 𝖵(𝙵𝑛(ℤ)) ≠ LPn for any single 𝑛. In this way, DLP has two different well-behaved approximations. Additionally, we demonstrate that, for every 𝑛, the equational theory of 𝙵𝑛(ℤ) is decidable. Using the wreath product decomposition, we establish that the equational theory of LPn is also decidable. Applying similar strategies, we investigate certain varieties of full weakening relations on a chain and prove the decidability of these varieties. We also present the construction of a potential non-distributive ℓ-pregroup and provide preliminary results towards proving this claim."]},{"key":"dc:description.provenance","label":"Dc Description Provenance","values":["Received from Author"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:format.extent","label":"Dc Format Extent","values":["155 pgs","1.1 MB"]},{"key":"dc:title","label":"Title","values":["Diagrams in Involutive Residuated Lattices"]}]}],"canonical_facts":{"dc:contributor":["Nikolaos Galatos","Michael Kinyon","Petr Vojtěchovský","Mandi Schaeffer Fry","Mohammad Mahoor"],"dc:creator":["Gallardo, Isis A."],"dc:date.available":["2025-09-27T07:00:00Z"],"dc:date.copyright":["2024-08-01T07:00:00Z"],"dc:date.created":["2024-08-24T07:00:00Z"],"dc:description.abstract":["First, we show that every distributive lattice-ordered pregroup can be embedded into a functional algebra over an integral chain, thereby improving the existing Cayley/Holland style embedding theorem. Using this result, we demonstrate that the variety of all dis tributive lattice-ordered pregroups is generated by the functional algebra on the integers. Additionally, we prove that the equational theory of this variety is decidable. Next, we establish that DLP is equal to the join of its subvarieties LPn, where 𝑛 ∈ ℤ+, consisting of 𝑛-periodic ℓ-pregroups. We also prove that every algebra in LPn can be embedded into the subalgebra 𝙵𝑛(Ω) of 𝑛-periodic elements of 𝙵(Ω), for some integral chain Ω. This representation shows that, for every 𝑛, the variety LPn is generated by the single algebra 𝙵𝑛(ℚ →⨯ℤ), noting that the chain ℚ →⨯ℤ is independent of 𝑛. We further establish that every algebra in LPn can be embedded into the wreath product of an ℓ-group and 𝙵𝑛(ℤ), highlighting the significant role of the simple 𝑛-periodic ℓ-pregroup 𝙵𝑛(ℤ). We also show that the join of the varieties 𝖵(𝙵𝑛(ℤ)) equals DLP and thus matches the join of the varieties LPn, even though 𝖵(𝙵𝑛(ℤ)) ≠ LPn for any single 𝑛. In this way, DLP has two different well-behaved approximations. Additionally, we demonstrate that, for every 𝑛, the equational theory of 𝙵𝑛(ℤ) is decidable. Using the wreath product decomposition, we establish that the equational theory of LPn is also decidable. Applying similar strategies, we investigate certain varieties of full weakening relations on a chain and prove the decidability of these varieties. We also present the construction of a potential non-distributive ℓ-pregroup and provide preliminary results towards proving this claim."],"dc:description.provenance":["Received from Author"],"dc:format":["application/pdf"],"dc:format.extent":["155 pgs","1.1 MB"],"dc:identifier":["https://digitalcommons.du.edu/etd/2455"],"dc:language":["English (eng)"],"dc:rights":["<p>Copyright is held by the author. User is responsible for all copyright compliance.</p>"],"dc:rights.holder":["Isis A. Gallardo"],"dc:rights.license":["all_rights_reserved"],"dc:subject":["Decidability","Diagrams","Generation","Involutive","Residuated lattices","Algebra","Applied Mathematics","Mathematics","Number Theory","Physical Sciences and Mathematics"],"dc:title":["Diagrams in Involutive Residuated Lattices"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."]},"updated_at":"2026-11-19T07:55:07Z"}