Related papers: Uncountable Real Closed Fields with PA Integer Par…

We discuss the complexity of completions of partial combinatory algebras, in particular of Kleene's first model. Various completions of this model exist in the literature, but all of them have high complexity. We show that although there do…

An infinite game on the set of real numbers appeared in Matthew Baker's work [Math. Mag. 80 (2007), no. 5, pp. 377--380] in which he asks whether it can help characterize countable subsets of the reals. This question is in a similar spirit…

We examine categoricity issues for computable algebraic fields. We give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is computably categorical, but not relatively…

We numerically compute the entanglement entropy and negativity for scalar fields and abelian gauge fields in a variety of situations. These extend computations of Srednicki to situations involving curved space. We discretize space in a…

We investigate number-theoretic properties of the collection of nilpotent injectors or nilpotent projectors containing certain subgroups of finite soluble (or ${\mathcal N}$-constrained) groups.

The main results of this paper are the construction, both rigourous and intuitive, of "the" intrinsic extension of the set of non negative integers N and the smallest over-field of R set which is continue (according to R.Dedekind). The aim…

We describe how the D-brane spectra of the various ten-dimensional string theories can be related to general properties of the open-closed duality, encoded in the $S$ and $P$ matrices of the conformal field theory. We also complete the…

We introduce enumerative invariants of real del Pezzo surfaces that count real rational curves belonging to a given divisor class, passing through a generic conjugation-invariant configuration of points and satisfying preassigned tangency…

We determine the complexity of counting models of bounded size of specifications expressed in Linear-time Temporal Logic. Counting word models is #P-complete, if the bound is given in unary, and as hard as counting accepting runs of…

In a recent paper (Cucker, Krick, Malajovich and Wschebor, A Numerical Algorithm for Zero Counting. I: Complexity and accuracy, J. Compl.,24:582-605, 2008) we analyzed a numerical algorithm for computing the number of real zeros of a…

Quasi-invariant and pseudo-differentiable measures on a Banach space $X$ over a non-Archimedean locally compact infinite field with a non-trivial valuation are defined and constructed. Measures are considered with values in non-Archimedean…

The degree spectrum of a countable structure is the set of all Turing degrees of presentations of that structure. We show that every nonlow Turing degree lies in the spectrum of some differentially closed field (of characteristic 0, with a…

In this paper, we study the existence of infinite dimensional closed linear subspaces of a rearrangement invariant space on [0,1] every nonzero element of which does not belong to any included rearrangement invariant space of the same class…

In this paper, we show that VC-minimal ordered fields are real closed. We introduce a notion, strictly between convexly orderable and dp-minimal, that we call dp-small, and show that this is enough to characterize many algebraic theories.…

We show that the Calkin algebra is not countably homogeneous, in the sense of continuous model theory. We furthermore show that the connected component of the unitary group of the Calkin algebra is not countably homogeneous.

We show that, unlike del Pezzo surfaces, higher dimensional Fano manifolds do not satisfy in general boundedness properties for their ${\rm CH}_0$ group of $0$-cycles. For example, for quartic threefolds having a point of odd degree, there…

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

The $P$ versus $NP$ problem is still unsolved. But there are several oracles with $P$ unequal $NP$ relative to them. Here we will prove, that $P\not=NP$ relative to a $P$-complete oracle. In this paper, we use padding arguments as the proof…

We show that there exists a separable, nuclear C*-algebra with real rank zero and trivial K-theory such that its multiplier and corona algebra have real rank one. This disproves two conjectures of Brown and Pedersen. We also compute the…

Let $\alpha,\beta$ be real numbers such that $\alpha>1$ is irrational and of finite type, and let $c$ be a real number in the range $1<c<\frac{14}{13}$. In this paper, it is shown that there are infinitely many Piatetski-Shapiro primes $p =…