Lecture3.1

# Lecture3.1 - IS 2150 / TEL 2810 Introduction to Security...

This preview shows pages 1–5. Sign up to view the full content.

2150 / TEL 2810 IS 2150 / TEL 2810 Introduction to Security James Joshi ssociate Professor SIS Associate Professor, SIS Lecture 3.1 September 13, 2011 athematical Review Mathematical Review Security Policies 1

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

View Full Document
Objective Review some mathematical concepts ropositional logic Propositional logic Predicate logic athematical induction Mathematical induction Lattice 2
Propositional logic/calculus Atomic, declarative statements (propositions) that can be shown to be either TRUE or FALSE but not oth;Eg “Skyisb lue”;“3islessthan4” both; E.g., “Sky is blue”; “3 is less than 4” Propositions can be composed into compound sentences using connectives Negation p ( NOT ) highest precedence Disjunction p q( OR ) second precedence onjunction ND cond precedence Conjunction p q ( AND ) second precedence Implication p q q logical consequence of p Exercise: Truth tables?

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

View Full Document
Propositional logic/calculus Contradiction: Formula that is always false : p  p hat about: What about: (p   p)? Tautology: Formula that is always True : p  p What about: (p   p)? Others
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/07/2012 for the course SIS 2150 taught by Professor Joshi during the Fall '11 term at Pittsburgh.

### Page1 / 15

Lecture3.1 - IS 2150 / TEL 2810 Introduction to Security...

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

View Full Document
Ask a homework question - tutors are online