In mathematical logic, a logical system has the erasure property if and only if no subset of the propositions can be added to another subset of the propositions to refute a consequence.
For instance, if proposition A means "the store is open from 8:00 to 22:00" and proposition B means "except Tuesdays", the system AB does NOT have erasure.
See also
- Monotonic logic in “mathematical logic”
- Peirce's Logic at the "Stanford Encyclopedia of Philosophy"
- Reed–Solomon error correction as an example of erasure used in the replication of file systems. Where instead of replicating the whole file you replicate a portion of the file and each file has partial information of other blocks.
- Erasure Code Replication - A Microsoft PowerPoint presentation describing erasure from Chinese University of Hong Kong
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
