INSTRUCTOR: Prof. Ram OFFICE: DM 419 E
OFFICE
HOURS: 1050-1130 Tue.,
Thu.
Office Tel.: 348-2929
1350-1500 Tue. only
Math. Dept.: 348-2743
And at mutually convenient times by Appointment
PREREQUISITE:
Introduction to Advanced Mathematics OR
Theory of Algorithms (Grade C or better )
A good working knowledge
of proofs is essential for success in this course.
TEXTBOOK:
Introduction to Mathematical Logic (4th edition)
by Elliott Mendelson, (Chapman & Hall, 1997)
SYLLABUS:
Below are the relevant sections for 95% of the course.
Propositional
Logic:
Ch. 1 Sec. 1, 2, 3, 4
Predicate
Logic:
Ch. 2 Sec. 1, 2, 3, 4,5, 6, 7
Predicate Logic with
Equality:
Ch. 2 Sec. 8, 9, 10, 11, 12, 13, 14
Formal Number
Theory:
Ch 3 Sec. 1, 2, 3, 4, 5, 6
EXAM POLICY:
1. For each exam you
will be required to bring your student ID and a blue
exam booklet (SIZE: 8"x11" - available at the F.I.U. bookstore).
2. No make-up test
will be given unless there is a legitimate, verifiable case of illness
or emergency. Officially sanctioned religious holidays may be
accommodated
provided the instructor is notified in writing during the first week of
classes.
3. Any
misconduct
will be reported and dealt with according to the Code of Student
Conduct in the Student Handbook. The Student Handbook is
available
from
Student Services in GC 112A. Please familiarize yourself with it.
4. All Beepers
and Cell Phones must be silenced in class. (Set them on
vibrate
mode.)
SCHEDULE OF EXAMS:
Three Projects (20 each):
DEADLINES to be given IN CLASS
Test #1 (100):
THURSDAY, OCT.
14th, 1230-1345
Test #2
(100): THURSDAY, DEC.
2nd, 1230-1345
Final Exam (140): TUESDAY,
DEC. 14th,
1230-1500*
* Note longer time. The final exam will be comprehensive.
GRADING SCHEME: The
grades
will be assigned as indicated below.
F
D-
D D+
C
C+ B-
B B+
A- A
|
| |
| |
|
| |
|
| |
|
0%
48 52
56 60
66
72
76
80 84
88 100%
HOLIDAYS: SEP. 6 (Mon), NOV.
11 (Thu), 25 (Thu), 26 (Fri).
DEADLINE for
DR or WI grade: NOV. 5th (Fri) by 5:00 PM.