Related papers: Interpretations of Presburger Arithmetic in Itself
We give a complete first-order axiomatization of the structure $(\mathbb{Z},+,(\ell^{\mathbb{N}})_{\ell\in L})$, where $L \subseteq \mathbb{Z}_{\ge 2}$ is a set of pairwise multiplicatively independent integers and $\ell^{\mathbb{N}} =…
In this article, we investigate the arithmetical hierarchy from the perspective of realizability theory. An experimental observation in classical computability theory is that the notion of degrees of unsolvability for natural arithmetical…
We observe that there exists an associative finite dimensional $\mathbb{C}$-algebra $A$ of finite global dimension, such that the bounded derived category $D^b(A)$ of finite dimensional $A$-modules admits an admissible subcategory…
Let $(\mathfrak{g},\omega)$ be a finite-dimensional non-Lie complex $\omega$-Lie algebra. We study the derivation algebra $Der(\mathfrak{g})$ and the automorphism group $Aut(\mathfrak{g})$ of $(\mathfrak{g},\omega)$. We introduce the…
This paper aims to provide an analysis of what it means when we say that a pair of theories, very generously construed, are equivalent in the sense that they are interdefinable. With regard to theories articulated in first order logic, we…
Using representation theory techniques we prove that various spaces of derivations or one-sided multipliers over certain operator algebras are reflexive. A sample result: any bounded local derivation (local left multiplier) on an…
SU(1,1) is considered as the automorphism group of the Heisenberg algebra H. The basis in the Hilbert space K of functions on H on which the irreducible representations of the group are realized is explicitly constructed. The addition…
The category of admissible (in the appropriately modified sense of representation theory of totally disconnected groups) semi-linear representations of the automorphism group of an algebraically closed extension of infinite transcendence…
Algebras of relations form an algebraic framework for the study of logical systems, extending the correspondence between Boolean algebras and propositional logic. Tarski's representable cylindric algebras $RCA_{\alpha}$, and Halmos'…
A universality of deformed Heisenberg algebra involving the reflection operator is revealed. It is shown that in addition to the well-known infinite-dimensional representations related to parabosons, the algebra has also finite-dimensional…
This paper is devoted to understand groups definable in Presburger arithmetic. We prove the following theorems: Theorem 1. Every group definable in a model of Presburger Arithmetic is abelian-by-finite. Theorem 2. Every bounded group…
The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings,…
Let $\mathfrak{g}$ be a finite dimensional complex Lie algebra and let $A$ be a finite dimensional complex, associative and commutative algebra with unit. We describe the structure of the derivation Lie algebra of the current Lie algebra…
We give a criterion when an expansion of the ordered set of real numbers defines the image of the expansion of the real field by the set of natural numbers under a semialgebraic injection. In particular, we show that for a non-quadratic…
We can look at a first-order (or propositional) intuitionistic Kripke model as an ordered set of classical models. In this paper, we show that for a finite-depth Kripke model in an arbitrary first-order language or propositional language,…
We show that if a first-order structure $\mathcal{M}$, with universe $\mathbb{Z}$, is an expansion of $(\mathbb{Z},+,0)$ and a reduct of $(\mathbb{Z},+,<,0)$, then $\mathcal{M}$ must be interdefinable with $(\mathbb{Z},+,0)$ or…
We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…
We study the computational complexity of short sentences in Presburger arithmetic (Short-PA). Here by "short" we mean sentences with a bounded number of variables, quantifiers, inequalities and Boolean operations; the input consists only of…
Let $A$ be an alphabet and $SP^\diamond(A)$ denote the class of all countable N-free partially ordered sets labeled by $A$, in which chains are scattered linear orderings and antichains are finite. We characterize the rational languages of…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…