PHIL 110 Lecture 14: lecture 14
15 Mar 2016
School
Department
Course
Professor
Document Summary
A formal system is like a game with very rigorously de ned rules for shuf ing symbols. To recapitulate, in a formal system we shuf e symbols using strict rules until be reach some conclusion. So, when considering logic as a formal system, we can forget everything about logical methodology and focus exclusively on the manner in which symbols are shuf ed according to rules. In statement logic, we shuf e symbols for statements or, as we will son say, well- formed formulas. Capitals letters such as a, b, c, x, y, z. Logical operators >, v, &, < >, not symbol. Groupers (, [, {, }, ], ) We have explicit rules telling us what is grammatically correct i. e. what is a well- formed formula. The de nition of wff it is a recursive de nition. 1)base case: accepting axiomatically that some things satisfy the de nition.
