Lecture05InferenceRules

Lecture05InferenceRules - Lecture 5 - CS 2603 Applied Logic...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
CS2603 Applied Logic for Hardware and Software Rex Page – University of Oklahoma 1 Lecture 5 —CS 2603 Applied Logic for Hardware and Software Inference Rules … Dude
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS2603 Applied Logic for Hardware and Software Rex Page – University of Oklahoma 2 Proof-Checker Notation prefix vsinfix -equivalent forms thm = Theorem [And A B] (And B A) thm = Theorem [A `And` B] (B `And` A) prfB = AndER (Assume(And A B)) B prfB = (Assume(A `And` B)) `AndER` B prfA = AndEL (Assume(And A B)) A prfA = (Assume(A `And` B)) `AndEL` A prf = AndI (prfB , prfA) (And B A) prefix infix
Background image of page 2
CS2603 Applied Logic for Hardware and Software Rex Page – University of Oklahoma 3 Proof-Checker Notation prefix vsinfix -equivalent forms thm = Theorem [And A B] (And B A) prfB = AndER (Assume(And A B)) B prfA = AndEL (Assume(And A B)) A prf = AndI (prfB , prfA) (And B A) prefix infix thm = Theorem [A `And` B] (B `And` A) prfB = (Assume(A `And` B)) `AndER` B prfA = (Assume(A `And` B)) `AndEL` A prf = (prfB , prfA) `AndI` (B `And` A)
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS2603 Applied Logic for Hardware and Software Rex Page – University of Oklahoma 4 Proof-Checker Notation prefix vsinfix -equivalent forms thm = Theorem [A `And` B] (B `And` A) prfB = Assume(A `And` B) {--------------------------}`AndER` B prfA = Assume(A `And` B) {-------------------------}`AndEL` A prf = (prfB , prfA) {----------------}`AndI` (B `And` A) infix thm = Theorem [A `And` B] (B `And` A) prfB = (Assume(A `And` B)) `AndER` B prfA = (Assume(A `And` B)) `AndEL` A prf = (prfB , prfA) `AndI` (B `And` A) infix with commentary
Background image of page 4
CS2603 Applied Logic for Hardware and Software Rex Page – University of Oklahoma 5 Proof-Checker Notation prefix vsinfix -equivalent forms infix with commentary and anonymoussubformulas thm = Theorem [A `And` B] (B `And` A) prf = (Assume(A `And` B) {-------------------------}`AndER` B , Assume(A `And` B) {------------------------}`AndEL` A) {-------------------------------------}`AndI` (B `And` A) thm = Theorem [A `And` B] (B `And` A) prfB = Assume(A `And` B) {--------------------------}`AndER` B prfA = Assume(A `And` B) {-------------------------}`AndEL` A prf = (prfB , prfA) {----------------}`AndI` (B `And` A)
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CS2603 Applied Logic for Hardware and Software Rex Page – University of Oklahoma 6 Using Haskell from Windows import Stdm thm = Theorem [A `And` B] (B `And` A) prf = (Assume(A `And` B) {-------------------------}`AndER` B, Assume(A `And` B) {------------------------}`AndEL` A) {-------------------------------------}`AndI` (B `And` A) Editor window __ __ __ __ ____ ___ || || || || || || ||__ ||___|| ||__|| ||__|| __|| ||---|| ___|| || || || || Version: Nov 2003 Haskell 98 mode: Restart with Type :? for help Main>
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/08/2008 for the course CS 2603 taught by Professor Rexpage during the Spring '08 term at The University of Oklahoma.

Page1 / 17

Lecture05InferenceRules - Lecture 5 - CS 2603 Applied Logic...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online