Related papers: Saturated free algebras revisited
We extend the concept of "almost indiscernible theory" introduced by Pillay and Sklinos in [Bull. Symb. Log., 2015] (which was itself a modernization and expansion of Baldwin and Shelah [Algebra Universalis, 1983]), to uncountable languages…
This paper considers the problem of building saturated models for first-order graded logics. We define types as pairs of sets of formulas in one free variable which express properties that an element is expected, respectively, to satisfy…
Building on work of Maltsev on locally free algebras in finite purely functional languages, we revisit the model theory of (absolutely free) term algebras and their completions. Maltsev's analysis yields a natural axiomatization together…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
We give a new construction of free distributive p-algebras. Our construction relies on a detailed description of completely meet-irreducible congruences, so it is purely universal algebraic. It yields a normal form theorem for p-algebra…
We investigate atomicity of free algebras and various forms of amalgamation for BL and MV algebras, and also Heyting algebras, though the latter algebras may not be linearly ordered, so strictly speaking their corresponding intuitionistic…
Let $R$ be an algebra over a ring $\Bbbk$, $T$ an $R$-algebra, $M$ a finitely generated projective $R$-module, and $N$ a $T$-module. Let $G$ be a linearly reductive group scheme over $\Bbbk$ equipped with a representation…
A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are…
Following ideas of A.C.Cochran, we give a suitable definition of a saturated uniformly A-convex algebra. In the m-convex case, such algebra is a uniform topological one.
The saturation of an algebraic surface is the maximal open embedding with complement of dimension zero. For schemes, it was introduced by the first named author and A. Bondal, who proved that the saturation of a surface X can be recovered…
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…
A free semigroupoid algebra is the closure of the algebra generated by a TCK family of a graph in the weak operator topology. We obtain a structure theory for these algebras analogous to that of free semigroup algebra. We clarify the role…
We give a necessary and sufficient smoothness condition for the scheme parameterizing the n-dimensional representations of a finitely generated associative algebra over an algebraically closed field of characteristic zero. In particular,…
We continue our studies on semilattice ordered algebras. This time we accept constants in the type of algebras. We investigate identities satisfied by such algebras and describe the free objects in varieties of semilattice ordered algebras…
We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…
We put in print a classical result that states that for most purposes, there is no harm in assuming the existence of saturated models in model theory. The presentation is aimed for model theorists with only basic knowledge of axiomatic set…
Several techniques together with some partial answers are given to the questions of factoriality, type classification and fullness for amalgamated free product von Neumann algebras.
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
We show that free objects on sets do not exist in the category $bal$ of bounded archimedean $\ell$-algebras. On the other hand, we introduce the category of weighted sets and prove that free objects on weighted sets do exist in $bal$. We…
We generalize the notion of saturated order to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations…