Related papers: How to escape Tennenbaum's theorem
The goal of this paper is twofold. In addition to the results stated in the next paragraph, we present some classical results on absoluteness relevant to functional analysis that are well known to logicians but not nearly as well advertised…
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 show that in Zermelo-Fraenkel Set Theory without the Axiom of Choice a surjectively modified continuum function $\theta(\kappa)$ can take almost arbitrary values for all infinite cardinals. This choiceless version of Easton's Theorem is…
We isolate a model-theoretic "standard-cut" phenomenon for true Pi0_1 sentences: if a model M satisfies ZFC + not-phi, then omega^M is not the standard omega, and any internal "witness" to not-phi is computationally inaccessible by…
The separation between two theorems in reverse mathematics is usually done by constructing a Turing ideal satisfying a theorem P and avoiding the solutions to a fixed instance of a theorem Q. Lerman, Solomon and Towsner introduced a forcing…
We present a unified apoach to the study of separable and Frobenius algebras. The crucial observation is thsat both cases are related to the nonlinear equation $R^{12}R^{23}=R^{23}R^{13}=R^{13}R^{12}$, called the FS-equation. Given a…
We show that Zilber's conjecture that complex exponentiation is isomorphic to his pseudo-exponentiation follows from the a priori simpler conjecture that they are elementarily equivalent. An analysis of the first-order types in…
We give an example of a countable theory T such that for every cardinal lambda >= aleph_2 there is a fully indiscernible set A of power lambda such that the principal types are dense over A, yet there is no atomic model of T over A. In…
A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…
This is an introduction to the set-theoretic method of forcing, including its application in proving the independence of the Continuum Hypothesis from the Zermelo-Fraenkel axioms of set theory. I presuppose no particular mathematical…
We characterize models of Peano arithmetic (PA) with infinitely many infinite primes p such that p + 2 has no finite prime divisor.
In this paper we continue to explore the connection between tensor algebras and displacement structure. We focus on recursive orthonormalization and we develop an analogue of the Szego type theory of orthogonal polynomials in the unit…
Pseudoexponential fields are exponential fields similar to complex exponentiation satisfying the Schanuel Property, which is the abstract statement of Schanuel's Conjecture, and an adapted form of existential closure. Here we show that if…
The celebrated Bell's no-go theorem rules out the hidden-variable theories falling in the hypothesis of locality and causality, by requiring the theory to model the quantum correlation-at-a-distance phenomena. Here I develop an independent…
Computability theory is a discipline in the intersection of computer science and mathematical logic where the fundamental question is: given two mathematical objects X and Y, does X compute Y in principle? In case X and Y are real numbers,…
Hypercomputational formal theories will, clearly, be both structurally and foundationally different from the formal theories underpinning computational theories. However, many of the maps that might guide us into this strange realm have…
Most interesting proofs in mathematics contain an inductive argument which requires an extension of the LK-calculus to formalize. The most commonly used calculi for induction contain a separate rule or axiom which reduces the valid proof…
This paper presents a novel possible worlds semantics, designed to elucidate the underpinnings of ultrafinitism. By constructing a careful modification of the well-known Kripke models for inuitionistic logic, we seek to extend our…
We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…
We overview numerous algorithms in computational $D$-module theory together with the theoretical background as well as the implementation in the computer algebra system \textsc{Singular}. We discuss new approaches to the computation of…