English
Related papers

Related papers: Introducing the hardline in proof theory

200 papers

There are two major generalizations of the standard ordinal analysis: One is Girard's $\Pi^1_2$-proof theory in which dilators are assigned to theories instead of ordinals. The other is Pohlers' generalized ordinal analysis with Spector…

Logic · Mathematics 2026-05-21 Hanul Jeon

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…

Logic in Computer Science · Computer Science 2010-04-13 Kai Brünnler

We investigate the reasons of having confidence in mathematical theorems. The formalist point of view maintains that formal derivations underlying proofs, although usually not carried out in practice, contribute to this confidence. Opposing…

Logic · Mathematics 2014-11-19 Andrzej Pelc

We announce a number of conjectures associated with and arising from a study of primes and irrationals in $\mathbb{R}$. All are supported by numerical verification to the extent possible.

Number Theory · Mathematics 2013-02-22 Angelo B. Mingarelli

This book can be seen either as a text on theorem proving that uses techniques from general algebra, or else as a text on general algebra illustrated and made concrete by practical exercises in theorem proving. The book considers several…

Logic in Computer Science · Computer Science 2021-01-19 Joseph A. Goguen

The paper gives the main lines of a general theory for physical measurements.

Quantum Physics · Physics 2007-05-23 Ioan Sturzu

We prove Euler's theorem of number theory developing an argument based on quandles. A quandle is an algebraic structure whose axioms mimic the three Reidemeister moves of knot theory.

Combinatorics · Mathematics 2022-04-01 António Lages , Pedro Lopes

Type theory plays an important role in foundations of mathematics as a framework for formalizing mathematics and a base for proof assistants providing semi-automatic proof checking and construction. Derivation of each theorem in type theory…

Logic · Mathematics 2021-02-23 Farida Kachapova

In the last decades, several objects such as grammars, economical agents, laws of physics... have been defined as algorithms. In particular, after Brouwer, Heyting, and Kolomogorov, mathematical proofs have been defined as algorithms. In…

Logic in Computer Science · Computer Science 2023-06-02 Gilles Dowek

In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant characterization of the existence and multiplicity of…

Artificial Intelligence · Computer Science 2007-05-23 Bart Verheij

We investigate the cyclic proof theory of extensions of Peano Arithmetic by (finitely iterated) inductive definitions. Such theories are essential to proof theoretic analyses of certain `impredicative' theories; moreover, our cyclic systems…

Logic · Mathematics 2023-06-16 Anupam Das , Lukas Melgaard

Mathematical proofs should be paired with formal proofs, whenever feasible.

History and Overview · Mathematics 2019-04-15 Christoph Benzmüller

We give a concise proof of the fundamental theorem of smoothing theory in the special case when a smoothing exists.

Algebraic Topology · Mathematics 2010-07-09 John R. Klein , Bruce Williams

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…

Formal Languages and Automata Theory · Computer Science 2020-01-27 Jack H. Lutz , Giora Slutzki

This document is a brief overview of two documents which continue to develop the weight function theory of basis function smoothers and interpolants. One document considers the zero order theory and one considers the positive order theory.

Numerical Analysis · Mathematics 2007-10-22 Phillip Y. Williams

Circular proofs, introduced by Daniyar Shamkanov, are proofs in which assumptions are allowed that are not axioms but do appear at least twice along a branch. Shamkanov has shown that a formula belongs to the provability logic GL exactly if…

Logic · Mathematics 2022-01-03 Rosalie Iemhoff

A fundamental question asked in modal logic is whether a given theory is consistent. But consistent with what? A typical way to address this question identifies a choice of background knowledge axioms (say, S4, D, etc.) and then shows the…

Logic · Mathematics 2023-07-12 Samuel Allen Alexander , Arthur Paul Pedersen

Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…

Logic · Mathematics 2019-06-27 Dominic J. D. Hughes

This note gives an informal overview of the proof in our paper "Borel Conjecture and Dual Borel Conjecture", see arXiv:1105.0823.

Logic · Mathematics 2011-12-20 Martin Goldstern , Jakob Kellner , Saharon Shelah , Wolfgang Wohofsky

Covering theory is an important tool in representation theory of algebras, however, the results and the proofs are scattered in the literature. We give an introduction to covering theory at a level as elementary as possible.

Representation Theory · Mathematics 2026-05-29 Yuming Liu , Nengqun Li , Bohan Xing , Pengyun Chen