Related papers: Axiomatizing provable $n$-provability
In order to study the axiomatization of the if-then-else construct over possibly non-halting programs and tests, this paper introduces the notion of $C$-sets by considering the tests from an abstract $C$-algebra. When the $C$-algebra is an…
In this note, we show that, despite the widespread assumption, the consistency formula for Peano Arithmetic PA, Con(PA), "for all x, x is not a code of a derivation of (0=1)," is not equivalent in PA to the consistency of PA. Specifically,…
We show that if $\Phi: X \dashrightarrow X$ is a dominant rational self-map of a projective surface $X$ over $\mathbb{C}$ with a regular and non-invertible iterate $\Phi^n$, then we can take $n \leq 12$. This bound is sharp and realized on…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
The automated generation of exercises may substantially reduce the time educators devote to manual exercise design. A major obstacle to the integration of such automation into teaching practice, however, lies in the ability to control the…
Mathematical theorem proving is an important testbed for large language models' deep and abstract reasoning capability. This paper focuses on improving LLMs' ability to write proofs in formal languages that permit automated proof…
Given a sequence $\mathscr{A}=\{a_0<a_1<a_2\ldots\}\subseteq \mathbb{N}$, let $r_{\mathscr{A},h}(n)$ denote the number of ways $n$ can be written as the sum of $h$ elements of $\mathscr{A}$. Fixing $h\geq 2$, we show that if $f$ is a…
For the principal eigenvalue of discrete weighted $p$-Laplacian on the set of nonnegative integers, the convergence of an approximation procedure and the inverse iteration is proved. Meanwhile, in the proof of the convergence, the…
Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…
We design and conduct a simple experiment to study whether neural networks can perform several steps of approximate reasoning in a fixed dimensional latent space. The set of rewrites (i.e. transformations) that can be successfully performed…
In the literature on Kleene algebra (KA), a number of variants have been proposed such as Kleene algebra with tests, commutative KA, bi-KA, and concurrent KA. The equational theories of some of these structures have then been studied in the…
We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics…
This paper presents a new representation of natural numbers and discusses its consequences for computability and computational complexity. The paper argues that the introduction of the first Peano axiom in the traditional definition of…
The famous G\"odel incompleteness theorem says that for every sufficiently rich formal theory (containing formal arithmetic in some natural sense) there exist true unprovable statements. Such statements would be natural candidates for being…
Based on the MRDP theorem, we introduce the ideas of the proof equation of a formula and universal proof equation of Peano Arithmetic (PA); and then, combining universal proof equation and G\"odel's Second Incompleteness Theorem, it is…
Let $G$ be a simple linear algebraic group defined over an algebraically closed field of characteristic $p\geq 0$ and let $\phi$ be a $p$-restricted irreducible representation of $G$. Let $T$ be a maximal torus of $G$ and $s\in T$. We say…
Recent authors have proposed analyzing conditional reasoning through a notion of intervention on a simulation program, and have found a sound and complete axiomatization of the logic of conditionals in this setting. Here we extend this…
We show that the theory $I\Sigma_1$ of $\Sigma_1$-induction proves the following statement: For all $n\geq 2$, the uniform $\Sigma_1$-reflection principle over the theory $I\Sigma_n$ is equivalent to the totality of the function…
We provide a semi-grammatical description of the set of normal proofs of positive formulae in minimal predicate logic, i.e. a grammar that generates a set of schemes, from each of which we can produce a finite number of normal proofs. This…
The standard interpretation of first-order number theory (PA), according to the generally accepted view, associates well-defined set-theoretic entities with each and every well-formed formula of this system. But this implies that the class…