Related papers: Independence in computable algebra
In this paper, we will explicitly construct cofree coalgebras, by first constructing cofree precoalgebras (namely those not necessarily coassociative or counital). Our approach does not impose any condition to the coefficient ring, which…
We propose a definition of computable manifold by introducing computability as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
We study possibilities for algebraic closures, differences between definable and algebraic closures in first-order structures, and variations of these closures with respect to the bounds of cardinalities of definable sets and given sets of…
We study the properties of algebraic independence and pointwise algebraic independence in a class of continuous theories, the randomizations $T^R$ of complete first order theories $T$. If algebraic and definable closure coincide in $T$,…
We investigate the computability-theoretic properties of valued fields, and in particular algebraically closed valued fields and $p$-adically closed valued fields. We give an effectiveness condition, related to Hensel's lemma, on a valued…
This paper introduces abstractions that are meaningful for computers and that can be built and used according to computers' own criteria, i.e., computable abstractions. It is analyzed how abstractions can be seen to serve as the building…
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…
Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a question of Bazhenov, Kalimulin and Yamaleev. Using the same…
Given an algebraic differential equation of order greater than one, it is shown that if there is any nontrivial algebraic relation amongst any number of distinct nonalgebraic solutions, along with their derivatives, then there is already…
We show that if any four distinct solutions of a rational difference equation are algebraically independent, then any number of distinct solutions to the equation are independent. A nontrivial variant of this result is given for autonomous…
We provide an axiomatic framework for working with a wide variety of closure operations on ideals and submodules in commutative algebra, including notions of reduction, independence, spread, and special parts of closures. This framework is…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
Various limit-free formulas are given for the computation of the algebraic and the topological entropy, respectively in the settings of endomorphisms of locally finite discrete groups and of continuous endomorphisms of totally disconnected…
Given a countable structure $\mathcal{A}$, the degree spectrum of $\mathcal{A}$ is the set of all Turing degrees which can compute an isomorphic copy of $\mathcal{A}$. One of the major programs in computable structure theory is to determine…
We present a framework for studying the concept of independence in a general context covering database theory, algebra and model theory as special cases. We show that well-known axioms and rules of independence for making inferences…
For a class of nonassociative metagroup algebras their separability is investigated. For this purpose the cohomology theory on them is utilized. Conditions are found under which nonassociative metagroup algebras are separable. Algebras…
We provide a given algebraic structure with the structure of an infinitesimal algebraic skeleton. The necessary conditions for integrability of the absolute parallelism of a tower with such a skeleton are dispersive nonlinear models and…
We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…