Related papers: Independence in computable algebra

In two-dimensional conformal field theory, we analyze conformally invariant boundary conditions which break part of the bulk symmetries. When the subalgebra that is preserved by the boundary conditions is the fixed algebra under the action…

Ideals in the ring of power series in three variables can be classified based on algebra structures on their minimal free resolutions. The classification is incomplete in the sense that it remains open which algebra structures actually…

We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…

Goal of this review is to introduce the algebraic approach to quantum field theory on curved backgrounds. Based on a set of axioms, first written down by Haag and Kastler, this method consists of a two-step procedure. In the first one, a…

We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…

We define a notion of an arithmetic set in an arbitrary countable group and study properties of these sets in the cases of Abelian groups and non-abelian free groups.

Building on the work of K. Chiba (J. Algebra 263 (2003), 75-87), we present sufficient conditions for the completion of a division ring with respect to the metric defined by a discrete valuation function to contain a free field, i.e. the…

We prove a number of elementary facts about computability in partial combinatory algebras (pca's). We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca's. We then discuss separability and…

While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…

We extend fundamental results of small cancellation theory to groups whose presentations satisfy the generalizations of the classical C(6) and C(7) conditions in graphical small cancellation theory. Using these graphical small cancellation…

We present a new manifestation of G\"odel's second incompleteness theorem and discuss its foundational significance, in particular with respect to Hilbert's program. Specifically, we consider a proper extension of Peano arithmetic…

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

Extensive work has been done to determine necessary and sufficient conditions for a bijective correspondence of abelian extensions of number fields to force an isomorphism of the base fields. However, explicit examples of correspondences…

We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…

We expose (without proofs) a unified computational approach to integrable structures (including recursion, Hamiltonian, and symplectic operators) based on geometrical theory of partial differential equations. We adopt a coordinate based…

Bayesian networks, and especially their structures, are powerful tools for representing conditional independencies and dependencies between random variables. In applications where related variables form a priori known groups, chosen to…

We seek to create tools for a model-theoretic analysis of types in algebraically closed valued fields (ACVF). We give evidence to show that a notion of 'domination by stable part' plays a key role. In Part A, we develop a general theory of…

Several researchers have recently established that for every Turing degree $\boldsymbol{c}$, the real closed field of all $\boldsymbol{c}$-computable real numbers has spectrum $\{\boldsymbol{d}~:~\boldsymbol{d}'\geq\boldsymbol{c}"\}$. We…

We consider infinite parametric families of high degree number fields composed of quadratic fields with pure cubic, pure quartic, pure sextic fields and with the so called simplest cubic, simplest quartic fields. We explicitly describe an…

A set of multivariate polynomials, over a field of zero or large characteristic, can be tested for algebraic independence by the well-known Jacobian criterion. For fields of other characteristic p>0, there is no analogous characterization…