相关论文: An arguable inconsistency in ZF

In this paper the claim that Zeno's paradoxes have been solved is contested. Although no one has ever touched Zeno without refuting him (Whitehead), it will be our aim to show that, whatever it was that was refuted, it was certainly not…

We prove that the propositional logic of intuitionistic set theory IZF is intuitionistic propositional logic IPC. More generally, we show that IZF has the de Jongh property with respect to every intermediate logic that is complete with…

In this article, we study the multiple zeta functions (MZF) and some of its variants at identical arguments. Using the harmonic product, these functions can be expressed as polynomials in the Riemann zeta function. Firstly, we note that an…

Erd\H{o}s proved that $\mathcal{F}(A) := \sum_{a \in A}\frac{1}{a\log a}$ converges for any primitive set of integers $A$ and later conjectured this sum is maximized when $A$ is the set of primes. Banks and Martin further conjectured that…

We study reflection principles of Peano Arithmetic PA which are based on both proof and provability. Any such reflection principle in PA is equivalent to either $\Box P\!\rightarrow\! P$ ($\Box P$ stands for `$P$ is provable') or $\Box^k…

Tennenbaum's theorem states that the only countable model of Peano arithmetic (PA) with computable arithmetical operations is the standard model of natural numbers. In this paper, we use constructive type theory as a framework to revisit,…

The back-and-forth relations $M\leq_\alpha N$ are central to computable structure theory and countable model theory. It is well-known that the relation $\{(M,N) : M \leq_\alpha N\}$ is (lightface) $\Pi^0_{2\alpha}$. We show that this is…

Dana Scott had shown that removing Extensionality from ZF set theory formalized in the customary manner would weaken it down to Zermelo set theory. The following proof is my personal attempt to solve the question of whether we can have a…

The present article introduces ptarithmetic (short for "polynomial time arithmetic") -- a formal number theory similar to the well known Peano arithmetic, but based on the recently born computability logic (see…

The \emph{Entscheidungsproblem}, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order \emph{theories}, i.e.,…

It is well known that ZFC, despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the…

We consider k-step recurrences of the form $z_{n+k} = A(z)/B(z)$, where A and B are linear functions of $z_n, z_{n+1}, ..., z_{n+k-1}$, which we call k-step linear fractional recurrences. The first Theorem in this paper shows that for each…

Mathematicians still use Naive Set Theory when generating sets without danger of producing any contradiction. Therefore their working method can be considered as a consistent inference system with an experience of over 100 years. My…

Linear arithmetics are extensions of Presburger arithmetic (Pr) by one or more unary functions, each intended as multiplication by a fixed element (scalar), and containing the full induction schemes for their respective languages. In this…

Using elementary methods we find surprising connections between the values of the Riemann Zeta Function over integers and the fractional parts of rational powers, and a connection between the Riemann Zeta Function and the Prime Zeta…

We determine the special values at positive integers of the spectral zeta function associated with the combinatorial Laplacian on the regular tree. These values admit explicit formulas in terms of certain polynomials, which we show to be…

This article describes a sequence of rational functions which converges locally uniformly to the zeta function. The numerators (and denominators) of these rational functions can be expressed as characteristic polynomials of matrices that…

We study the regular representation $\rho_\zeta$ of the single-fermion algebra ${\cal A}_\zeta$, i.e., $c^2=c^{+2}=0$, $cc^++c^+c=\zeta~1$, for $\zeta\in [0,1]$. We show that $\rho_0$ is a four-dimensional nonunitary representation of…

We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…

One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation…