相关论文: The Theory of Ceers Computes True Arithmetic
In a recently launched research program for developing logic as a formal theory of (interactive) computability, several very interesting logics have been introduced and axiomatized. These fragments of the larger Computability Logic aim not…
We introduce the notion of sofic measurable equivalence relations. Using them we prove that Connes' Embedding Conjecture as well as the Measurable Determinant Conjecture of L\"uck, Sauer and Wegner hold for treeable equivalence relations.
A measurable relation algebra is a relation algebra in which the identity element is a sum of atoms that can be measured in the sense that the "size" of each such atom can be defined in an intuitive and reasonable way (within the framework…
Cohesive powers of computable structures can be viewed as effective ultraproducts over effectively indecomposable sets called cohesive sets. We investigate the isomorphism types of cohesive powers $\Pi _{C}% \mathcal{L}$ for familiar…
In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…
This paper concerns algorithms that give correct answers with (asymptotic) density $1$. A dense description of a function $g : \omega \to \omega$ is a partial function $f$ on $\omega$ such that $\left\{n : f(n) = g(n)\right\}$ has density…
In this paper we introduce the notion of linear computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.
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…
Definable topological groups whose topologies are affine have definable $\mathcal C^r$ structures in d-minimal expansions of ordered fields, where $r$ is a positive integer. We prove this fact using a new notion called partition degree of a…
We provide requirements on effectively enumerable topological spaces which guarantee that the Rice-Shapiro theorem holds for the computable elements of these spaces. We show that the relaxation of these requirements leads to the classes of…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
In this expository article, the real numbers are defined as infinite decimals. After defining an ordering relation and the arithmetic operations, it is shown that the set of real numbers is a complete ordered field. It is further shown that…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
We investigate what collections of c.e.\ Turing degrees can be realised as the collection of elements of a separating $\Pi^0_1$ class of c.e.\ degree. We show that for every c.e.\ degree $\mathbf{c}$, the collection $\{\mathbf{c},…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…
The Rogers semilattice of effective programming systems (epses) is the collection of all effective numberings of the partial computable functions ordered such that \theta\ is less than or equal to \psi\ whenever \theta-programs can be…
It is proved that the first-order theory of the structure (N,mod) is undecidable. Here mod denotes the operation of computing the remainder for any division between positive integers; i.e. x mod y is the remainder obtained by the division x…