Who | Name/Email | Office | Office Telephone | Office hours |
---|---|---|---|---|
Instructor | Tom Ellis<tellis@tamu.edu> | YMCA 319 | 979-862-2797 | M4:00PM-5:00PM, W 4:30-5:30PM, and by appointment |
Teaching Assistant | Jonathan Bibeau <johnbibeau@tamu.edu> | YMCA 407 | MW 11:00AM-12:00PM, F 12:45PM-1:45PM | |
Teaching Assistant | Jackson Hoerth <jrhoerth@tamu.edu> | YMCA 402A | R 1:00PM-3:00PM | |
Teaching Assistant | Robert Reed <rpr82@tamu.edu> | YMCA 407 | R 1:20PM-2:20PM, F 8:50AM-10:00AM | |
SI Leader | Michael Spangler <spangler.hunter.cc@gmail.com> |
Section and Time | Leader | Section and Time | Leader | Section and Time | Leader |
---|---|---|---|---|---|
501 Thurs 2:20-3:10 | Reed | 504 Fri 10:20-11:10 | Reed | 507 Fri 1:50-2:40 | Bibeau |
502 Fri 8:00-8:50 | Reed | 505 Fri 11:30-12:20 | Hoerth | 508 Fri 3:00-3:50 | Bibeau |
503 Fri 9:10-10:00 | Hoerth | 506 Fri 12:40-1:30 | Hoerth | 509 Fri 4:10-5:00 | Bibeau |
If circumstances require postponing the date of any exam, this will be announced both in class and on this web site at least 7 days in advance. After each exam, a link will be activated in the schedule below to a key for that exam. Other information will also be added from time to time. Please check this syllabus at least once a week for these and other changes.
Mondays and Wednesdays | ||
---|---|---|
Week 1 | 9/1 | Syllabus/§1.1, §1.2 (01SEPT slides) |
Week 1 | 9/3 | §1.2 (03SEPT slides) |
Week 2 | 9/8 | §1.2;§1.3 (Translating, Stylistic Variants) (08SEPT slides) |
Week 2 | 9/10 | §1.2;§1.3 (A word about if and only if, the parenthesis dropping convention, 10SEPT slides) |
Week 3 | 9/15 | §1.4 About Proofs: Basics, Animations demonstrating the Primitive Rules of Proof, and some Derived Rules |
Week 3 | 9/17 | §1.4 About Proofs: Basics, Animations demonstrating the Primitive Rules of Proof, and some Derived Rules |
Week 4 | 9/22 | §1.4 cont., Additional exercises that require ->I and RAA | Week 4 | 9/24 | §1.5: derived rules; §1.6: Theorems, Proof Strategies (condensed version) Class Slides on Proof Strategies |
Week 5 | 9/29 | §2.1, §2.2 |
Week 5 | 10/1 | §2.4 and, time permitting, §2.3 |
Week 6 | 10/6 | Sentential Wrap-up and Review |
Week 6 | 10/8 | Exam 1 - Sample Exam (Answer Key to Sample Exam) |
Week 7 | 10/13 | §3.1:Names, predicates, predication; (13OCT Lecture Slides) |
Week 7 | 10/15 | §3.2: More about quantifiers and translation |
Week 8 | 10/20 | §3.2: More Complex Quantifications |
Week 8 | 10/22 | §3.3: Predicate logic proofs |
Week 9 | 10/27 | §3.3: Predicate logic proofs cont. |
Week 9 | 10/29 | §3.3: Predicate logic proofs cont. |
Week 10 | 11/3 | §3.4, Proof strategy |
Week 10 | 11/5 | §3.4, Proof strategy |
Week 11 | 11/10 | Proof Strategy cont. |
Week 11 | 11/12 | §4.1: Models, §4.2 |
Week 12 | 11/17 | §4.2, §4.3 |
Week 12 | 11/19 | Probability theory |
Week 13 | 11/24 | Probability cont., and Bayes Theorem |
Week 13 | 11/26 | THANKSGIVING BREAK - No labs this week |
Week 13 | 11/30 | Exam Two Review Session - 6:00PM-8:00PM Room 200 Heldenfels |
Week 14 | 12/1 | Bayes Theorem cont. |
Week 14 | 12/3 | Exam 2 - Sample Exam, Answer Key to Sample Exam |
Week 15 | 12/8 | Redefined day: Review for Jackson's Sections (503, 505, 506) from 8:00AM-10:00AM in Logic Lab (YMCA 114) |
Week 15 | 12/8 | Redefined day: Review for Rob's Sections (501, 502, 504) from 10:00AM-12:00PM in Logic Lab (YMCA 114) |
Week 15 | 12/8 | Redefined day: Review for Jonathan's Sections (507, 508, 509) from 2:00PM-4:00PM in Logic Lab (YMCA 114) |
Week 15 | 12/9 | Redefined day: Review for Rob's Sections (501, 502, 504) from 2:00PM-3:30PM in Logic Lab (YMCA 114) |
FINAL | 12/16 | ***FINAL EXAM 10:30-12:30*** Sample Final Exam (Answer Key to Sample Final Exam) |
Michael Spangler is the Supplemental Instruction (SI) Leader for this course. SI session meeting times for this semester are:
Colin Allen & Michael Hand, The Logic Primer, 2nd edition
(MIT Press, 2001)
Exam | Date | Portion of grade |
---|---|---|
Exam 1 (sentential logic) | Oct. 08 | 30% |
Exam 2 (predicate logic) | Dec. 03 | 30% |
Ten weekly quizzes | Announced in lab sessions | 20% (2% each) |
Comprehensive Final | **Dec. 16, 10:30-12:30** | 30% |
Total | 110% |
Weekly quizzes will be given in lab sections without prior announcement. There may be a quiz in any given week (in other words, you should always be prepared for one).
On examinations, A = 90% or better, B = 80% or better, C = 70% or better, D = 60% or better, F = less than 60%. On quizzes, 2 points = perfect or nearly perfect, 1 point = satisfactory, 0 points = unsatisfactory. The maximum total of all exams and quizzes is 110%; that's because you can earn up to 10% extra credit if you do very well on the quizzes.
The Logic Machine includes several automated resources specifically designed for this course's text, including (but not limited to):
None of these resources ever sleep.
After taking this course, you should:
In addition to these specific objectives, this course should help you understand and analyze complex arguments and reasoning. That ability is useful preparation for many careers and for standardized tests such as the GRE, the LSAT, and the GMAT.
There are no prerequisites for the course. It satisfies a core-curriculum quantitative reasoning requirement for many students.
This class introduces students to formal techniques for evaluating arguments. These are the principles that underlie all sound reasoning as well as the design of all contemporary computer systems.
We cover a natural deduction system of sentential logic, truth-tables, a natural deduction system of first-order predicate logic, and the basic ideas of model theory. Exams are designed to test skill with the formal systems, particularly translation from English to formulas, proof techniques, and methods for showing invalidity. The skills that you will learn with these specific methods are not merely ends in themselves but also tools to help you understand what it really means to reason logically.
Class attendance is not part of the grading basis for this course. That means both that you do not lose points for not attending class and that you do not get points just for attending class. If you can learn the material without coming to class, more power to you. However, you should be aware that:
Makeup exams and quizzes will be provided for students who have missed them because of University-approved absences only. See Student Rules, Section 7 for the University's policy on attendance and for the definition of "University-approved absence".
Learning logic is like learning a foreign language or learning mathematics: it involves learning how to do something, not just learning facts, and what you learn is cumulative. Here are three keys to success in this course:
Effective September 1, 2004, Texas A&M University has an Honor Code that defines campus policy on academic integrity and academic misconduct. The Aggie Honor System is charged with the enforcement of this Code. Students should be aware that the Aggie Honor System has the power to impose punishments for academic misconduct. For information on the Aggie Honor System, see http://aggiehonor.tamu.edu; information of particular concern to students, including definitions of types of academic misconduct, may be found at http://aggiehonor.tamu.edu/Students.
It will be my policy in this course to include the following statement on all examinations and request students to sign it:
"On my honor, as an Aggie, I have neither given nor received unauthorized aid on this academic work." ________________________________ Signature of student
The Americans with Disabilities Act (ADA) is a federal anti-discrimination statute that provides comprehensive civil rights protection for persons with disabilities. Among other things, this legislation requires that all students with disabilities be guaranteed a learning environment that provides for reasonable accommodation of their disabilities. If you believe you have a disability requiring an accommodation, please contact the Office of Support Services for Students with Disabilities in Cain Hall, Room B118. The phone number is 845-1637.