✦ LIBER ✦

Unprovable combinatorial statements

✍ Scribed by M. Loebl

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 577 KB
Volume: 108
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90686-a

No coin nor oath required. For personal study only.

✦ Synopsis

Loebl, M., Unprovable combinatorial statements, Discrete Mathematics 108 (1992) 333-342. We present a unified approach to combinatorial proofs of unprovability of FRT*, finite miniaturizations of Kruskal's theorem, Hercules versus Hydra game and Goodstein sequences.

📜 SIMILAR VOLUMES

An infinite combinatorial statement with

An infinite combinatorial statement with a poset parameter

✍ Pierre Gillibert; Friedrich Wehrung 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 292 KB

Systems of iterated projective ordinal n

Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees

✍ L. Gordeev 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 1021 KB

Statements

✍ Jacques Ellul; Ivan Illich 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 727 KB

Linearity and Unprovability of Set Union

Linearity and Unprovability of Set Union Problem Strategies

✍ Martin Loebl; Jaroslav Nešetřil 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 233 KB

In this paper we prove that strong postorder path compression systems have linear growth.

Unprovability threshold for the planar g

Unprovability threshold for the planar graph minor theorem

✍ Andrey Bovykin 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Financial statements

📂 Article 📅 1939 🏛 Elsevier Science 🌐 English ⚖ 164 KB