Logic
4 points * Second semester * Clayton * Prerequisites: MAT2020 or MAP2032 or MAT1130
Objectives On the completion of this subject students will be able to understand the classical results on propositional and predicate logic; manipulate expressions in propositional and predicate logic, to determine by several specified methods whether a propositional wff is valid; find, by specified methods, proofs of valid predicate logic sentences and sequents; have sufficient confidence in the theory to solve theoretical problems such as those set as exercises.
Synopsis Propositional and predicate logic. Proof trees and the completeness theorem. The resolution method of theorem proving and the foundations of logic programming.
Assessment Examinations (1.5 hours): 70% * Assignments: 30%
Recommended texts
Manaster A B Completeness, compactness and undecidability Prentice-Hall, 1975
| Published by Monash University, Clayton, Victoria
3168 Copyright © Monash University 1996 - All Rights Reserved - Caution Authorised by the Academic Registrar December 1996 |