Semantics - Revision history

Gert at 12:14, 3 February 2021

2021-02-03T12:14:16Z

← Older revision		Revision as of 12:14, 3 February 2021
Line 272:		Line 272:


	[[Semantics_2\|Unit 2]]		Unit 1     [[Semantics_2\|Unit 2]]     [[Semantics_3\|Unit 3]]

2021-02-03T12:03:23Z

Online Exercises

← Older revision		Revision as of 12:03, 3 February 2021
Line 268:		Line 268:

	[https://carnap.io/enroll/CBA%20WiSe%202020%2F21 Carnap]		[https://carnap.io/enroll/CBA%20WiSe%202020%2F21 Carnap]




			[[Semantics_2\|Unit 2]]

2021-01-23T12:25:24Z

Video and a truth tabel generator

← Older revision		Revision as of 12:25, 23 January 2021
Line 255:		Line 255:
	[https://trutabgen.com/ A Truth table generator]		[https://trutabgen.com/ A Truth table generator]

	Try it out by pasting the following expressions into the top box:		Try it out by pasting the following expressions into the top box and pressing the button:

	* ~P		* ~P

2021-01-23T12:17:49Z

Video and a truth tabel generator

← Older revision		Revision as of 12:17, 23 January 2021
Line 255:		Line 255:
	[https://trutabgen.com/ A Truth table generator]		[https://trutabgen.com/ A Truth table generator]

	~~Examples you can try~~ out:		Try it out by pasting the following expressions into the top box:

	* ~P		* ~P
	* (P & Q)		* (P & Q)
	* ((P <-> ~Q) -> R) v ~R		* ((P <=> ~Q) -> R) v ~R

			If you want to type in your own expressions, then first click on "How to type" in order to see how to type connectives.

	== Online Exercises ==		== Online Exercises ==

2021-01-23T12:15:40Z

Undo revision 4625 by Gert (talk)

@@ Line 248: / Line 248: @@
 ** Main connective: none, because E is an atomic formula
 ** Subformulas: none
 == Online Exercises ==

2021-01-23T12:15:00Z

Undo revision 4624 by Gert (talk)

@@ Line 248: / Line 248: @@
 ** Main connective: none, because E is an atomic formula
 ** Subformulas: none
 == Online Exercises ==

2021-01-23T12:11:57Z

Parsing complex formulas

@@ Line 248: / Line 248: @@
 ** Main connective: none, because E is an atomic formula
 ** Subformulas: none
 == Online Exercises ==

2021-01-18T13:12:29Z

Conjunctions

← Older revision		Revision as of 13:12, 18 January 2021
Line 134:		Line 134:
	These formulas consist of 5 pieces each. The pieces of (8), for instance, are:		These formulas consist of 5 pieces each. The pieces of (8), for instance, are:

	a. the opening parenthesis: (<br>		a. the opening parenthesis: <span style="color: red>'''('''</span><br>
	b. the atomic formula: (love2(the-cat,peter)<br>		b. the atomic formula: (love2(the-cat,peter)<br>
	c. the conjunction connective: <span style="color: red>'''&and;'''</span><br>		c. the conjunction connective: <span style="color: red>'''&and;'''</span><br>
	d. the atomic formula: love2(peter,the-cat).		d. the atomic formula: love2(peter,the-cat).<br>
	e. the closing parenthesis: )<br>		e. the closing parenthesis: <span style="color: red>''')'''</span><br>

	'''Important:''' the opening and closing parentheses are part of the expression. Without them, the expression is not well formed!		'''Important:''' the opening and closing parentheses are part of the expression. Without them, the expression is not well formed!

2021-01-18T13:11:28Z

Disjunctions, Implications, and the Equivalence

← Older revision		Revision as of 13:11, 18 January 2021
Line 164:		Line 164:
	The following is a schema of a well formed formula that contains a negation and all four connectives. We use capital letters to represent formulas in order to make the overall formula readable:		The following is a schema of a well formed formula that contains a negation and all four connectives. We use capital letters to represent formulas in order to make the overall formula readable:

	(14) ¬(A &and; (B &or; (C ⊃ (D &equiv; E))))		(14) <span style="color: red>'''¬'''</span>(A <span style="color: red>'''&and;'''</span> (B <span style="color: red>'''&or;'''</span> (C <span style="color: red>'''⊃'''</span> (D <span style="color: red>'''&equiv;'''</span> E))))

	(14) is the negation of a conjunction of a disjunction of an implication of an equivalence. All other expression in which the negation and the four connectives are mixed are well formed as well, as long as at each step exactly one of the 5 rules for making formulas into formulas are applied.		(14) is the negation of a conjunction of a disjunction of an implication of an equivalence. All other expression in which the negation and the four connectives are mixed are well formed as well, as long as at each step exactly one of the 5 rules for making formulas into formulas are applied.

2021-01-18T13:10:17Z

Disjunctions, Implications, and the Equivalence

← Older revision		Revision as of 13:10, 18 January 2021
Line 156:		Line 156:
	The three remaining connectives create formulas with the following names:		The three remaining connectives create formulas with the following names:

	'''Disjunction:''' (love2(the-cat,peter) &or; love2(peter,the-cat))<br>		'''Disjunction:''' (love2(the-cat,peter) <span style="color: red>'''&or;'''</span> love2(peter,the-cat))<br>
	'''Implication:''' (love2(the-cat,peter) ⊃ love2(peter,the-cat))<br>		'''Implication:''' (love2(the-cat,peter) <span style="color: red>'''⊃'''</span> love2(peter,the-cat))<br>
	'''Equivalence:''' (love2(the-cat,peter) &~~eqiv~~; love2(peter,the-cat))		'''Equivalence:''' (love2(the-cat,peter) <span style="color: red>'''&equiv;'''</span> love2(peter,the-cat))

	Note, again, that the surrounding parenthesis are part of the formula!		Note, again, that the surrounding parenthesis are part of the formula!