Search results
Jump to navigation
Jump to search
Page title matches
- ==Modal Logic Tableaux== ...propositional logics we introduced a tableau calculus (Definition) for a logic <math>L</math> as a finitely branching ...3 KB (577 words) - 12:00, 20 August 2007
- ==Modal Logic== Modal logic is concerned with the investigation of modalities in ...3 KB (511 words) - 12:34, 25 August 2007
- ==Predicate Logic== When we introduced propositional logic we argued in treating the ...2 KB (413 words) - 17:25, 24 May 2007
- {{Formal Logic:TOCPageNav|up=Sentential Logic|prev=Inference Rules|next=Subderivations and Discharge Rules}} ...ises and temporary assumptions from other lines. When we get to predicate logic, there are restrictions on using premises and temporary assumptions. Setti ...6 KB (939 words) - 22:50, 8 July 2007
- {{Formal Logic:TOCPageNav|up=Sentential Logic|prev=Constructing a Simple Derivation|next=Constructing a Complex Derivatio ...stified by the Deduction Principle introduced at [[Formal Logic/Sentential Logic/Properties of Sentential Connectives#Deduction principle|Properties of Sent ...12 KB (1,643 words) - 22:02, 18 November 2007
- A tableau for a logic <math>L</math> is a finitely branching tree whose nodes are formulas from for propositional logic. ...9 KB (1,542 words) - 14:18, 3 August 2007
- 3 KB (521 words) - 11:55, 20 August 2007
- 4 KB (757 words) - 14:42, 3 August 2007
- {{Formal Logic:TOCPageNav|up=Sentential Logic|prev=Subderivations and Discharge Rules|next=Theorems}} ...17 KB (2,166 words) - 00:41, 24 February 2006
- 6 KB (1,017 words) - 14:45, 3 August 2007
- Together with the observation that validity in modal logic <math>K</math> (like in many predicate logic which is decidable! ...2 KB (304 words) - 12:00, 20 August 2007
- past and future. For this we need a multi-modal logic with the following ...1 KB (241 words) - 12:01, 20 August 2007
- {{Formal Logic:TOCPageNav|up=Predicate Logic|prev=Formal Syntax|next=Informal Conventions}} .../math> are also sentences of <math>\mathcal{L_S}\,\!</math>. In predicate logic and its language <math>\mathcal{L_P}\,\!</math>, however, we have formulae ...8 KB (1,196 words) - 10:05, 19 March 2006
- of particular interest for logic programming. Furthermore it turns out that and in the context of logic programming this is written as: ...5 KB (928 words) - 14:03, 3 August 2007
- first order classical predicate logic. ...2 KB (438 words) - 11:59, 20 August 2007
- following holds for propositional logic formulae <math>F</math>, <math>G</math> and <math>H</math>: a propositional logic formula, which contains only the ...16 KB (2,717 words) - 20:18, 20 August 2007
- ...ropositional case in theorem [[Logic for Computer Scientists/Propositional Logic/Equivalence and Normal Forms|4]] ...13 KB (2,394 words) - 14:41, 3 August 2007
- logic. Until now we have a language, i.e. a set of formulae and we ...11 KB (1,921 words) - 14:06, 3 August 2007
- We assume the syntax of classical propositional logic as used in the chapters ''necessity''; in the context of temporal logic they stand for ''always'' and ...632 bytes (100 words) - 14:21, 5 July 2007
- We will introduce the syntax of propositional logic by a very simple inductive ...4 KB (685 words) - 13:49, 3 August 2007
Page text matches
- ==Modal Logic== Modal logic expands propositional logic by operators for the modalities ''possibility'' and ''necessity''. These b ...404 bytes (57 words) - 01:48, 3 September 2007
- ==Modal Logic== Modal logic expands propositional logic by operators for the modalities ''possibility'' and ''necessity''. These b ...404 bytes (57 words) - 22:20, 25 August 2007
- [[Puzzles]] | [[Puzzles/Logic puzzles|Logic puzzles]] | Scales and Weights Solutions: [[Puzzles/Logic puzzles/Scales and Weights/Solution 1|Up to 40 kg]] | ...852 bytes (135 words) - 05:58, 13 November 2006
- ...ction to Philosophy]] > [[Introduction_to_Philosophy:Logic|Logic]] > Modal Logic ...l logic and predicate calculus) and is therefore an extension of classical logic. ...3 KB (457 words) - 01:36, 11 September 2007
- ===Second Order Logic (SO)=== [[w:Second-order logic|Second-order logic]] extends first-order logic by adding variables and quantifiers that range over sets of individuals. F ...2 KB (313 words) - 22:25, 4 June 2007
- We assume the syntax of classical propositional logic as used in the chapters ''necessity''; in the context of temporal logic they stand for ''always'' and ...632 bytes (100 words) - 14:21, 5 July 2007
- ==Definition 1 (Syntax of predicate logic - Terms)== ==Definition 2 (Syntax of predicate logic - Formulae)== ...4 KB (632 words) - 14:26, 3 August 2007
- Together with the observation that validity in modal logic <math>K</math> (like in many predicate logic which is decidable! ...2 KB (304 words) - 12:00, 20 August 2007
- [[Logic for Computer Scientists/Predicate Logic/Strategies for Resolution/SLD-Resolution| SLD-Resolution]] ...884 bytes (141 words) - 13:51, 15 June 2007
- ==Zero-order logic or the Propositional calculus== The '''zero-order logic''', often referred to as the '''propotional calculus''' are defined in the ...2 KB (376 words) - 22:41, 11 January 2007
- ==From Propositional Logic to FO== ===Propositional Logic=== ...5 KB (778 words) - 00:51, 28 December 2007
- {{Formal Logic:TOCPageNav|up=Sentential Logic|prev=Substitution and Interchange|next=Derivations}} The page [[Formal Logic/Sentential Logic/The Sentential Language|The Sentential Language]] gave a very brief look at ...12 KB (1,847 words) - 22:11, 19 September 2006
- {{Formal Logic:TOCPageNav|up=Sentential Logic|prev=Expressibility|next=Substitution and Interchange}} ...logies. They can be added to the ones listed in [[Formal Logic/Sentential Logic/Expressibility#Interdefinability of connectives|Interdefinability of connec ...11 KB (1,498 words) - 21:51, 19 September 2006
- {{Formal Logic:TOCPageNav|up=Sentential Logic|prev=Formal Syntax|next=Formal Semantics}} ...>\mathcal{L_S}\,\!</math>. We have also given a [[Formal Logic/Sentential Logic/Formal Syntax|Formal Syntax]] for <math>\mathcal{L_S}\,\!</math>. Our offi ...6 KB (876 words) - 00:19, 12 June 2007
- ==Predicate Logic== When we introduced propositional logic we argued in treating the ...2 KB (413 words) - 17:25, 24 May 2007
- {{Formal Logic:TOCPageNav|up=Sentential Logic|prev=Informal Conventions|next=Truth Tables}} ...<math>\mathcal{L_S}\,\!</math>. We also gave a [[Formal Logic/Sentential Logic/Formal Syntax|Formal Syntax]]. However, at this point our language is just ...8 KB (1,178 words) - 09:07, 5 November 2006
- {{Formal Logic:TOCPageNav|up=Sentential Logic|prev=Translations|next=Inference Rules}} ...the notion of ''validity'' for formulae and for arguments. In sentential logic, a valid formula is a tautology. ...6 KB (934 words) - 15:59, 3 April 2007
- ==Definition 4 (Semantics of predicate logic - Interpretation)== ==Definition 5 (Semantics of predicate logic - Evaluation of Formulae)== ...7 KB (1,183 words) - 13:24, 14 August 2007
- Starting from the modal logic <math>K</math> one can add additional axioms, yielding Traditionally, if one adds axioms <math>A_1, \cdots , A_n</math> to the logic <math>K</math> one calls ...4 KB (641 words) - 12:32, 20 August 2007
- ==[[HSE Logic|Logic]]== ===Logic Puzzles exercises=== ...35 KB (3,219 words) - 07:01, 13 November 2006