COL703: Difference between revisions
| [checked revision] | [checked revision] |
Prashantt492 (talk | contribs) Creating course page via bot |
Bot: wrap bare course codes in wikilinks |
||
| Line 4: | Line 4: | ||
| credits = 4 | | credits = 4 | ||
| credit_structure = 3-0-2 | | credit_structure = 3-0-2 | ||
| pre_requisites = COL106 OR Equivalent | | pre_requisites = [[COL106]] OR Equivalent | ||
| overlaps = COL765 & COL226 | | overlaps = [[COL765]] & [[COL226]] | ||
}} | }} | ||
== COL703 : Logic for Computer Science == | == COL703 : Logic for Computer Science == | ||
Review of the principle of mathematical induction; the principle of structural induction; review of Boolean algebras; Syntax of propositional formulas; Truth and the semantics of propositional logic; Notions of satisfiability, validity, inconsistency; Deduction systems for propositional logic; Completeness of deduction systems; First order logic (FOL); Proof theory for FOL; introduction to model theory; completeness and compactness theorems; First order theories. Programming exercises will include representation and evaluation; conversion to normal-forms; tautology checking; proof normalization; resolution; unification; Skolemization, conversion to Horn-clauses; binary-decision diagrams. Decidability, undecidability and complexity results. Introduction to formal methods, temporal/modal logics. COL707 Introduction to Ethical Issues in Computer Science 4 credits (3-0-2) Pre-requisite(s): | Review of the principle of mathematical induction; the principle of structural induction; review of Boolean algebras; Syntax of propositional formulas; Truth and the semantics of propositional logic; Notions of satisfiability, validity, inconsistency; Deduction systems for propositional logic; Completeness of deduction systems; First order logic (FOL); Proof theory for FOL; introduction to model theory; completeness and compactness theorems; First order theories. Programming exercises will include representation and evaluation; conversion to normal-forms; tautology checking; proof normalization; resolution; unification; Skolemization, conversion to Horn-clauses; binary-decision diagrams. Decidability, undecidability and complexity results. Introduction to formal methods, temporal/modal logics. [[COL707]] Introduction to Ethical Issues in Computer Science 4 credits (3-0-2) Pre-requisite(s): | ||
Latest revision as of 16:26, 14 April 2026
| COL703 | |
|---|---|
| Logic for Computer Science | |
| Credits | 4 |
| Structure | 3-0-2 |
| Pre-requisites | COL106 OR Equivalent |
| Overlaps | COL765 & COL226 |
COL703 : Logic for Computer Science
Review of the principle of mathematical induction; the principle of structural induction; review of Boolean algebras; Syntax of propositional formulas; Truth and the semantics of propositional logic; Notions of satisfiability, validity, inconsistency; Deduction systems for propositional logic; Completeness of deduction systems; First order logic (FOL); Proof theory for FOL; introduction to model theory; completeness and compactness theorems; First order theories. Programming exercises will include representation and evaluation; conversion to normal-forms; tautology checking; proof normalization; resolution; unification; Skolemization, conversion to Horn-clauses; binary-decision diagrams. Decidability, undecidability and complexity results. Introduction to formal methods, temporal/modal logics. COL707 Introduction to Ethical Issues in Computer Science 4 credits (3-0-2) Pre-requisite(s):