Related papers: Infinite saturated orders
We explore the possibility of extending Mardare et al. quantitative algebras to the structures which naturally emerge from Combinatory Logic and the lambda-calculus. First of all, we show that the framework is indeed applicable to those…
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…
We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…
In this paper we determine the representation type of some algebras of infinite matrices continuously controlled at infinity by a compact metrizable space. We explicitly classify their finitely presented modules in the finite and tame…
For commutative rings, we introduce the notion of a {\em universal grading}, which can be viewed as the "largest possible grading". While not every commutative ring (or order) has a universal grading, we prove that every {\em reduced order}…
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
We consider two-variable first-order logic FO2 over infinite words. Restricting the number of nested negations defines an infinite hierarchy; its levels are often called the half-levels of the FO2 quantifier alternation hierarchy. For every…
This paper continues to study the connection between reverse mathematics and Weihrauch reducibility. In particular, we study the problems formed from Maltsev's theorem on the order types of countable ordered groups. Solomon showed that the…
We say a completely positive contractive map between two C*-algebras has order zero, if it sends orthogonal elements to orthogonal elements. We prove a structure theorem for such maps. As a consequence, order zero maps are in one-to-one…
Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…
A variety is a category of ordered (finitary) algebras presented by inequations between terms. We characterize categories enriched over the category of posets which are equivalent to a variety. This is quite analogous to Lawvere's classical…
The present study introduces the notions of statistical convergence of order $\alpha$ and strong $p-$ Ces\`{a}ro summability of order $\alpha$ in partial metric spaces. Also, we examine the inclusion relations between these concepts. In…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
Suppose we are given a computably enumerable object arise from algorithmic randomness or computable analysis. We are interested in the strength of oracles which can compute an object that approximates this c.e. object. It turns out that,…
In this work, we give rigorous operational meaning to superposition of causal orders. This fits within a recent effort to understand how the standard operational perspective on quantum theory could be extended to include indefinite…
For a set of nonnegative integers $A$, denote by $R_{A}(n)$ the number of unordered representations of the integer $n$ as the sum of two different terms from $A$. In this paper we partially describe the structure of the sets, which have…
We present in this paper a new procedure to saturate a set of clauses with respect to a well-founded ordering on ground atoms such that A < B implies Var(A) {\subseteq} Var(B) for every atoms A and B. This condition is satisfied by any atom…
We give a valuation theoretic characterization for a real closed field to be recursively saturated. Our result extends the characterization of Harnik and Ressayre \cite{hr} for a divisible ordered abelian group to be recursively saturated.
This paper examines the completion of an w-ordered sequence of recursive definitions which on the one hand defines an increasing sequence of nested set and on the other redefines successively a numeric variable as the cardinal of the…
We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of automorphisms of scattered word automatic linear orders are undecidable. For the existence of automatic automorphisms of word automatic…