ERA

No preview available

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3QV3C738

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Computing Science, Department of

Collections

This file is in the following collections:

Technical Reports (Computing Science)

The Mutilated Checkerboard Problem in the Lightweight Set Theory of Mizar Open Access

Descriptions

Author or creator
Rudnicki, Piotr
Additional contributors
Subject/Keyword
Mizar proof checking environment
mutilated checkerboard problem
Type of item
Computing Science Technical Report
Computing science technical report ID
TR96-09
Language
English
Place
Time
Description
Technical report TR96-09. An 8 by 8 checkerboard with two diagonally opposite squares removed cannot be covered by 2 by 1 dominoes. John McCarthy postulates that a mechanized system of heavy duty set theory should accept his formal description of the proposition and his proof that the covering is impossible, as presented at the QED meeting in Warsaw in 1995. This note is a report on solving the mutilated checkerboard problem in the Mizar proof checking environment.
Date created
1996
DOI
doi:10.7939/R3QV3C738
License information
Creative Commons Attribution 3.0 Unported
Rights

Citation for previous publication

Source
Link to related item

File Details

Date Uploaded
Date Modified
2014-04-24T22:28:43.538+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: postscript (Postscript)
Mime type: application/postscript
File size: 155944
Last modified: 2015:10:12 21:17:57-06:00
Filename: TR96-09.ps
Original checksum: 16d1b36eac23213acdee24f1016613da
Activity of users you follow
User Activity Date