<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.devclub.in/index.php?action=history&amp;feed=atom&amp;title=COL703</id>
	<title>COL703 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.devclub.in/index.php?action=history&amp;feed=atom&amp;title=COL703"/>
	<link rel="alternate" type="text/html" href="https://wiki.devclub.in/index.php?title=COL703&amp;action=history"/>
	<updated>2026-04-09T07:49:49Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.45.1</generator>
	<entry>
		<id>https://wiki.devclub.in/index.php?title=COL703&amp;diff=570&amp;oldid=prev</id>
		<title>Prashantt492: Creating course page via bot</title>
		<link rel="alternate" type="text/html" href="https://wiki.devclub.in/index.php?title=COL703&amp;diff=570&amp;oldid=prev"/>
		<updated>2026-03-04T09:59:54Z</updated>

		<summary type="html">&lt;p&gt;Creating course page via bot&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Infobox Course&lt;br /&gt;
| code = COL703&lt;br /&gt;
| name = Logic for Computer Science&lt;br /&gt;
| credits = 4&lt;br /&gt;
| credit_structure = 3-0-2&lt;br /&gt;
| pre_requisites = COL106 OR Equivalent&lt;br /&gt;
| overlaps = COL765 &amp;amp; COL226&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
== COL703 : Logic for Computer Science ==&lt;br /&gt;
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):&lt;/div&gt;</summary>
		<author><name>Prashantt492</name></author>
	</entry>
</feed>