\n(Philosophical logic)<\/strong><\/td>\nFenrong Liu, Johan van Benthem, Martin Stokhof<\/td>\n | Graduate \/ 3<\/td>\n | Fri 13:30-15:55
\n\u516d\u65596B312<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n <\/p>\n \n- \u903b\u8f91\u5b66\u57fa\u7840\u7406\u8bba (Foundations of logic)
\n<\/strong>The course gives an overview of classical meta-logical results, in particular, Godel’s completeness and incompleteness theorems, Church-Turing’s proof of the undecidability of \frst-order logic, and Tarski’s theorem on the unde\fnability of truth. After a recapitulation of the syntax and semantics of \ffirst-order logic, Henkin’s proof of completeness, in terms of syntactic models and maximal consistent sets, is presented. Philosophical and logical consequences of the result and its proof are discussed, with some glimpses from model theory. The course then presents the notions of complete and incomplete theories, as well as decidability of theories. After an overview of the philosophical and mathematical background in the early 20th century, including Hilbert’s Program, the incompleteness theorems and related results, and the ideas behind their proofs, are presented at an informal level. The remainder of the course \flls in some of the details. The course presentation focuses on important concepts and ideas, philosophical as well as mathematical, but also gives pointers to the technical details.<\/li>\n<\/ul>\n <\/p>\n \n- \u6a21\u6001\u903b\u8f91\u53ca\u5176\u5e94\u7528 (Modal logic and its applications)
\n<\/strong>Among branches of modern logic, modal logic provides a nice balance of expressivity and complexity, allowing it to be applied widely and extensively in many fields ranging from humanities to software design. In this course, ideas and methods of modal logic will be introduced along with its famous applications in modeling time, knowledge, necessity, and social behaviors. In this thread, student will be led into enviroments similar to research, in which ideas and needs from theoretical side and practical side frequently interact. Pointers will be given to standard textbooks\/handbooks as well as notable papers, and with knowledges and skills introduced in this course, students with further interests should in principle be able to explore by their own. This course aims to student who more or less have learnt some logic, but this is not strictly required.<\/li>\n<\/ul>\n <\/p>\n \n- \u6a21\u578b\u8bba (Model theory)
\n<\/strong>Introduction to model theory as a capacity training, following Hodges’\u00a0Shorter textbook.<\/li>\n<\/ul>\n <\/p>\n \n- \u5f17\u96f7\u683c\u7684\u8bed\u8a00\u54f2\u5b66 (Frege\u2019s Philosophy of Language)
\n<\/strong>Gottlob Frege is one of the milestones in the history of the western philosophy, even though his name is almost unknown to the non-philosophical public. He is the inventor of the modern logic. At the same time, his works concerning the nature of arithmetic give birth to a tradition within the philosophy of mathematics that is called \u201clogicism\u201d. Furthermore, just in his \u201cleisure time\u201d, he has managed to be the father of the modern philosophy of language. Without him, the philosophical landscape nowadays would take a totally different shape. In this course, we will try to get insight into his philosophy of language.\u00a0More precisely, we are going to focus on two topics. The first one is Frege\u2019s semantic theory concerning those sentences which contain at least one name that lacks reference. Based upon a careful study of Frege\u2019s own writings, we will compare his view with some theoretical options offered by other philosophers like Russell and Strawson. The second topic is Frege\u2019s redundancy theory concerning the concept of truth that is quite interesting on the one hand and exhibits some internal tensions on the other hand.<\/li>\n<\/ul>\n <\/p>\n \n- \u4e00\u9636\u903b\u8f91 (First-order logic)
\n<\/strong>From very beginning to the completeness theorem (countable language), step by step and seriously.<\/li>\n<\/ul>\n <\/p>\n \n- \u4eba\u5de5\u667a\u80fd\u4e2d\u7684\u903b\u8f91 (Logic in AI)
\n<\/strong>This is a seminar style course. We aim to present recent research in logic that interacts with philosophy, linguistics, social sciences, computer science and AI. Our first topic is the meaning of logical constants in various logics, how that meaning is related to logical consequence, and what this says about the nature of logic. Next we consider how generalizations, and in particular generalizations with exceptions, are expressed in natural languages, using tools from generalized quantifier theory. We go on to investigate a few logics and formal models that have been used to study some intriguing phenomena in social networks. Simulations will be presented to illustrate the properties of social networks. We will invite some guests whose research is relevant to the seminar topics to present their latest ideas. Students are required to read relevant papers and present part of papers in class, at the end they need to hand in a final paper in English 10-15 pages.
\n<\/strong><\/li>\n<\/ul>\n <\/p>\n \n- \u903b\u8f91\u4e0e\u77e5\u8bc6\u8bba (Logic and epistemology)
\n<\/strong>This course is an introduction to epistemology: the theory of knowledge. We will explore the history of various issues of epistemology, with a focus on the notion of knowledge, the relationship between knowledge, belief and evidence.\u00a0 In addition, we will pay particular attention on skepticism, namely, the thesis that we know nothing at all\u2014and we will survey a range of skeptical arguments and responses to skepticism. In addition we will also look at the issues considered in some new branches, for instance, \u00a0formal epistemology and social epistemology.<\/li>\n<\/ul>\n <\/p>\n \n- \u903b\u8f91\u3001\u8bed\u8a00\u4e0e\u54f2\u5b66 (Logic, language and philosophy)
\n<\/strong><\/strong>This course is designed for students with backgrounds and interests in philosophy, and consists of two parts. The first part of the course introduces fundamental logical notions and methods that have applications in philosophy. Things to be covered include logical systems like propositional logic, predicate logic, epistemic logic, and dynamic logic, as well as issues like inter-translation of formal and natural languages, inference pattern and calculus, epistemic activity and information flow, and the interaction between logic and games. The second part of the course introduces the students to the application of logic in the study of natural language semantics. It gives an overview of the main tools and theoretical approaches, provides concrete examples of a number of phenomena, and discusses both historical backgrounds as well as some methodological assumptions.<\/li>\n<\/ul>\n <\/p>\n \n- \u54f2\u5b66\u903b\u8f91 (Philosophical logic)
\n<\/strong><\/strong>This course is a research seminar for graduate students and advanced undergraduates. We will introduce several research areas, with a focus on the current research topics. Whenever necessary, we will invite colleagues from other universities to present their work. The students are required to read the relevant literature. We hope to bring the students to the research front, so that they can find a topic of their interest. Topics include:\u00a0Game logics (logical analysis of game structures \/ logical analysis of players and play \/ logic, games, and computation \/ logic as games and gamification); Logics for social networks (belief revision in social networks \/ epistemic logic of friendship \/ modelling communication in social networks \/ social structures and simulations); Theories of truth, rationality and logic (the problem of defining truth \/ truth, meaning and interpretation \/ truth and action explanation \/ truth and the foundations of logic).<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":" Semester 2018 Spring \u00a0 \u00a0 \u00a0Course Name \u00a0Instructo […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":179,"menu_order":1,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/pages\/899"}],"collection":[{"href":"https:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/comments?post=899"}],"version-history":[{"count":24,"href":"https:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/pages\/899\/revisions"}],"predecessor-version":[{"id":1354,"href":"https:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/pages\/899\/revisions\/1354"}],"up":[{"embeddable":true,"href":"https:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/pages\/179"}],"wp:attachment":[{"href":"https:\/\/tsinghualogic.net\/JRC\/wp-json\/wp\/v2\/media?parent=899"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}} |