A Note on polynomial-size monotone proofs of the pigeon hole principle
We see that the version of the pigeon-hole principle in which every hole is forced to receive a pigeon (called onto) and the version in which every pigeon is mapped into exactly one hole (called functional) have polynomial-size proofs in the tree-like monotone sequent calculus. The proofs are surpri...
| Autor: | |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2000 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/96459 |
| Acceso en línea: | https://hdl.handle.net/2117/96459 |
| Access Level: | acceso abierto |
| Palabra clave: | Pigeon-hole principle Polynomial-size monotone proofs Àrees temàtiques de la UPC::Informàtica |
| Sumario: | We see that the version of the pigeon-hole principle in which every hole is forced to receive a pigeon (called onto) and the version in which every pigeon is mapped into exactly one hole (called functional) have polynomial-size proofs in the tree-like monotone sequent calculus. The proofs are surprisingly simple reductions to the non-monotone case |
|---|