Related papers: Uniform Preorders and Partial Combinatory Algebras
Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…
It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…
Starting from a biased definition of a properad, we describe explicitly algebras over the cobar construction of a properad. Equivalent description in terms of solutions of generalized master equations, which can be interpreted as…
An \textit{ideal} of $N$-tuples of operators is a class invariant with respect to unitary equivalence which contains direct sums of arbitrary collections of its members as well as their (reduced) parts. New decomposition theorems (with…
Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…
We furnish any category of a universal (co)homology theory. Universal (co)homologies and universal relative (co)homologies are obtained by showing representability of certain functors and take values in $R$-linear abelian categories of…
We investigate the representation and complete representation classes for algebras of partial functions with the signature of relative complement and domain restriction. We provide and prove the correctness of a finite equational…
Motivated by the theory of unitary representations of finite dimensional Lie supergroups, we describe those Lie superalgebras which have a faithful finite dimensional unitary representation. We call these Lie superalgebras unitary. This is…
We give simple characterizations of the category PAsm(A) of partitioned assemblies, and of the realizability topos RT(A) over a partial combinatory algebra A. This answers the question for an 'extensional characterization' of realizability…
We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…
We give an order-theoretic characterization of the essential image of the forgetful functor from the category of real/complex unital C*-algebras to the category of real/complex unital operator systems. It is based on the characterization of…
A new class of partial order-types, class $\gbqo^+$ is defined and investigated here. A poset $P$ is in the class $W^+ $ iff the free poset algebra $F(P)$ is generated by a better quasi-order $G$ that is included in the free lattice $L(P)$.…
The notion of associativity (which differs from the straightforward generalization of the usual associativity given by the move of parentheses in the relevant expression) for operations of high arity is introduced. It is proved that the…
Let $(\mathcal{G},\nu)$ be a $t$-discrete ergodic groupoid. Consider a finite Von Neumann algebra $\mathcal{M}$ with separable predual. We prove that every uniformly bounded measurable representation $\rho:\mathcal{G} \rightarrow…
Regular and higher regular graded algebras (in simplest case satisfying Von Neumann regularity $\Theta_{1}\Theta_{2}\Theta_{1}=\Theta_{1}$ instead of anticommutativity) are introduced and their properties are studied. They are described in…
This paper examines the characterization and learning of grammars defined with enriched representational models. Model-theoretic approaches to formal language theory traditionally assume that each position in a string belongs to exactly one…
Let k be a field of characteristic zero. We consider graded subalgebras A of k[x_1,...,x_m]/(x_1^2,...,x_m^2) generated by d linearly independant linear forms. Representations of matroids over k provide a natural description of the…
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…
The purpose of these notes is to collect in one place some facts on the category of finite totally ordered sets and some related categories. More specifically, we collect some results on them which will be useful for the study of iteratedly…
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…