Related papers: Mutually algebraic structures and expansions by pr…
We show that if a countable structure $M$ in a finite relational language is not cellular, then there is an age-preserving $N \supseteq M$ such that $2^{\aleph_0}$ many structures are bi-embeddable with $N$. The proof proceeds by a case…
Drawing on the classic paper by Chellas "Basic conditional logic" (1975), we propose a general algebraic framework for studying a binary operation of conditional that models universal features of the "if..., then..." connective as strictly…
Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…
We present a generalization of the notion of an algebra norm relevant to real finite-dimensional unital associative algebras. Among other things, this leads to a novel set of algebra isomorphism invariants, some of which are computationally…
Let $A = \{0 = a_0 < a_1 < \cdots < a_{\ell + 1} = b\}$ be a finite set of non-negative integers. We prove that the sumset $NA$ has a certain easily-described structure, provided that $N \geqslant b-\ell$, as recently conjectured by Shakan…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We employ the theory of canonical extensions to study residuation algebras whose associated relational structures are functional, i.e., for which the ternary relations associated to the expanded operations admit an interpretation as…
We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…
If $A$ is an algebra and \bgt is a tolerance on $A$, then $A/\bgt$ is a multi-algebra in a natural way. We give an example to show that not every multi-algebra arises in this manner. We slightly generalize the construction of $A/\bgt$ and…
We investigate from an algebraic and topological point of view the minimal prime spectrum of a universal algebra, considering the prime congruences w.r.t. the term condition commutator. Then we use the topological structure of the minimal…
We compare a number of different definitions of structure algebras and TKK constructions for Jordan (super)algebras appearing in the literature. We demonstrate that, for unital superalgebras, all the definitions of the structure algebra and…
We introduce the notion of implicative algebra, a simple algebraic structure intended to factorize the model constructions underlying forcing and realizability (both in intuitionistic and classical logic). The salient feature of this…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
We prove group existence and structure theorems in a general setting of tame topological theories. More precisely, we identify a linear/non-linear dividing line -- called topological 1-basedness -- among the class of t-minimal theories with…
We compare two known methods of extending a complex, unital, commutative normed algebra so as to include solutions to sets of monic polynomials over the original algebra. (One of these is a generalisation of a construction from the thesis…
Let T be an algebraically bounded theory. We consider the $L(\bar\delta)$-expansions of T by a tuple $\bar \delta$ of derivations (which may be commuting or not). We investigate the model completion of either of the above theories, whose…
We study sets and groups definable in tame expansions of o-minimal structures. Let $\mathcal {\widetilde M}= \langle \mathcal M, P\rangle$ be an expansion of an o-minimal $\mathcal L$-structure $\cal M$ by a dense set $P$, such that three…
The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…
The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…
We adapt the classical notion of learning from text to computable structure theory. Our main result is a model-theoretic characterization of the learnability from text for classes of structures. We show that a family of structures is…