相关论文: Avoiding logical strength in real analysis
Reverse Mathematics (RM hereafter) is a program in the foundations of mathematics where the aim is to identify the minimal axioms needed to prove a given theorem from ordinary, i.e. non-set theoretic, mathematics. This program has unveiled…
Going back to Kreisel in the Sixties, hyperarithmetical analysis is a cluster of logical systems just beyond arithmetical comprehension. Only recently natural examples of theorems from the mathematical mainstream were identified that fit…
19th century real analysis received a major impetus from Cauchy's work. Cauchy mentions variable quantities, limits, and infinitesimals, but the meaning he attached to these terms is not identical to their modern meaning. Some Cauchy…
Quantum mechanical weak values of projection operators have been used to answer which-way questions, e.g. to trace which arms in a multiple Mach-Zehnder setup a particle may have traversed from a given initial to a prescribed final state. I…
An alternative mathematics based on qualitative plurality of finiteness is developed to make non-standard mathematics independent of infinite set theory. The vague concept "accessibility" is used coherently within finite set theory whose…
In classical analysis, the convergence behavior of power series solutions to differential or recurrence equations is generally assumed to be invariant under internal rearrangement. This paper challenges that belief by proving that, for…
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
A short and elementary proof of the joint convexity of relative entropy is presented, using nothing beyond linear algebra. The key ingredients are an easily verified integral representation and the strategy used to prove the Cauchy-Schwarz…
This paper uses the framework of reverse mathematics to investigate the strength of two recurrence theorems of topological dynamics. It establishes that one of these theorems, the existence of an almost periodic point, lies strictly between…
We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…
The tree forcing method given by (Liu 2015) enables the cone avoiding of strong enumeration of a given tree, within a subset or co-subset of an arbitrary given set, provided the given tree does not admit computable strong enumeration. Using…
In this paper, methods of second order and higher order reverse mathematics are applied to versions of a theorem of Banach that extends the Schroeder-Bernstein theorem. Some additional results address statements in higher order arithmetic…
Computability logic (CoL) provides a semantic foundation in which formulas represent interactive computational problems and validity corresponds to uniform algorithmic solvability. Building on this foundation, clarithmetics -- CoL-based…
Our main result is a succinct counterpoint to Courcelle's meta-theorem as follows: every cw-nontrivial monadic second-order (MSO) property is either NP-hard or coNP-hard over graphs given by succinct representations. Succint representations…
Reverse Mathematics (RM for short) is a program in the foundations of mathematics where the aim is to find the minimal axioms needed to prove a given theorem of ordinary mathematics. Generally, the minimal axioms are equivalent to the…
Structural recursion is a common technique used by programmers in modern languages and is taught to introductory computer science students. But what about its dual, structural corecursion? Structural corecursion is an elegant technique,…
A constructive proof of the Goedel-Rosser incompleteness theorem has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized. A development of primitive recursive…
Reverse Mathematics is a program in the foundations of mathematics. It provides an elegant classification in which the majority of theorems of ordinary mathematics fall into only five categories, based on the 'Big Five' logical systems.…
We use reverse mathematics to analyze "iterated jump" versions of the following four principles: the atomic model theorem with subenumerable types (AST), the diagonally noncomputable principle (DNR), weak weak K\H{o}nig's lemma (WWKL), and…
In connection with Eisenstein series for the principal congruence subgroup $\Gamma(n)$, Hecke introduced certain numbers, of which he said that they are rational and cumbersome to calculate. We show, however, that these numbers are…