English
Related papers

Related papers: An Induction Principle and Pigeonhole Principles f…

200 papers

Gowers' FIN$_k$ theorem, also called Gowers' pigeonhole principle or Gowers' theorem, is a Ramsey-type theorem. It first occurred in the study of Banach space theory and is a natural generalization of Hindman's theorem. In this short note,…

Logic · Mathematics 2015-10-08 Alexander P. Kreuzer

We present new induction principles for the syntax of dependent type theories, which we call relative induction principles. The result of the induction principle relative to a functor F into the syntax is stable over the codomain of F. We…

Logic in Computer Science · Computer Science 2021-07-20 Rafaël Bocquet , Ambrus Kaposi , Christian Sattler

The infinite pigeonhole principle for 2-partitions ($\mathsf{RT}^1_2$) asserts the existence, for every set $A$, of an infinite subset of $A$ or of its complement. In this paper, we study the infinite pigeonhole principle from a…

Logic · Mathematics 2020-09-21 Benoit Monin , Ludovic Patey

It is shown that the Poincar\'e-Birkhoff fixed point theorem may be proven by extending the geometric approach originally devised by Henri Poincar\'e himself, along with several results from elementary differential topology. Beginning with…

Symplectic Geometry · Mathematics 2021-11-18 Andrew J. Graven , John H. Hubbard

We give elementary proof that theory $T^1_2(R)$ augmented by the weak pigeonhole principle for all $\Delta^b_1(R)$-definable relations does not prove the bijective pigeonhole principle for $R$. This can be derived from known more general…

Logic · Mathematics 2024-03-08 Mykyta Narusevych

A combinatorial proof of a pigeonhole principle of Gowers is found along with its symmetric and approximate version, FIN$_k^\pm$ theorem. The proofs do not use of the concept of ultrafilter.

Combinatorics · Mathematics 2019-10-04 Ryszard Frankiewicz , Sławomir Szczepaniak

It is well known that S^1_2 cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S^1_2…

Logic in Computer Science · Computer Science 2007-05-23 Norman Danner , Chris Pollett

In the paper, it is argued that the phenomenon known as the quantum pigeonhole principle (namely, three quantum particles are put in two boxes, yet no two particles are in the same box) can be explained not as a violation of Dirichlet's box…

Quantum Physics · Physics 2018-02-16 Arkady Bolotin

We give a short proof of Manin-Mumford in the multiplicative group based on the pigeon-hole principle and the so-called structure theorem for anomalous subvarieties. The arguments appear to be new and perhaps applicable in other situations.

Number Theory · Mathematics 2020-03-04 Harry Schmidt

We show that induction over $\Delta(\mathbb R)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The…

Logic · Mathematics 2021-07-07 Anton Freund

We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…

Logic · Mathematics 2021-12-21 Matthias Kunik

For $\mathbb{G}$ an algebraic (or more generally, a bornological) quantum group and $\mathbb{B}$ a closed quantum subgroup of $\mathbb{G}$, we build in this paper an induction module by explicitly defining an inner product which takes its…

Quantum Algebra · Mathematics 2022-02-08 Damien Rivet

In the former article "Formal mathematical systems including a structural induction principle" we have presented a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the…

Logic · Mathematics 2022-01-21 Matthias Kunik

We examine a version of Ramsey's theorem based on Tao, Gaspar and Kohlenbach's "finitary" infinite pigeonhole principle.We will show that the "finitary" infinite Ramsey's theorem naturally gives rise to statements at the level of the…

Logic · Mathematics 2016-11-30 Florian Pelupessy

The schematic CERES method is a method of cut elimination for proof schemata, that is a sequence of proofs with a recursive construction. Proof schemata can be thought of as a way to circumvent the addition of an induction rule to the…

Logic in Computer Science · Computer Science 2016-08-30 David M. Cerna

We prove a conjecture about the constructibility of coinductive types - in the principled form of indexed M-types - in Homotopy Type Theory. The conjecture says that in the presence of inductive types, coinductive types are derivable.…

Logic in Computer Science · Computer Science 2019-07-16 Benedikt Ahrens , Paolo Capriotti , Régis Spadotti

In this paper we present a general theory of $\Pi_{2}$-rules for systems of intuitionistic and modal logic. We introduce the notions of $\Pi_{2}$-rule system and of an Inductive Class, and provide model-theoretic and algebraic completeness…

Logic · Mathematics 2024-11-15 Rodrigo Nicolau Almeida

There has been considerable interest in a recent preprint - arXiv/1407.3194 - describing an effect named as the Quantum Pigeonhole Principle. The classical pigeonhole principle (classical PHP) refers to a result in number theory which…

Quantum Physics · Physics 2014-12-05 Alastair Rae , Ted Forgan

We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic/linear type theory with fixed points, and show, following Plotkin's suggestions, that it can be used to define a…

Logic in Computer Science · Computer Science 2017-01-11 Lars Birkedal , Rasmus E. Møgelberg , Rasmus Lerchedahl Petersen

We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which…

Logic in Computer Science · Computer Science 2023-06-22 Francesco Dagnino