Along the course you will lear about why
reasoning is very similar to solving equations. We will discuss
how logcal statements can be formalized, how can we mechanically
decide whether one statement is the consequence of the other.
We will touch the construction of self referencing statements,
and will discuss the limits of formal reasoning.
|You can rate this course here:
Max. no. of particpants: 13
Computer Lab: #2
Duration: 5 days
Requirements for pass: - (see the course's instructor)
When the course is offered: see the list
of courses for the current semester and/or the UIS
- Truth values, predicate variables,
- logical connectives: and, or, and not.
- Forming compound statements.
- The notion of consequence and implication.
- Intuitive and formal reasoning.
- Mechanising reasoning: how can we solve logical
- Erroneous reasoning, fallacies
- Beyond predicate calculus: Every men is mortal.
- Formal languages
- translating claims about objects to an artifical language.
- What formal reasoning means?
- Translating "formal reasoning" to this
- When the snake bites its own tail:
- Gödel's famous statement I am not provable is unproveable.
- How can I prove that I cannot prove a statement?
- What does it mean in our everyday life?
Useful online resources
Standford Encyclopedia of Philosophy
Logic in wikipedia
A freely downloadable book on formal logic.
NOTE: all links open in new windows