

PHIL. 160 





Catalog description:Further study of deductive logic. Topics include: principles of inference for quantified predicate logic; connectives; quantifiers; relations; sets; modality; properties of formal logical systems, e.g. consistency and completeness; and interpretations of deductive systems in mathematics, science, and ordinary language. Prerequisite: PHIL 060 (or CSC 28 or instructor permission). 3 units.Textbooks:There are two required books. The first is in paper; the second is electronic. The paperback is Gödel, Escher, Bach: An Eternal Golden Braid by Douglas Hofstadter, 1979. Any edition and printing is fine. We will begin with this book and eventually read chapters 1, 2, 3, 4, 5, 7, 8, 9, and 14 of its twenty chapters. There is no electronic version of this book.We also will read selected chapters from the electronic book Logic and Philosophy: A Modern Introduction by Alan Hausman, Howard Kahane, and Paul Tidman, 12th edition. (You must use the 12th edition, not an earlier edition.) The entire paper book of 14 chapters can be rented at www.cengagebrain.com for $36.49 through 12/23/14 (plus you have access to the electronic book while this book is being shipped to you); or you can buy (forever) just the electronic versions of the chapters that you will be required to read in the printed book (chapters 7, 8, 10, and 13) for $7.99 each chapter. If you'd like to do any personal reviewing of the Phil. 60 material, you might rent the entire Hausman book and then do your reviewing by reading early chapters. It is helpful to know that evennumbered exercises are answered in the back of the book. Do not buy the LogicCoach program. In addition to these two books, there will be some webpages and class handouts that you should consider to be required reading, especially on the topics of axiom systems and alternative logics. If you understand a little about music theory, then the Gödel, Escher, Bach book will deeply enrich your understanding; but if you don't know about music theory, then you will be relieved to know that you won't be tested on any music knowledge, just knowledge of logic. The same goes for the art and the ancient Japanese poetry that is covered in the book. Grades:Your grade will be determined by four homework assignments (each 14%), a midterm exam (20%), and a comprehensive final exam (24%). Homework questions will be handed out a week in advance of the due date. Class attendance is optional, but you are responsible for material covered in class that is not in the books.Extra credit: You have the option of earning an extra 6% by giving one tenminute presentation in class one day on something new, but relevant. Respond to student questions about your presentation. "New" means either (a) not in the assigned reading (or viewing) or (b) in there but also hasn't been or won't be discussed by Prof. Dowden. For this extra credit project you must describe it in a sentence or two in an email sent to the professor asking for approval to give the presentation. This needs to be sent no later than 7 P.M. on the night before you wish to make your presentation, but further in advance is preferable. Here are some suggestions for kinds of presentations.
Due dates:
For homeworks, you are responsible for any announced changes to questions that are made after the homework is handed out but before it is due, even if you did not attend class the day the change was made. Course Description:Our course presupposes you have had a first course in deductive logic, such as Phil. 60, or have learned this material on your own. During the course we will review Phil. 60, but also will enrich that material. Our longterm goal is to appreciate what can be done with deductive symbolic logic and what can't be done. That is, we will explore the scope and limits of deductive logic rather than its depth in one particular area.Deductive logic explores deductively valid reasoning, the most secure kind of reasoning. A mathematical proof is deductively valid reasoning. Inductive reasoning, by contrast, is about less secure reasoning from the circumstantial evidence of the lawyer, the documentary evidence of the historian, the statistical evidence of the economist, and the experimental evidence of the scientist. For a helpful metaphor, you might think of our symbolic deductive logic as a machine for detecting the presence of deductively valid reasoning. In our course, we will not only use the machine but also study what it can and cannot do, and whether it can be revised to do other things. Does it call arguments valid that we'd prefer to say are invalid? Does it have the power to show that the sentence "Obama's father is working in his office" logically implies the sentence "Someone's father is working"? Can we be confident that no use of the machine will lead to a contradiction? Our course will survey the deep results yielded by the developments in symbolic deductive logic. These results concern the surprising extent to which human knowledge can not be freed of contradictions, to what extent our knowledge can be expressed without loss of content inside of a formal language, and what our civilization has learned from the field of symbolic deductive logic about the limits to what people can know and about the limits of what computers can do. The major results here are the Unsolvability of the Halting Problem, the ChurchTuring Undecidability Theorem, Tarki's Undefinability Theorem for Truth, and Gödel's Incompleteness Theorems. During our course we will review Phil. 60 while providing a rigorous development of both propositional logic (also called statement logic and sentential logic and propositional calculus and statement calculus and the theory of truth functions) and elementary predicate logic (also called firstorder logic, relational logic, quantificational logic and predicate calculus). We will learn about their applications, extensions, metatheory, and nonclassical variants such as modal logic. Regarding nonclassical variants, the following comment in 1970 by the American logician W.V.O. Quine is helpful:
My role in our course will be to cut through the jargon and help you understand as quickly as possible. A good analogy for our course is that learning symbolic logic is much like learning a computer language. The big difference is that in symbolic logic the focus is on using the formal language to assess argument correctness rather than on getting a computing machine to follow its intended program. To continue with the analogy, in our course we will not be focusing on doing actual programming so much as learning the capabilities of the computer. As the student Justin Curry says, "grab on and get ready for a mindexpanding voyage into higher dimensions of recursive thinking." Topics and reading assignments:Click here.Relevance of logic to other subjects:If you are curious about the relevance of deductive logic to other subjects such as philosophy, mathematics, and computer science, then click on the ticket below:Student outcome goals:The hope is that by the end of the semester you will have achieved the following goals:
Laptops, cell phones:Photographing during class is not allowed without permission of the instructor. Audio recording is OK. During class, turn off your cellphone. Your computers may be used only for note taking, and not for browsing the web, reading emails, or other activities unrelated to the class. If you use a computer during class, then please sit in the back of the room or in a side row so that your monitor's screen won't distract other students. Educational research shows that students learn more when they take their notes with a pencil or pen rather than by typing.
Testing protocol:For inclass tests, you may use any books and notes but not your computer or cellphone. Disabilities:If you have a documented disability and require accommodation or assistance with assignments, tests, attendance, note taking, and so forth, then please see me early in the semester so that appropriate arrangements can be made to ensure your full participation in class. Also, you are encouraged to contact the Services for Students with Disabilities (Lassen Hall) for additional information regarding services that might be available to you.
Plagiarism and Academic Honesty:Browse the University's policy on academic honesty. A student tutorial on how not to plagiarize is available online from our library.
Food:Except for water, please do not eat or drink during class. You are welcome to leave class (and return if you wish) any time.Late assignments, and makeup assignments:I realize that during your college career you occasionally may be unable to complete an assignment on time. If this happens in our course, contact me as soon as you are able. If you promptly provide me with a good reason for missing a test or homework assignment (illness, accident, ...), then I'll use your grade on the final exam as your missing grade. There will be no makeup tests nor makeup homework. I do accept late homework with a grade penalty of onethird of a letter grade per 24hour period beginning at the class time the assignment is due. Here are some examples of how this works. If you turn in the assignment a few hours after it is due, then your A becomes an A. Instead, if you turn in the same assignment 30 hours late, then your A becomes a B+. Weekends count, so scan and email it on the weekend if that is when you finish it. No late work will be accepted after the answer sheet has been handed out (normally this will be at the next class meeting), nor after the answers are discussed in class, even if you weren't in class that day.AddDrop:To add the course, try to do so by using the CMS system. If the course is full, then see me about signing up on the waiting list. To drop the course during the first two weeks, use the CMS system. No paperwork is required. After the first two weeks, it is harder to drop, and a departmental form is required, the "Petition to Add/Drop After Deadline." As with any university course, make sure you are dropped officially (by CMS or by the instructor or department secretary); don't simply walk away into the ozone or else you will get a "WU" grade for the course, which is counted as an "F" in computing your GPA (grade point average).
Professor:My office is in Mendocino Hall 3022, and my weekly office hours for Fall Semester 2014 are TuTh 11:4512:30. Feel free to stop by at any of those times, or to call. I also have online office hours in SacCT every Wednesday evening from 810 P.M. If those hours are inconvenient for you, then I can arrange an appointment for an alternative time. You may send me email at dowden@csus.edu or call my office at 2787384 or the Philosophy Department Office at 2786424. Usually the fastest way to contact me is by email. My personal web page is athttp://www.csus.edu/indiv/d/dowdenb/index.htm
Prof. Dowden
Study tips:As you read an assignment, it is helpful first to skim the assignment to get some sense of what’s ahead. Look at how it is organized and how the author signifies main ideas (section titles, bold face, italics, full capitals, and so forth). Make your own notes as you read. Stop every twenty minutes to look back over what you’ve read and try to summarize the key ideas for yourself. This periodic pausing and reviewing will help you maintain your concentration, process the information more deeply, and retain it longer. Notice connections between one section and another. You’ll be given sample questions now and then to help guide your studying for future assignments, but the homework and test questions in our course will usually require you to apply your knowledge to new questions not specifically discussed in class nor in the book. This ability to use your knowledge in new situations requires study activities different from memorizing. You goal is to improve your skills, rather than to memorize information. Think of the textbook more as a math book than a novel, so rereading is important. Educational research shows that, for the same amount of study hours, it is better to study regularly over a long time and not try to "cram" all at once.Here are some helpful suggestions from Prof. McCormick.
Contact me at dowden@csus.edu if you'd like more information about our course.
Updated: September 22, 2014 