An Application of Logic to Combinatorial Geometry: How Many Tetrahedra are Equidecomposable with a Cube?

Mathematical Logic Quarterly 40 (1):31-34 (1994)
  Copy   BIBTEX

Abstract

The main result of this paper were announced in Kosheleva — Kreinovich [7, 8]; for other algorithmic aspects of Hilbert's Third Problem see Kosheleva [6]. The authors are greatly thankful to Alexandr D. Alexandrov , Vladimir G. Boltianskii and Patrick Suppes for valuable discussions, and to the anonymous referee for important suggestions. This work was partially supported by an NSF grant No. CDA-9015006

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,937

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-12-01

Downloads
33 (#685,336)

6 months
5 (#1,039,842)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references