Related papers: Completely reducible sets
We establish a natural translation from word rewriting systems to strictly positive polymodal logics. Thereby, the latter can be considered as a generalization of the former. As a corollary we obtain examples of undecidable strictly…
We show that a hypersimple unidimensional theory that has a club of reducts, in the partial order of all countable reducts, that are coordinatized in finite rank, is supersimple.
Monoids generated by elements of order two appear in numerous places in the literature. For example, Coxeter reflection groups in geometry, Kuratowski monoids in topology, various monoids generated by regular operations in language theory…
We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: Some A are R-related to some B; Some A are R-related to all B; All A are R-related to some B; All A are…
The extensions of hypersubstitutions are mappings on the set of all terms. In the present paper we characterize all hypersubstitutions which provide bijections on the set of all terms. The set of all such hypersubstitutions forms a monoid.…
We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. We prove that, under relatively simple hypotheses on a pseudovariety V of semigroups, the finitely generated free algebra for the largest…
We present several enumeration results holding in sets of words called neutral and which satisfy restrictive conditions on the set of possible extensions of nonempty words. These formulae concern return words and bifix codes. They…
The problem of identifying whether the family of cyclic codes is asymptotically good or not is a long-standing open problem in the field of coding theory. It is known in the literature that some families of cyclic codes such as BCH codes…
In this article, we investigate the existence of joins in the weak order of an infinite Coxeter group W. We give a geometric characterization of the existence of a join for a subset X in W in terms of the inversion sets of its elements and…
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down systems, which generalize similar classes on words. Our aim is to…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
Recently several authors have proved results on Ehrhart series of free sums of rational polytopes. In this note we treat these results from an algebraic viewpoint. Instead of attacking combinatorial statements directly, we derive them from…
We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of $\omega$ implies that the modal logic S4.1.2 is complete with respect to the \v{C}ech-Stone compactification of the natural numbers,…
The multiplicative fragment of Linear Logic is the formal system in this family with the best understood proof theory, and the categorical models which best capture this theory are the fully complete ones. We demonstrate how the Hyland-Tan…
Completely reducible subcomplexes of spherical buildings was defined by J.P. Serre and are used in studying subgroups of reductive algebraic groups. We begin the study of completely reducible subcomplexes of twin buildings and how they may…
Lusztig conjectured that the almost characters of a finite reductive group are up to a scalar the same as the characteristic functions of the rational character sheaves defined on the corresponding algebraic group. We propose in this paper…
We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying…
We study the complex irreducible representations of special linear, symplectic, orthogonal and unitary groups over principal ideal local rings of length two. We construct a canonical correspondence between the irreducible representations of…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…