8241005Philosophy and History of Science (Seminars)
| Numbering Code | G-LET32 78241 SJ34 | Year/Term | 2022 ・ First semester | |
|---|---|---|---|---|
| Number of Credits | 2 | Course Type | Seminar | |
| Target Year | Target Student | |||
| Language | Japanese | Day/Period | Tue.5 | |
| Instructor name | YATABE SHUNSUKE (Part-time Lecturer) | |||
| Outline and Purpose of the Course |
The ultimate objectives of this class are for students to become experienced in logical and clear thinking, to be able to clarify the reasoning on which any assertion they may make is based, and to be able to make arguments without errors or omissions. The subject of that practice will be philosophical logic, and particularly the question of "What is logic?". We make deductions in daily life, and often use the word "logical." Of course, being "logical" is required, but what exactly is "logic"? Questioning once again the meaning of concepts we think we know, and which we use habitually and thoughtlessly, is an important task in philosophy. In this seminar, we will introduce a notation-based system ("formal system") that can be called "logic," that allows us to simulate proofs of theorems in mathematics. Specifically, we will explain and do practice problems on the system of natural deduction in minimal predicate logic. |
|||
| Course Goals | Be able to solve basic practice problems using natural deduction in minimal predicate logic. Through this, we ill understand how deductions proceed in formal systems, while at the same time understanding how everyday reasoning is simulated in formal systems. | |||
| Schedule and Contents |
Minimal predicate logic only has rules for introducing and removing logical connectors and is one of the fundamental systems of logic. In the first half of the first semester, we will introduce the system of natural deduction in minimal predicate logic. Through practice problems, the objective is for each student to be able to do natural deduction proofs on their own. In the second half, using the example of the "minimal arithmetic Q" system of arithmetic in minimal logic, we will show that it is possible to execute many proofs in mathematics with minimal logic. At the same time, we will also introduce basic concepts in calculation, such as primitive recursion. The specific class plan is as follows. 1. What Does Logic Do as a Discipline? 2. Formal Language 3. Minimal Propositional Logic's ⇒: Rules of Introduction and Removal 4. Minimal Propositional Logic's ∧ and ∨: Rules of Introduction and Removal 5. Minimal Propositional Logic Practice Problems 6. Proofs Without Detours 7. Quantifiers and Minimal Predicate Logic 8. Minimal Predicate Logic's ∀: Rules of Introduction and Removal 9. Minimal Predicate Logic's ∃: Rules of Introduction and Removal 10. Minimal Predicate Logic Practice Problems 11. Formal Natural Number Theory 12. Primitive Recursive Functions and the Proof of "2+2=4" 13. Numerical Notation Possibilities for Recursive Functions 14. Comprehensive Practice 15. Formal Logic and the Philosophy of Language |
|||
| Evaluation Methods and Policy | Grades will follow the cumulative score of the homework that will be assigned nearly every class session. | |||
| Course Requirements | None | |||
| Study outside of Class (preparation and review) |
Handouts and other class materials will be uploaded to the website (the above class blog) in advance (1-2 days before class). Students should read over the materials before class. |
|||
| Textbooks | Textbooks/References | None; handouts will be distributed in each class session. | ||
| References, etc. | 戸次大介 『数理論理学』 (東大出版会), 小野寛晰 『情報科学における論理』 (日本評論社), Dag Prawitz 『Natural Deduction: A Proof-Theoretical Study』 | |||
