Related papers: An Initial Algebra Theorem Without Iteration

We prove the following propositions. Theorem 1: Let $M$ be a subfield of a fixed algebraic closure $\tilde \Q$ of $\Q$ whose existential elementary theory is decidable (resp. primitively decidable). Then, M is conjugate to a recursive…

We identify the free half shuffle algebra of Sch\"utzenberger (1958) with an algebra of real-valued functionals on paths, where the half shuffle emulates integration of a functional against another. We then provide two, to our knowledge,…

Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categories of suitably indexed families, the correctness of the…

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

We establish a fixed-point theorem for the face maps that consist in deleting the $i$th entry of an ordered set. Furthermore, we show that there exists random finite sets of integers that are almost invariant under such deletions.…

It is shown that the *-algebra of all (closed densely defined linear) operators affiliated with a finite type I von Neumann algebra admits a unique center-valued trace, which turns out to be, in a sense, normal. It is also demonstrated that…

Bartholdi and Smoktunowicz constructed finitely generated monomial algebras with prescribed sufficiently fast growth types. We show that their construction need not result in a prime algebra, but it can be modified to provide prime algebras…

Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanised reasoning with useful principles such as structural…

This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…

Let $V=\oC^n$ and let $T:=T(V)\otimes T(V^*)$ be the mixed tensor algebra over $V$. We characterize those subsets $A$ of $T$ for which there is a subgroup $G$ of the unitary group $\UU(n)$ such that $A=T^G$. They are precisely the…

We establish a second main theorem for algebraic tori with slow growth moving targets with truncation to level 1. As the first application of this result, we prove the Green-Griffith-Lang conjecture for projective spaces with $n+1$…

We supply the first proof of Krein's Trace Theorem which does not use complex analysis. Our proof holds for~$\sigma$-finite von Neumann algebras $\mathcal{M}$ of type II and unbounded perturbations from the predual of~$\mathcal{M}$.

We prove several de Finetti theorems for the unitary dual group, also called the Brown algebra. Firstly, we provide a finite de Finetti theorem characterizing $R$-diagonal elements with an identical distribution. This is surprising, since…

We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the…

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

The well-known Formanek's module finiteness theorem states that every unital prime PI-algebra (i.e. a central order in a matrix algebra by Posner's theorem) embeds into a finitely generated module over its center. An analogue of this…

First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…

This survey is meant to provide an introduction to the fundamental theorem of linear algebra and the theories behind them. Our goal is to give a rigorous introduction to the readers with prior exposure to linear algebra. Specifically, we…

We prove a theorem about the derivation algebra of the tensor product of two algebras. As an application, we determine the derivation algebra of the fixed point algebra of the tensor product of two algebras, with respect to the tensor…