Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Decidability For Residuated Lattices And Substructural Logics, Gavin St. John
Decidability For Residuated Lattices And Substructural Logics, Gavin St. John
Electronic Theses and Dissertations
We present a number of results related to the decidability and undecidability of various varieties of residuated lattices and their corresponding substructural logics. The context of this analysis is the extension of residuated lattices by various simple equations, dually, the extension of substructural logics by simple structural rules, with the aim of classifying simple equations by the decidability properties shared by their extensions. We also prove a number of relationships among simple extensions by showing the equational theory of their idempotent semiring reducts coincides with simple extensions of idempotent semirings. On the decidability front, we develop both semantical and syntactical …
Dihedral-Like Constructions Of Automorphic Loops, Mouna Ramadan Aboras
Dihedral-Like Constructions Of Automorphic Loops, Mouna Ramadan Aboras
Electronic Theses and Dissertations
In this dissertation we study dihedral-like constructions of automorphic loops. Automorphic loops are loops in which all inner mappings are automorphisms. We start by describing a generalization of the dihedral construction for groups. Namely, if (G , +) is an abelian group, m > 1 and α ∈2 Aut(G ), let Dih(m, G, α) on Zm × G be defined by
(i, u )(j, v ) = (i + j , ((-1)j u + v )αij ).
We prove that the resulting loop is automorphic if and only if m = 2 …
Permutation Patterns, Reduced Decompositions With Few Repetitions And The Bruhat Order, Daniel Alan Daly
Permutation Patterns, Reduced Decompositions With Few Repetitions And The Bruhat Order, Daniel Alan Daly
Electronic Theses and Dissertations
This thesis is concerned with problems involving permutations. The main focus is on connections between permutation patterns and reduced decompositions with few repetitions. Connections between permutation patterns and reduced decompositions were first studied various mathematicians including Stanley, Billey and Tenner. In particular, they studied pattern avoidance conditions on reduced decompositions with no repeated elements. This thesis classifies the pattern avoidance and containment conditions on reduced decompositions with one and two elements repeated. This classification is then used to obtain new enumeration results for pattern classes related to the reduced decompositions and introduces the technique of counting pattern classes via reduced …