Related papers: Characterizing level one in group-based concatenat…
This paper is a continuation of [GLT], which develops a level theory and establishes strong character bounds for finite simple groups of linear and unitary type in the case that the centralizer of the element has small order compared to…
P-algebras are a non-commutative, non-associative generalization of Boolean algebras that are for quantum logic what Boolean algebras are for classical logic. P-algebras have type <X, 0, ', .> where 0 is a constant, ' is unary and . is…
An automatic word classification system has been designed which processes word unigram and bigram frequency statistics extracted from a corpus of natural language utterances. The system implements a binary top-down form of word clustering…
Scaled Boolean algebras are a category of mathematical objects that arose from attempts to understand why the conventional rules of probability should hold when probabilities are construed, not as frequencies or proportions or the like, but…
We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…
Let A be a finite set with at least two elements. The composition of two classes I and J of operations on A, is defined as the set of all compositions of functions in I with functions in J. This binary operation gives a monoid structure to…
We examine the complexity of basic regular operations on languages represented by Boolean and alternating finite automata. We get tight upper bounds m+n and m+n+1 for union, intersection, and difference, 2^m+n and 2^m+n+1 for concatenation,…
We investigate in a method for proving separation results for abstract classes of languages. A well established method to characterize varieties of regular languages are identities. We use a recently established generalization of these…
We show that the condition of being categorical in a tail of cardinals can be characterized algebraically for several classes of modules. $Theorem.$ Assume $R$ is an associative ring with unity. 1. The class of locally pure-injective…
Most classical results in circuit complexity theory concern circuits over the Boolean domain. Besides their simplicity and the ease of comparing different languages, the actual architecture of computers is also an important motivating…
The Univalent Foundations requires a logic that allows us to define structures on homotopy types, similar to how first-order logic with equality ($\text{FOL}_=$) allows us to define structures on sets. We develop the syntax, semantics and…
We define and study the category $Coh_n(\Pone)$ of normal coherent sheaves on the monoid scheme $\Pone$ (equivalently, the $\mathfrak{M}_0$-scheme $\Pone / \fun$ in the sense of Connes-Consani-Marcolli \cite{CCM}). This category resembles…
We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over alphabets with an involution on them. The natural algebras for such languages are…
Given any topological group $G$, the topological classification of principal $G$-bundles over a finite CW-complex $X$ is long-known to be given by the set of free homotopy classes of maps from $X$ to the corresponding classifying space…
Let G be a totally disconnected, locally compact group. A closed subgroup of G is locally normal if its normaliser is open in G. We begin an investigation of the structure of the family of closed locally normal subgroups of G. Modulo…
The class of Unambiguous Star-Free Regular Languages (UL) was defined by Schutzenberger as the class of languages defined by Unambiguous Polynomials. UL has been variously characterized (over finite words) by logics such as TL[X_a,Y_a],…
First-Order Logic (FOL) is widely regarded as one of the most important foundations for knowledge representation. Nevertheless, in this paper, we argue that FOL has several critical issues for this purpose. Instead, we propose an…
A closure operator on a set $X$ is a function $\operatorname{cl}: \wp(X) \to \wp(X)$ satisfying, for all $A, B \subseteq X$, the following properties: extensivity, $A \subseteq \operatorname{cl}(A)$; monotonicity, which states that if $A…
We study (von Neumann) regular $^*$-subalgebras of $B(H)$, which we call R$^*$-algebras. The class of R$^*$-algebras coincides with that of "E$^*$-algebras that are pre-C$^*$-algebras" in the sense of Z. Sz\H{u}cs and B. Tak\'acs. We give…
We introduce the first order logic of proofs $FOLP^\Box$ in the joint language combining justification terms and binding modalities. The main issue is Kripke--style semantics for this logic. We describe models for $FOLP^\Box$ in terms of…