\documentstyle[12pt]{article}

\textheight 23cm
\textwidth 6.5in
\oddsidemargin -.1in
\evensidemargin -.1in
\topmargin -1.5cm

\renewcommand{\theenumi}{\arabic{enumi}}
\renewcommand{\labelenumi}{\theenumi)}
\def\BN{{\bf N}}
\def\AC0{{\mbox{\bf AC}}^{\bf 0}}
\def\V{{\bf V^0}}
\def\VV{{\bf V^1}}
\def\NP{{\bf NP}}
\def\D0{{\bf \Delta_0}}
\def\ID0{\mbox{\bf I}{\bf \Delta_0}}
\def\SS{{\bf \Sigma_1}}
\def\IS1{\mbox{\bf I}{\bf \Sigma_1}}
\def\Iopen{\mbox{\bf I}_{\mbox{\bf open}}}
\def\SB{{\bf \Sigma_0^B}}
\def\SSB{{\bf \Sigma_1^B}}
\def\P1{{\bf \Pi_1}}
\def\LK{{\bf LK}}
\def\PA{{\bf PA}}
\def\LPA{L_{\bf PA}}
\def\L2PA{L^2_{\bf PA}}
\def\xb{\bar{x}}
\def\yb{\bar{y}}
\def\zb{\bar{z}}
\def\wb{\bar{w}}
\def\ub{\bar{u}}
\def\Krajicek{Kraj\'{\i}\v{c}ek\ }
\def\arrow{\longrightarrow}

\parskip 2ex
\parindent 0ex

\begin{document}

\begin{center}
{\large \bf CS  4995 -- Fall 2021} \\
{\large \bf Logic and Computability} \\
\end{center}

{\bf Lectures:}  Monday/Wednesday 2:40-3:55, 415 Shapiro \\
{\bf Instructor:}   Toniann Pitassi, toni@cs.columbia.edu\\
{\bf Office hours:} Monday 4-5 \\
{\bf TA:} Oliver Korten \\
{\bf Web Page:} http://www.cs.columbia.edu/~toni/Courses/Logic2021/4995.html

%{\bf Text:} None

{\bf Course Notes:}  Postscript files for course notes and
all course handouts will be available on the web page. 

{\bf Topics:} 

Propositional logic: syntax and semantics, Resolution and Propositional Sequent Calculus soundness and completeness.
First order logic: syntax and semantics, First Order Sequent Calculus soundness and completeness. Godel's Incompleteness theorems.
Computability: Recursive and recursively enumerable functions, Church's thesis, unsolvable problems

{\bf Marking Scheme:} 

3 assignments (each worth 20\% of final grade) \\
First Term test (20\% of final grade) \\
Second Term Test (20\% of final grade) \\

{\bf Due Dates:}

To be announced \\
First Test (In Class): Wednesday Oct 13, 2:40-3:55pm 415 Shapiro\\
Second Test (In Class): Monday, Nov 22, 2:40-3:55pm 415 Shapiro\\
Assignment 1 due date: Wednesday Oct 6 8pm \\
Assignment 2 due date: Monday Nov 15 8pm \\
Assignment 3 due date: Monday Dec 13 8pm \\



{\it The work you submit must be your own.} You may discuss problems with each other; however, you should prepare written solutions alone. 
%Copying assignments is a serious
%academic offence and will be dealt with accordingly.

{\bf Optional Supplementary References:}  

S Buss:  Chapter I:  An introduction to proof theory,
in {\bf Handbook of Proof Theory}, S Buss Ed., Elsevier, 1998,
pp1-78. (grad)\\
J Bell and M Machover:  {\bf A Course in Mathematical
Logic}.  North-Holland, 1977. (grad)\\
H.B. Enderton, {\bf A Mathematical Introduction to Logic} (undergrad)\\
G Boolos and R.C. Jeffrey, {\bf Computability and Logic} (undergrad)\\
E. Mendelson, {\bf Introduction to Mathematical Logic}, 3rd edition (undergrad/
grad)\\
J.N. Crossley and others, {\bf What is Mathematical Logic?} (informal, readable)\\
A.J.Kfoury, R.Moll, and M. Arbib, {\bf A Programming Approach to Computability}
(undergrad)\\
M.Davis, R. Sigal, and E. Weyuker,
{\bf Computability, Complexity, and Languages: Fundamentals of Theoretical
Computer Science} (undergrad/grad)


\end{document}