The Mutilated Checkerboard in Set Theory

Abstract
An 8 by 8 checkerboard with two diagonally opposite squares removed cannot be covered by dominoes each of which covers two rectilinearly adjacent squares. present a set theory description of the proposition and an informal proof that the covering is impossible. While no present system that I know of will accept either formal description or the proof, I claim that both should be admitted in any heavy duty set theory.
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index Translate to english
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,819
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Peter Fletcher (1989). Nonstandard Set Theory. Journal of Symbolic Logic 54 (3):1000-1008.
Analytics

Monthly downloads

Sorry, there are not enough data points to plot this chart.

Added to index

2010-12-22

Total downloads

1 ( #453,748 of 1,099,914 )

Recent downloads (6 months)

1 ( #304,017 of 1,099,914 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.