Logic(PH105)
| Course Code | Course Name | Semester | Theory | Practice | Lab | Credit | ECTS |
|---|---|---|---|---|---|---|---|
| PH105 | Logic | 1 | 3 | 0 | 0 | 3 | 6 |
| Prerequisites | |
| Admission Requirements |
| Language of Instruction | French |
| Course Type | Compulsory |
| Course Level | Bachelor Degree |
| Course Instructor(s) | |
| Assistant | |
| Objective | To provide an acquirement of the vocabulary and the concepts of the propositional logic |
| Content | Semantical analysis of the formulas of the formal language P and proofs of the theorems of the formal system PF. |
| Course Learning Outcomes | Learning to make semantical analysis of the formulas of the formal language P and acquiring the capacity of proving the theorems of the formal system PF. |
| Teaching and Learning Methods | Lecture |
| References |
Introduction to Logic I, Yalçın Koç ,Boğaziçi University Publications,1980. Naive Set Theory, Paul Richard Halmos, D. Van Nostrand Company, Princeton, NJ, 1960. Introduction to Mathematical Logic, Eliot Mendelson, D. Van Norstand Company, Princeton NJ, 1964 Sembolik Mantık, Tarık Necati Ilgıcıoğlu, Anadolu Üniversitesi Yayınları, Ankara 2013. Introduction to Mathematical Logic, Church, A., Princeton University Press, Princeton NJ, 1956. Introduction to Logic, Suppes, P., D. Van Norstrand Company, Princeton NJ, 1957. Logique formelle et argumentation, Laurence Bouquiaux & Bruno Leclercq, De Boeck, Brüksel, 2009. |
Theory Topics
| Week | Weekly Contents |
|---|---|
| 1 | The formal language P : alphabet and grammar |
| 2 | Definitional completeness for the formal language P |
| 3 | Semantics of the formal langugage P: Boolean functions on the set T :{t, f} |
| 4 | Functional completeness of the boolean functions on T |
| 5 | Interpretation of the formal language P |
| 6 | Semantical implication and deduction meta-theorem |
| 7 | Semantical analysis of the grammatical formulas of the formal language P |
| 8 | Mid-term |
| 9 | Formal system PF |
| 10 | Deduction in the formal system PF |
| 11 | Syntactical implication |
| 12 | Deduction meta-theorem for the formal system PF |
| 13 | Consistence and completeness meta-theorems for the formal system PF |
| 14 | Absolute and simple consistency of the formal system PF |
Practice Topics
| Week | Weekly Contents |
|---|
Contribution to Overall Grade
| Number | Contribution | |
|---|---|---|
| Contribution of in-term studies to overall grade | 1 | 40 |
| Contribution of final exam to overall grade | 1 | 60 |
| Toplam | 2 | 100 |
In-Term Studies
| Number | Contribution | |
|---|---|---|
| Assignments | 15 | 15 |
| Presentation | 0 | 0 |
| Midterm Examinations (including preparation) | 1 | 30 |
| Project | 0 | 0 |
| Laboratory | 0 | 0 |
| Other Applications | 0 | 0 |
| Quiz | 0 | 0 |
| Term Paper/ Project | 0 | 0 |
| Portfolio Study | 0 | 0 |
| Reports | 0 | 0 |
| Learning Diary | 0 | 0 |
| Thesis/ Project | 0 | 0 |
| Seminar | 0 | 0 |
| Other | 15 | 15 |
| Toplam | 31 | 60 |
| No | Program Learning Outcomes | Contribution | ||||
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | ||
| 1 | understands principles of deductive reasoning; has experience to verify well-foundedness and exactness of mathematical statements in systematic ways; | X | ||||
| 2 | can properly state and use concepts and results of major mathematical interest; | |||||
| 3 | masters current computational techniques and algorithms; has a good ability in their use; can identify relevant tools, among those one has learned, suitable to solve a problem and is able to judge whether or not one is in possession of these tools; | |||||
| 4 | is able to express one’s mathematical ideas in an organised way both in written and oral forms; | |||||
| 5 | understands relations connecting substantial concepts and results; can switch from one viewpoint to another on mathematical objects (pictures, formulae, precise statements, heuristic trials, list of examples,...); | |||||
| 6 | has followed individually a guided learning strategy; has pursued steps toward the resolution of unfamiliar problems; | |||||
| 7 | has a theoretical and practical knowledge in computer science well adapted for learning a programming language; | |||||
| 8 | has investigated the relevance of modeling and using mathematical tools in natural sciences and in the professional life; is conscious about historical development of mathematical notions; | |||||
| 9 | has followed introduction to some mathematical or non-mathematical disciplines after one’s proper choice; had experience to learn selected subjects according to one’s proper arrangement; | |||||
| 10 | masters French language as well as other foreign languages, to a level sufficient to study or work abroad. | X | ||||
| Activities | Number | Period | Total Workload |
|---|---|---|---|
| Class Hours | 0 | 42 | 0 |
| Working Hours out of Class | 0 | 15 | 0 |
| Assignments | 0 | 15 | 0 |
| Midterm Examinations (including preparation) | 0 | 10 | 0 |
| Final Examinations (including preparation) | 0 | 10 | 0 |
| Quiz | 0 | 8 | 0 |
| Total Workload | 0 | ||
| Total Workload / 25 | 0.00 | ||
| Credits ECTS | 0 | ||