Related papers: A well-motivated proof that pi is irrational
In this paper we explore the following question: how weak can a logic be for Rosser's essential undecidability result to be provable for a weak arithmetical theory? It is well known that Robinson's Q is essentially undecidable in…
We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially…
This paper discusses the semantics and proof theory of Nilsson's probabilistic logic, outlining both the benefits of its well-defined model theory and the drawbacks of its proof theory. Within Nilsson's semantic framework, we derive a set…
"[M]athematicians care no more for logic than logicians for mathematics." Augustus de Morgan, 1868. Proofs are traditionally syntactic, inductively generated objects. This paper presents an abstract mathematical formulation of propositional…
In this study, we give an alternative and elementary proof to Tsuji's criterion for a Cartier divisor to be numerically trivial.
By defining $$I_n:=\int_{0}^{1}\int_{0}^{1} \frac{(x(1-x)y(1-y))^n}{(1-xy)(-\log xy)}\ dx dy$$ Sondow (see [2]) proved that $$I_n=\binom{2n}{n} \gamma+L_n-A_n$$ We prove asymptotic formula for $L_n$ and $A_n$ as $n\to\infty$, $$…
We show that the very general Verra fourfold is irrational, using the Hodge atom framework of Katzarkov--Kontsevich--Pantev--Yu. Two novel points are: a refined analysis of Hodge atoms, based on the involution on the cohomology of $X$, and…
Mechanistic Interpretability (MI) aims to understand neural networks through causal explanations. Though MI has many explanation-generating methods, progress has been limited by the lack of a universal approach to evaluating explanations.…
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
Let $\mathcal{T}$ be any of the three canonical truth theories $\textsf{CT}^-$ (Compositional truth without extra induction), $\textsf{FS}^-$ (Friedman--Sheard truth without extra induction), and $\textsf{KF}^-$ (Kripke--Feferman truth…
We present a simple new method for proving that languages are not regular. We prove the correctness of the method, illustrate the ease of using the method on well-known examples of nonregular languages, and prove two additional theorems on…
This article, dedicated with admiration in memory of Jon and Peter Borwein, illustrates by example, the power of experimental mathematics, so dear to them both, by experimenting with so-called Apery limits and WZ pairs. In particular we…
An application of (iterated) Bauer-Muir acceleration can give an Ap\'ery-like continued fraction for $\pi$ with irrational coefficients, and much faster convergence. It can be considered a generalized continued fraction with the same matrix…
In this note we show that in addition to two integers forming a Pythagorean triple, there also exist two irrational numbers in terms of which this Pythagorean triple can also be obtained. We also put forward a relation between these two…
An origin is often an intriguing issue. It becomes doubly intriguing when the logical form of thinking is considered. In this paper we will investigate exactly that: we will conjecture on the origin of basic instruments of logical thinking.…
In introductions to the subject for a general audience of mathematicians or logicians, the univalence axiom is typically explained by handwaving. This gives rise to several misconceptions, which cannot be properly addressed in the absence…
In this short paper Euler gives a highly convergent series for arctan and thus pi, which converges much faster than the Leibniz series for arctan.
We obtain a new characterization for irrational numbers of constant type -- defined as irrationals with bounded partial quotients in their continued fraction expansion. The result is essential in the formulation of stability criteria for…
In this short note I restate and simplify the proof of the impossibility of probabilistic induction from Popper (1992). Other proofs are possible (cf. Popper (1985)).
Recently Shekhar Suman [arXiv: 2407.07121v6 [math.GM] 3 Aug 2024] made an attempt to prove the irrationality of $\zeta(5)$. But unfortunately the proof is not correct. In this note, we discuss the fallacy in the proof.