{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Introduction 1.3

# Introduction 1.3 - Propositional Logic(review Alphabet...

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

Propositional Logic (review) Alphabet Variables, e.g. p, q, r, ..., p 1 , ..., p’, ... Constants: T and (or F) Connectives: or {~, &, #, ->, <-> in some books} Brackets: ( and ) Well-formed-formula (wff) All variables and constants are wffs. If A and B are wffs, then the following are also wffs. Priority of connectives, and rules for removing brackets } , , , , { ) ( ), ( ), ( ), ( ), ( B A B A B A B A A York University- CSE 3401 11 01_Introduction

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

View Full Document
Propositional Logic (cont.) Semantics and truth tables true (1) and false (0) State: possible assignment to variables Tautology A formula A is a tautology if v(A)=1 (true) in all possible states Example: Satisfiable / consistent A formula A is satisfiable iff there is at least one state v where v(A)=1 (true). Examples: A set of formulae X is satisfiable (or consistent) iff there is at least one state v where for every formula A in X, v(A)=1. Example: York University- CSE 3401 12 01_Introduction ) ( p p ) ( ), ( , q p q p p )} ( ), ( , { q p q p p
Propositional Logic (cont.)

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 5

Introduction 1.3 - Propositional Logic(review Alphabet...

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

View Full Document
Ask a homework question - tutors are online