Related papers: Preservation theorems for Tarski's relation algebr…
We give an analysis and generalizations of some long-established constructive completeness results in terms of categorical logic and pre-sheaf and sheaf semantics. The purpose is in no small part conceptual and organizational: from a few…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
The purpose of this paper is to answer a question raised by Gennady Lyubeznik and Karen Smith. This question involves the finite generation of the following non-commutative algebra. Let $S$ be any commutative algebra of prime characteristic…
The method proposed by Pratt to derive recursion relations for systems of degenerate fermions [Phys. Rev. Lett. 84, 4255 (2000), arXiv:nucl-th/9905055] relies on diagrammatic techniques. This efficient formalism assumes no explicit two-body…
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic encodings. The complete Prolog code is available at…
We introduce the notion of radical preservation and prove that a radical-preserving homomorphism of left artinian rings of finite projective dimension with superfluous kernel reflects the finiteness of the little finitistic, big finitistic…
We prove that the finite representation property holds for representation by partial functions for the signature consisting of composition, intersection, domain and range and for any expansion of this signature by the antidomain, fixset,…
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…
This article gives a summary of the author's Ph.D. dissertation (arXiv:1609.06297). In addition to an overview of notions and results, it also provides sketches of various proofs and simplified presentations of certain abstract results of…
The Guarded Fragment (GF) is a well-established decidable fragment of first-order logic. We study an extension of GF with nested equivalence relations, namely a family of distinguished binary predicates $E_1, E_2, \dots$ interpreted as…
Theory of relations is the framework of this thesis. It is about enumeration of finite structures. Let $\mathscr C$ be a class of finite combinatorial structures, the \emph{profile} of $\mathscr C$ is the function $\varphi_{\mathscr C}$…
We introduce and study holomorphically finitely generated (HFG) Fr\'echet algebras, which are analytic counterparts of affine (i.e., finitely generated) $\mathbb C$-algebras. Using a theorem of O. Forster, we prove that the category of…
We study a tensor product in the category of effect algebras and in the category of partially ordered Abelian groups with order unit. We show that the tensor product preserves all the constructions that are essentially colimits over a…
Preservation theorems provide a direct correspondence between the syntactic structure of first-order sentences and the closure properties of their respective classes of models. A line of work has explored preservation theorems relativised…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
The relation between representations and positive definite functions is a key concept in harmonic analysis on topological groups. Recently this relation has been studied on topological groupoids. This is the second in a series of papers in…
J{\'o}nsson and Tarski's notion of the perfect extension of a Boolean algebra with operators has evolved into an extensive theory of canonical extensions of lattice-based algebras. After reviewing this evolution we make two contributions.…
The tangled closure of a collection of subsets of a topological space is the largest subset in which each member of the collection is dense. This operation models a logical `tangle modality' connective, of significance in finite model…
We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…