Symbolizing Atomic Propositions
8/25/12
We will start with propositional logic, then move on to the more advanced predicate logic.
Starting on propositional logic ...
8/25/12
We will start with propositional logic, then move on to the more advanced predicate logic.
Starting on propositional logic ...
[This is a film-- press the 'play' symbol.]
The very first lesson that we have a right to demand that logic shall teach us is, how to make our ideas clear; and a most important one it is, depreciated only by minds who stand in need of it. To know what we think, to be masters of our own meaning, will make a solid foundation for great and weighty thought. [CS Peirce, How to make our ideas clear]
To become familiar with the notions of argument, valid, invalid, premise, and conclusion. To learn how to symbolize atomic propositions.
The main role of logic is to assess arguments-- to say whether an individual argument is valid or whether it is invalid. In logic, arguments are taken to consist of two components--premises, and a conclusion.
For example,
If it rains, I get wet.
It rains.Therefore,
I get wet.
Indicative sentences in a natural language, English, for instance, are either true or false. For example, 'There are 35 State Governors in the U.S.A.' is an indicative sentence (which happens to be false). Such sentences express statements or propositions. Not all pieces of language express propositions. For example, the question 'What day is it today?' is not either true or false (although reasonable answers to it will be either true or false); again, the greeting 'Have a nice day!' is not either true or false.
Welcome!
These web pages provide an introduction to logic to the level of Propositional and Predicate Calculus.
The focus of the program is on arguments and the question of whether they are valid. Arguments have the form <list of premises> ∴<conclusion>. An argument is valid if and only if it is not possible for all its premises to be true and its conclusion false at one and the same time; an argument which is not valid is invalid.
You need to know some propositional logic to be able to understand the tree tutorials to come. In particular, you need to know about the symbols used in propositional logic, truth tables, satisfiability, consistency, and semantic invalidity (by counter example). You do not need to know propositional rules of inference and derivations.
Howson [1997] will give you enough background.
Alternatively you could look at the first five propositional tutorials in Easy Deriver
6/21/07 10 Software
You may have derivations of your own that you wish to try. Just type, paste, or drag and drop, them into the panel, select your derivation, and click 'Start from selection'. [Often copy-and-paste won't work directly from a Web Page; however, usually drag-and-drop will work!]
You will need to use the correct logical symbols. Here they are
F ∴ F & G ∼ & ∨ ⊃ ≡ ∃ ∴ (or use the palette to produce them)
9/4/06
This movie shows the downloadable application being used, but the manipulations are so similar to those of the web page applet that it really covers both.
This video is also using a different logical system, but it is close enough for now to illustrate the important points. [The video will be revised and replaced.]