相关论文: An arguable inconsistency in ZF

Regular expressions are commonly understood in terms of their denotational semantics, that is, through formal languages -- the regular languages. This view is inductive in nature: two primitives are equivalent if they are constructed in the…

We define rigorously operators of the form $f(\partial_t)$, in which $f$ is an analytic function on a simply connected domain. Our formalism is based on the Borel transform on entire functions of exponential type. We study existence and…

We introduce a general theory of functions called Flow. We prove ZF, non-well founded ZF and ZFC can be immersed within Flow as a natural consequence from our framework. The existence of strongly inaccessible cardinals is entailed from our…

Fairly deep results of Zermelo-Frenkel (ZF) set theory have been mechanized using the proof assistant Isabelle. The results concern cardinal arithmetic and the Axiom of Choice (AC). A key result about cardinal multiplication is K*K = K,…

It is known that the numbers which occur in Apery's proof of the irrationality of zeta(2) have many interesting congruence properties while the associated generating function satisfies a second order differential equation. We prove…

CZF is a system of set theory which, over classical logic, is equivalent to ZF, while over intuitionistic logic, it has a well-known constructive type-theoretic interpretation. This article introduces a simpler, intuitive family of…

Using Cauchy's Integral Theorem as a basis, what may be a new series representation for Dirichlet's function $\eta(s)$, and hence Riemann's function $\zeta(s)$, is obtained in terms of the Exponential Integral function $E_{s}(i\kappa)$ of…

We formulate the $P<NP$ hypothesis in the case of the satisfiability problem as a $\Pi ^0_2$ sentence, out of which we can construct a partial recursive function $f_{\neg A}$ so that $f_{\neg A}$ is total if and only if $P < NP$. We then…

Frege's theorem says that second-order Peano arithmetic is interpretable in Hume's Principle and full impredicative comprehension. Hume's Principle is one example of an abstraction principle, while another paradigmatic example is Basic Law…

In Sarnak's paper, it was proved that the Selberg zeta function for SL(2,Z) is expressed in terms of the fundamental units and the class numbers of the primitive indefinite binary quadratic forms. The aim of this paper is to obtain similar…

A formula $\phi$ is called \emph{$n$-provable} in a formal arithmetical theory $S$ if $\phi$ is provable in $S$ together with all true arithmetical $\Pi_{n}$-sentences taken as additional axioms. While in general the set of all $n$-provable…

We give a representation of the classical theory of multiplicative arithmetic functions (MF)in the ring of symmetric polynomials. The basis of the ring of symmetric polynomials that we use is the isobaric basis, a basis especially sensitive…

Harvey Friedman shows that, over Peano Arithmetic, the consistency statement for a finitely axiomatised theory $A$ can be characterised as the weakest statement $C$ over Peano Arithmetic such that ${\sf PA}+C$ interprets $A$. We study which…

We introduce the Primitive Eulerian polynomial $P_{\cal A}(z)$ of a central hyperplane arrangement ${\cal A}$. It is a reparametrization of its cocharacteristic polynomial. Previous work of the first author implicitly show that, for…

We note how several central results in multiplicative number theory may be rephrased naturally in terms of multiplicative functions $f$ that pretend to be another multiplicative function $g$. We formalize a `distance' which gives a measure…

We give an accessible presentation to the foundations of nominal techniques, lying between Zermelo-Fraenkel set theory and Fraenkel-Mostowski set theory, and which has several nice properties including being consistent with the Axiom of…

It is well-known that the first order Peano axioms PA have a continuum of non-isomorphic countable models. The question, how close to being isomorphic such countable models can be, seems to be less investigated. A measure of closeness to…

This paper is concerned with the paraconsistent first-order logic LPQ$^{\supset,\mathsf{F}}$, Priest's LPQ enriched with an implication connective and a falsity constant. A sequent-style natural deduction proof system for this logic is…

Let m>2 be an integer. We show that ZF + "For every integer n, Every countable family of non-empty sets of cardinality at most n has an infinite partial choice function" is not strong enough to prove that every countable set of m-element…

The inverse problem for representation functions takes as input a triple (X,f,L), where X is a countable semigroup, f : X --> N_0 \cup {\infty} a function, L : a_1 x_1 + ... + a_h x_h an X-linear form and asks for a subset A \subseteq X…