相关论文: A complete rewrite system and normal forms for (S)…
Cross-connection theory propounded by K. S. S. Nambooripad describes the ideal structure of a regular semigroup using the categories of principal left (right) ideals. A variant $\mathscr{T}_X^\theta$ of the full transformation semigroup…
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and…
A theory is developed which uses "networks" (directed acyclic graphs with some extra structure) as a formalism for expressions in multilinear algebra. It is shown that this formalism is valid for arbitrary PROPs (short for 'PROducts and…
This survey article has two components. The first part gives a gentle introduction to Serre's notion of $G$-complete reducibility, where $G$ is a connected reductive algebraic group defined over an algebraically closed field. The second…
This paper presents general syntactic conditions ensuring the strong normalization and the logical consistency of the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined…
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…
Let $H$ be a commutative semigroup with unit element such that every non-unit can be written as a finite product of irreducible elements (atoms). For every $k \in \mathbb N$, let $\mathscr U_k (H)$ denote the set of all $\ell \in \mathbb N$…
The variant of a semigroup S with respect to an element a in S, denoted S^a, is the semigroup with underlying set S and operation * defined by x*y=xay for x,y in S. In this article, we study variants T_X^a of the full transformation…
We introduce the quasi-ordinarization transform of a numerical semigroup. This transform will allow to organize all the semigroups of a given genus in a forest rooted at all quasi-ordinary semigroups with the given genus. This construction…
For any group $G$ with subgroup $H$ and a set of representatives $T$ from the set of cosets $G/H$, we develop a rewriting system from $G$ that bequeaths a product into the set decomposition $T\times H$ of $G$, converting it into a group. In…
This paper contains a complete proof of a fundamental theorem on the normalizers of unipotent subgroups in semisimple algebraic groups.
The set of all subsets of any inverse semigroup forms an involution semiring under set-theoretical union and element-wise multiplication and inversion. We find structural conditions on a finite inverse semigroup guaranteeing that neither…
Given an action of a monoid $T$ on a ring $A$ by ring endomorphisms, and an Ore subset $S$ of $T$, a general construction of a fractional skew monoid ring $S^{\rm op} * A * T$ is given, extending the usual constructions of skew group rings…
In this paper, we define a new structure analogous to group, called partial group. This structure concerns the partial stability by the composition inner law. We generalize the three isomorphism theorems for groups to partial groups.
A semiring can be ``completed'' (i.e., embedded into a semiring in which all infinite sums are defined and satisfy some reasonable properties) iff this semiring can be naturally partially ordered. This construction is ``natural'' (a left…
Let $[n]=\{1,2,\ldots,n\}$ be a finite chain and let $\mathcal{CT}_{n}$ be the semigroup of full contractions on $[n]$. Denote $\mathcal{ORCT}_{n}$ and $\mathcal{OCT}_{n}$ to be the subsemigroup of order preserving or reversing and the…
In this article, we define general normal forms for any logic that has propositional part and whose non-propositional connectives distribute over the finite disjunctions. We do not require the non-propositional connectives to be closed on…
We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…
We propose a modal logic tailored to describe graph transformations and discuss some of its properties. We focus on a particular class of graphs called termgraphs. They are first-order terms augmented with sharing and cycles. Termgraphs…
We describe a class (called regular) of invariant generalized complex structures on a real semisimple Lie group G. The problem reduces to the description of admissible pairs (\gk, \omega), where \gk is an appropriate regular subalgebra of…