Tree Tutorial 6: Functional Terms and First Order Theories
Topic: treesLogical System: default 6/5/12 Tutorial:The word 'terms' in logic means 'names' and thus far we have met two kinds of terms: constants (or proper names), and variables.
View ArticleGroups
Topic: treesLogical System: default 6/3/12 TutorialGroups can be characterized by three proper symbols {=,+,0} (ie identity, one infix operator, we will use '+', and an identify element '0') and the...
View ArticleNumber Theory and Peano Arithmetic
Topic: treesLogical System: default 6/5/12 Tutorial NotationIt is common in this setting (which is arithmetic) to use functional terms like s(x), s(1), s(0) to mean the successor of x, 1, and 0,...
View ArticleSet Theory (and Russell's Paradox)
Topic: set theorytreesLogical System: default 6/5/12 TutorialSet theory is an extensive topic introduced elsewhere. It can be written as a first order theory.There is one axiom schema, Abstraction (or...
View ArticleTree Tutorial 8: Modal Trees
6/1/12 ReadingA text likeRod Girle [2000] Modal Logics and Philosophywould definitely be a help here. Tutorial[Modal logic is a vast area, what is being presented here is the briefest of glimpses...
View ArticleClik here to view.
Review of Tree Predicate Rules
Topic: treesLogical System: default ∃D. The constant, a, must be new to the branch [here the computer will choose for you] ∀D. Any closed term, stage 1, your choice∀D. Any closed term, stage 2, the...
View ArticlePredicate Exercises: Roll your own
Topic: treesLogical System: default 6/3/12You can try your own exercises here.Here are a few hints You have to use the right (unicode/html) logical symbols. Check Writing symbols The symbols in use...
View ArticleReview of Tree Propositional Rules
Topic: treesLogical System: default6/2/12 Review of Tree Propositional Rules, shown as patternsHere the letters 'P' and 'Q' are being used to stand for entire well formed formulas (so, on a particular...
View ArticleClik here to view.
Review of Additional S5 Propositional Rules
Topic: treesmodalLogical System: default ◊ S5 world, k, must be new [here the computer will choose for you] □ S5 any world, stage 1, your choice
View ArticleReview of K Propositional Rules
Topic: treesmodalLogical System: defaultThere are the ordinary (non-modal) tree propositional rules plus The Modal Negation (MN) rules
View ArticleModal Roll Your Own
6/1/12 Roll your own If you can see this, your browser does not understand IFRAME.Topic: treesmodalLogical System: default
View ArticleReading a Counter Example from the Tree
Topic: treesLogical System: default Last altered 6/20/12 A central use for Trees is to produce a counter example to an invalid argument. To do this, you construct a tree with a complete open branch....
View ArticleThe Tree Widget
Topic: trees2013 An example of the tree widget in use (and we are showing a different parser here to the earlier ones)The logical symbols in use are ¬ ∧ ∨ → ↔ ∀ ∃ .Determine whether these arguments are...
View ArticleHelp with Reading a Counter Example [Generic]
Topic: trees2013 Reading a counter example from an open branch[This is a Quicktime Movie, click the Play button to view it. The logical symbols you see in use may be different to the ones you are...
View ArticleThe Reading a Counter Example from a Tree Widget
Topic: treesLogical System: howson Exercise: Finding a counter-example.If you can see this, your browser does not understand IFRAME.
View Article