Exercise-ch2 - Revision history

Manfred at 19:12, 28 June 2013

2013-06-28T19:12:28Z

← Older revision		Revision as of 19:12, 28 June 2013
Line 14:		Line 14:

	Go to exercises for [[Exercise_Truth_Tables\|truth tables]].		Go to exercises for [[Exercise_Truth_Tables\|truth tables]].

			== Summarizing exercise sheet for Chapter 2 ==

			The [[Assignmentsheet Logic Summer Term 2013\|exercise sheet]] was used in the class ''Introduction to Semantics'', Goethe University Frankfurt, summer term 2013.

	<hr />		<hr />

2013-05-16T20:10:38Z

The semantics of predicate logic

← Older revision		Revision as of 20:10, 16 May 2013
Line 12:		Line 12:

	Follow the [[Exercise_Semantics_of_Predicate_Logic\|link]]		Follow the [[Exercise_Semantics_of_Predicate_Logic\|link]]

			Go to exercises for [[Exercise_Truth_Tables\|truth tables]].

	<hr />		<hr />

2013-04-05T10:17:25Z

First order models

← Older revision		Revision as of 10:17, 5 April 2013
Line 3:		Line 3:
	== First order models ==		== First order models ==

	Follow the [[~~Exercis_First_Order_Models~~\|link]].		Follow the [[Exercise_First_Order_Models\|link]].

	== The syntax of predicate logic ==		== The syntax of predicate logic ==

2013-04-05T10:00:40Z

The syntax of predicate logic

@@ Line 1: / Line 1: @@
 = Additional Exercises for Chapter 2: Predicate Logic =
 == The syntax of predicate logic ==
@@ Line 5: / Line 9: @@
 Follow the [[Exercise_Syntax_of_Predicate_Logic|link]] to get to a set of exercises on the syntax of predicate logic.
-<!-- &forall; &exist; &and; &or; &sub; &sup; &not; -->
+== The semantics of predicate logic ==
-</quiz>
+Follow the [[Exercise_Semantics_of_Predicate_Logic|link]]
 <hr />

2013-04-05T09:48:51Z

The syntax of predicate logic

← Older revision		Revision as of 09:48, 5 April 2013
Line 2:		Line 2:

	== The syntax of predicate logic ==		== The syntax of predicate logic ==

			Follow the [[Exercise_Syntax_of_Predicate_Logic\|link]] to get to a set of exercises on the syntax of predicate logic.

	<!-- ∀ ∃ &and; &or; ⊂ ⊃ ¬ -->		<!-- ∀ ∃ &and; &or; ⊂ ⊃ ¬ -->

2013-03-15T22:26:12Z

← Older revision		Revision as of 22:26, 15 March 2013
Line 58:		Line 58:
	<hr />		<hr />
	Back to		Back to
	* the material for [[~~extbook~~-chapters#Chapter_2:_Predicate_logic\|chapter 2]]		* the material for [[Textbook-chapters#Chapter_2:_Predicate_logic\|chapter 2]]
	* the overview over [[Textbook-chapters\|all chapters]]		* the overview over [[Textbook-chapters\|all chapters]]

2013-03-15T22:25:32Z

← Older revision		Revision as of 22:25, 15 March 2013
Line 55:		Line 55:

	</quiz>		</quiz>

			<hr />
			Back to
			* the material for [[extbook-chapters#Chapter_2:_Predicate_logic\|chapter 2]]
			* the overview over [[Textbook-chapters\|all chapters]]

2013-03-15T21:12:10Z

Formulae without variables

← Older revision		Revision as of 21:12, 15 March 2013
Line 22:		Line 22:
	- '''frodo''' &and; '''gandalf'''		- '''frodo''' &and; '''gandalf'''
	\|\| The connectors "&and;" and "&or;" can only be used to combine two formulae.		\|\| The connectors "&and;" and "&or;" can only be used to combine two formulae.
	~~- ∃''x''~~
	~~\|\| A quantifier, "∀" or "∃", can only be used with a variable and a formula. For example: ∃''x''('''hobbit'''(''x''))~~
	- '''know'''('''gandalf''')		- '''know'''('''gandalf''')
	\|\| '''know''' is a 2-place predicate. Therefore it must combine with two arguments.		\|\| '''know''' is a 2-place predicate. Therefore it must combine with two arguments.
Line 34:		Line 32:
	- '''frodo'''		- '''frodo'''
	+ '''hobbit'''('''aragorn''')		+ '''hobbit'''('''aragorn''')
	+ ~~∀~~''x'' (''~~'hobbit'~~''(''x'') &~~sup~~; ~~x =~~ '''~~gandalf~~''')		+ '''hobbit'''('''frodo''') &and; '''wizard'''('''gandalf''')
	~~+ ∃~~''y''('''hobbit'''(''x'') &or; '''wizard'''(''~~gandalf~~''))		- '''hobbit'''('''frodo''') ¬ '''wizard'''('''sam''')
	\|\| ~~Note: The variable bound by the quantifier,~~ ''y'', ~~need~~ not ~~occur in the scope of the quantifier~~.		\|\| "¬" combines with '''one''' formula only, not with two.

	</quiz>		</quiz>

2013-03-15T20:53:30Z

The syntax of predicate logic

@@ Line 10: / Line 10: @@
 -place predicates: '''hobbit''', '''wizard'''<br />
 -place predicates: '''know''', '''help'''
 <quiz display="simple">
@@ Line 32: / Line 34: @@
 - '''frodo'''
 + '''hobbit'''('''aragorn''')
 + &forall;''x'' ('''hobbit'''(''x'') &sup; x = '''gandalf''')
 + &exist;''y''('''hobbit'''(''x'') &or; '''wizard'''(''gandalf''))

2013-03-15T20:51:08Z

The syntax of predicate logic

← Older revision		Revision as of 20:51, 15 March 2013
Line 21:		Line 21:
	\|\| The connectors "&and;" and "&or;" can only be used to combine two formulae.		\|\| The connectors "&and;" and "&or;" can only be used to combine two formulae.
	- ∃''x''		- ∃''x''
	\|\| A quantifier, ∀ or ∃, can only be used with a variable and a formula. For example: ∃''x''('''hobbit'''(''x''))		\|\| A quantifier, "∀" or "∃", can only be used with a variable and a formula. For example: ∃''x''('''hobbit'''(''x''))
	- '''know'''('''gandalf''')		- '''know'''('''gandalf''')
	\|\| '''know''' is a 2-place predicate. Therefore it must combine with two arguments.		\|\| '''know''' is a 2-place predicate. Therefore it must combine with two arguments.