✦ LIBER ✦
An Application of Logic to Combinatorial Geometry: How Many Tetrahedra are Equidecomposable with a Cube?
✍ Scribed by Vladik Kreinovich; Olga Kosheleva
- Publisher
- John Wiley and Sons
- Year
- 1994
- Tongue
- English
- Weight
- 231 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
It is known (see Rapp [9]) that elementary geometry with the additional quantifier “there exist uncountably many” is decidable. We show that this decidability helps in solving the following problem from combinatorial geometry: does there exist an uncountable family of pairwise non‐congruent tetrahedra that are n‐equidecomposable with a cube?
Mathematics Subject Classification: 03B25, 03C80, 51M04, 52B05, 52B10.