|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/7169
| Title: | On Presenting Monotonicity and On EA=>AE |
| Authors: | Gries, David |
| Keywords: | computer science
technical report |
| Issue Date: | Apr-1995 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR95-1512 |
| Abstract: | Two independent topics are treated. First, the problem of weakening/strengthening steps in calculational proofs is discussed and a form of substantiating such steps is proposed. Second, a simple proof of (Ex| R.x: (Ay| S.y: P.x.y)) greater than or equal to (Ay| S.y: (Ex| R.x: P.x.y)) is presented, which uses the idea of a witness for an existnetial quantification. |
| URI: | http://hdl.handle.net/1813/7169 |
| Appears in Collections: | Computer Science Technical Reports
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|
