Related papers: Degree Spectra of Real Closed Fields
The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…
Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We solve this question in the negative, already within the class of computably enumerable many-one degrees. Positive answers…
The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…
We study a class of tame $\mathcal{L}$-theories $T$ of topological fields and their $\mathcal{L}_\delta$-extension $T_{\delta}^*$ by a generic derivation $\delta$. The topological fields under consideration include henselian valued fields…
We construct certain $\theta$-series associated to number fields and prove that for number fields of degree less than equal to 4, these $\theta$-series are number field invariants. We also investigate whether or not the collection of…
Non-hermitian quantum graphs possessing real (i.e., in principle, observable) spectra are studied via their discretization. The discretized Hamiltonians are assigned, constructively, an elementary pseudometric and/or a more complicated…
The methods of nonstandard analysis are applied to algebra and number theory. We study nonstandard Dedekind rings, for example an ultraproduct of the ring of integers of a number field. Such rings possess a rich structure and have…
We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…
A Turing degree is d.c.e. if it contains a set that is the difference of two c.e. sets. A d.c.e. degree $\mathbf{d}$ is isolated by a c.e. degree $\mathbf{a}<\mathbf{d}$ if all c.e. degrees that are below $\mathbf{d}$ are also below…
Differential properties of Klein-Gordon and electromagnetic fields on the space-time of a straight cosmic string are studied with the help of methods of the differential space theory. It is shown that these fields are smooth in the interior…
Let $T$ be a totally ordered set and let $D(T)$ denote the set of all cuts of $T$. We prove the existence of a discrete valuation domain $O_{v}$ such that $T$ is order isomorphic to two special subsets of Spec$(O_{v})$. We prove that if $A$…
The number of topologically different plane real algebraic curves of a given degree $d$ has the form $\exp(C d^2 + o(d^2))$. We determine the best available upper bound for the constant $C$. This bound follows from Arnold inequalities on…
We build a new spectrum of recursive models (SRM(T)) of a strongly minimal theory. This theory is non-disintegrated, flat, model complete, and in a language with a finite signature.
We prove that, for any $n\geq 0$, there exists an uncountable, $n$-dimensional, excellent, regular local ring with countable spectrum.
Consider the semialgebraic structure over the real field. More generally, let an ominimal structure be over a real closed field. We show that a definable metric space X with a definable metric d is embedded into a Euclidean space so that…
We compute the spectrum of anomalous dimensions of non-derivative composite operators with an arbitrary number of fields $n$ in the $O(N)$ vector model with cubic anisotropy at the one-loop order in the $\epsilon$-expansion. The complete…
Classical circuit complexity characterizes parallel computation in purely combinatorial terms, ignoring the physical constraints that govern real hardware. The standard classes $\mathbf{NC}$, $\mathbf{AC}$, and $\mathbf{TC}$ treat unlimited…
In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…
We give a full classification, up to equivalence, of finite-dimensional graded division algebras over the field of real numbers. The grading group is any abelian group.