English
Related papers

Related papers: Inconsistency of Primitive Recursive Arithmetic

200 papers

We have published several articles about generalizations and boundary-case exceptions to the Second Incompleteness Theorem during the last 25 years. The current paper will review some of our prior results and also introduce an `enriched'…

Logic · Mathematics 2018-11-16 Dan E. Willard

We present new proofs to four versions of Peano's Existence Theorem for ordinary differential equations and systems. We hope to have gained readability with respect to other usual proofs. We also intend to highlight some ideas due to Peano…

Classical Analysis and ODEs · Mathematics 2012-02-07 Rodrigo López Pouso

In this paper we establish that the well-known Arithmetic System is consistent in the traditional sense. The proof is done within this Arithmetic System.

General Mathematics · Mathematics 2018-03-30 T. J. Stępień , Ł. T. Stępień

"Clarithmetic" is a generic name for formal number theories similar to Peano arithmetic, but based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html) instead of the more traditional classical or intuitionistic logics.…

Logic in Computer Science · Computer Science 2011-08-24 Giorgi Japaridze

The aim of this note is to show that Poincar\'e inequalities imply corresponding weighted versions in a quite general setting. Fractional Poincar\'e inequalities are considered, too. The proof is short and does not involve covering…

Analysis of PDEs · Mathematics 2013-02-08 Bartłomiej Dyda , Moritz Kassmann

We study arithmetic inequalities for multiplicative, sub(super)-multiplicative, sub(super)-homogeneous functions. Applications for the classical arithmetic functions are pointed out.

Number Theory · Mathematics 2011-05-03 Jozsef Sandor

Science and mathematics help people to better understand world, eliminating many inconsistencies, fallacies and misconceptions. One of such misconceptions is related to arithmetic of natural numbers, which is extremely important both for…

General Mathematics · Mathematics 2010-10-19 Mark Burgin

We describe a "slow" version of the hierarchy of uniform reflection principles over Peano Arithmetic ($\mathbf{PA}$). These principles are unprovable in Peano Arithmetic (even when extended by usual reflection principles of lower…

Logic · Mathematics 2020-08-06 Anton Freund

Intermittently powered devices enable new applications in harsh or inaccessible environments, such as space or in-body implants, but also introduce problems in programmability and correctness. Researchers have developed programming models…

Programming Languages · Computer Science 2021-06-29 Milijana Surbatovich , Limin Jia , Brandon Lucia

The aim of this note is to prove a new discrepancy principle. The advantage of the new discrepancy principle compared with the known one consists of solving a minimization problem approximately, rather than exactly, and in the proof of a…

Numerical Analysis · Mathematics 2015-06-26 A. G. Ramm

We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…

Logic · Mathematics 2023-05-02 Morenikeji Neri , Thomas Powell

We investigate weak convergence of measures generated by solutions of stochastic equations with local time and small diffusion while the last one tends to zero. In case the correspondent ordinary differential equation has infinitely many…

Probability · Mathematics 2013-03-28 Ivan H. Krykun

We introduce Peano words, which are words corresponding to finite approximations of the Peano space filling curve. We then find the number of occurrences of certain patterns in these words.

Combinatorics · Mathematics 2007-05-23 S. Kitaev , T. Mansour

The purpose of this article is to present, in a simple way, an analytic approach to special numbers and polynomials. The approach is based on the derivative polynomials. The paper is, to some extent, a review article, although it contains…

Classical Analysis and ODEs · Mathematics 2013-02-14 Grzegorz Rzadkowski

This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…

Formal Languages and Automata Theory · Computer Science 2025-10-22 Daniel G. Schwartz

For a newcomer, paraconsistent logics can be difficult to grasp. Even experts in logic can find the concept of paraconsistency to be suspicious or misguided, if not actually wrong. The problem is that although they usually have much in…

Logic · Mathematics 2013-12-17 Jesse Alama

The work presents the brief exposition of the proof (in ZF) of inaccessible cardinals nonexistence. To this end in view there is used the apparatus of subinaccessible cardinals and its basic tools -- reduced formula spectra and matrices and…

Logic · Mathematics 2011-10-18 A. Kiselev

A new deterministic floating-point arithmetic called precision arithmetic is developed to track precision for arithmetic calculations. It uses a novel rounding scheme to avoid excessive rounding error propagation of conventional…

Discrete Mathematics · Computer Science 2025-10-20 Chengpu Wang

This paper presents new constructions of models of Hume's Principle and Basic Law V with restricted amounts of comprehension. The techniques used in these constructions are drawn from hyperarithmetic theory and the model theory of fields,…

Logic · Mathematics 2014-07-03 Sean Walsh

In this paper we analyze the status of some `unbelievable results' presented in the paper `On Some Contradictory Computations in Multi-Dimensional Mathematics' [1] published in Nonlinear Analysis, a journal indexed in the Science Citation…

General Mathematics · Mathematics 2007-05-23 E. Capelas de Oliveira , W. A. Rodrigues