Exam Flashcards
(253 cards)
1
Q
t is free for x in φ
A
if no free x leaf in φ occurs in the scope of ∀y or ∃y for
any variable y occurring in t.
2
Q
Draw parse tree of following formula and give which variabels are bound or free
∀x ((P (x) → Q(x)) ∧ S(x, y))
A
3
Q
What is the meaning of following notation
φ[t/x]
A
replacing all free occurrences of x in φ
by t
4
Q
A
5
Q
2017 - 1b
A
6
Q
A
7
Q
A
8
Q
A
9
Q
A
10
Q
A
11
Q
A
12
Q
A
13
Q
A
14
Q
Free and bound variable
∀x ((P (x) → Q(x)) ∧ S(x, y))
A
15
Q
establishing the validity of the sequent
Premiss x + 1 = 1 + x
Premiss (x + 1 > 1) → (x + 1 > 0)
Conclusion (1 + x) > 1 → (1 + x) > 0
A
16
Q
Premiss ∀x (P (x) → Q(x))
Premiss ∃x P (x)
Conc. ∃x Q(x)
A
17
Q
Prove folowing sequent
Premiss ∀x (P (x) → Q(x))
Premiss ∀x P (x)
Conc. ∀x Q(x)
A
18
Q
Prove following sequent
Premiss P (t)
Premiss ∀x (P (x) → ¬Q(x))
Conc. ¬Q(t)
A
19
Q
Prove the following sequent
Premiss ∀x .(P (x ) →Q (x ))
Conc. ∀x .¬Q (x ) →∀x .¬P (x )
A
20
Q
Show general proof for
- For all introduction
- For all elimination
A
21
Q
Exercise 1.2.1 - c
Premiss (p ∧ q) ∧ r
Conc p ∧ (q ∧ r)
A
22
Q
Exercise 1.2.1 - e
Premiss q → (p → r)
Premiss ¬r
Premiss q
Conc. ¬p
A
23
Q
Exercise 1.2.1 - f
Conc (p ∧ q) → p
A
24
Q
Exercise 1.2.1 - h
Premiss p
Conc. (p → q) → q
A
25
# Exercise 1.2.1- i
Premiss (p → r) ∧ (q → r)
Conc p ∧ q → r
26
# Exercise 1.2.1 - j
Premiss q → r
Conc (p → q) → (p → r)
27
# Exercise 1.2.1 - l
Premiss p → q
Premiss r → s
Conc p ∨ r → q ∨ s
28
# Exercise 1.2.1 - n
Premiss (p ∨ (q → p)) ∧ q
Conc p
29
# Exercise 1.2.1 - o
Premiss p → q, r → s
Conc p ∧ r → q ∧ s
30
# Exercise 1.2.1 - r
Premiss p → q ∧ r
Conc (p → q) ∧ (p → r)
31
# Exercise 1.2.1 - v
Premiss p ∨ (p ∧ q)
Conc p
32
# Exercise 1.2.1 - x
Premiss p → (q ∨ r)
Premiss q → s
Premiss r → s
Conc p → s
33
# Exercise 1.2.1 - y
Premiss (p ∧ q) ∨ (p ∧ r)
Conc p ∧ (q ∨ r)
34
# Exercise 1.2.2 - a
Premiss ¬p → ¬q
Conc q → p
35
# Exercise 1.2.2 - b
Premiss ¬p ∨ ¬q
Conc ¬(p ∧ q)
36
# Exercise 1.2.2 - c
Premiss ¬p
Premiss p ∨ q
Conc q
37
# Exercise 1.2.2 - d
Premiss p ∨ q
Premiss ¬q ∨ r
Conc p ∨ r
38
# Exercise 1.2.2 - e
Premiss p → (q ∨ r)
Premiss ¬q
Premiss ¬r
Conc ¬p
39
# Exercise 1.2.2 - f
Premiss ¬p ∧ ¬q
Conc ¬(p ∨ q)
40
# Exercise 1.2.2 - g
Premiss p ∧ ¬p
Conc ¬(r → q) ∧ (r → q)
41
# Exercise 1.2.2 - i
Premiss ¬(¬p ∨ q)
Conc p
42
# exercise 1.2.3 - d
Conc ¬p → (p → (p → q))
43
# Exercise 1.2.3 - n
Premiss p ∧ q
Conc ¬(¬p ∨ ¬q)
44
45
46
# Prop logic - Semantics Exercise 1.4.2 - c
Compute the complete truth table of the formula
p ∨ (¬(q ∧ (r → q)))
47
# Prop logic - semantic 1.4.4 - b
Compute the truth value on the formula’s parse tree, or specify the corresponding
line of a truth table where
p evaluates to F, q to T and the formula is
p → (¬q ∨ (q → p))
48
# Prop logic - semantic 1.4.4 - c
Compute the truth value on the formula’s parse tree, or specify the corresponding
line of a truth table where
the formula is
¬((¬q ∧ (p → r)) ∧ (r → q))
p evaluates to F, q to T and r evaluates to T
49
# Prop logic - semantic - 1.4.5
A formula is valid if all its valuations evaluate to true. A formula is satisfiable if it evaluates to true for at least one of its valuations.
Is the following formula valid ? Is it satisfiable ?
50
# Prop logic - semantic 1.4.12
Premiss p → (q → r)
Conc p → (r → q)
Show that the above sequent is not valid by finding a valuation in which the truth values of the premiss formulas are true but the formula for conclusion is false
51
# prop logic - semantic 1.4.13 a
Premiss p ∨ q
Conc p ∧ q
give examples of natural language
declarative sentences for the atoms p and q such that the premises are true,
but the conclusion false
52
# prop logic - semantic 1.4.13 b
Premiss ¬p → ¬q
Conc ¬q → ¬p
give examples of natural language
declarative sentences for the atoms p and q such that the premises are true,
but the conclusion false
53
54
55
56
57
# Prop logic - deduction 1.2.3 q
Conc (p → q) ∨ (q → r)
Using LEM
58
59
60
61
62
63
64
65
# Exercise 2.3.9 - a
Prove the validity of the following sequents in predicate logic, where F , G, P ,
and Q have arity 1, and S has arity 0 (a ‘propositional atom’)
∃x (S → Q(x)) |− S → ∃x Q(x)
66
# Exercise 2.3.9 - d
Prove the validity of the following sequents in predicate logic, where F , G, P ,
and Q have arity 1, and S has arity 0 (a ‘propositional atom’)
∀x P (x) → S |− ∃x (P (x) → S)
67
# Exercise 2.3.9 - k
Prove the validity of the following sequents in predicate logic, where F , G, P ,
and Q have arity 1, and S has arity 0 (a ‘propositional atom’)
∀x (P (x) ∧ Q(x)) |− ∀x P (x) ∧ ∀x Q(x).
68
# Exercise 2.3.9 - l
Prove the validity of the following sequents in predicate logic, where F , G, P ,
and Q have arity 1, and S has arity 0 (a ‘propositional atom’)
Premiss ∀x P (x) ∨ ∀x Q(x)
Conc ∀x (P (x) ∨ Q(x)).
69
# Exercise 2.3.9 - m
Prove the validity of the following sequents in predicate logic, where F , G, P ,
and Q have arity 1, and S has arity 0 (a ‘propositional atom’)
∃x (P (x) ∧ Q(x)) |− ∃x P (x) ∧ ∃x Q(x).
70
# Exercise 2.3.9 - n
Prove the validity of the following sequents in predicate logic, where F , G, P ,
and Q have arity 1, and S has arity 0 (a ‘propositional atom’)
∃x F (x) ∨ ∃x G(x) |− ∃x (F (x) ∨ G(x))
71
# Exercise 2.3.9 - p
Prove the validity of the following sequents in predicate logic, where F , G, P ,
and Q have arity 1, and S has arity 0 (a ‘propositional atom’)
¬∀x ¬P (x) |− ∃x P (x).
72
# Exercise 2.3.9 - q
Prove the validity of the following sequents in predicate logic, where F , G, P ,
and Q have arity 1, and S has arity 0 (a ‘propositional atom’)
∀x ¬P (x) |− ¬∃x P (x)
73
# Exercise 2.3.9 - r
Prove the validity of the following sequents in predicate logic, where F , G, P ,
and Q have arity 1, and S has arity 0 (a ‘propositional atom’)
¬∃x P (x) |− ∀x ¬P (x)
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
Give all temporal connectives and some examples of formulas
* ne**X**t
* **F**uture state
* all future states (**G**lobally)
* **U**ntil
* **R**elease
* **W**eak-until
110
# 2016 - 1a
Premiss p → q
Premiss q → r
Premiss p → s
Conc p → (r ∧ s)
111
# 2016 - 1c
Premiss p ∨ q
Conc ¬q → p
112
113
Show examples of LTL connectives
Weak until - requires that a remains true until b becomes true, but does not
require that b ever does becomes true (i.e. a remains true
forever). It follows the expansion law of until.
114
# 2016 - 4a
Let P , S and M be unary predicates and R a binary predicate. Decide for each of the sequents below whether they are valid or not, i.e., give a
proof in natural deduction or a counter-model.
Premiss ∃x (P (x) ∧ ¬M (x))
Premiss ∃y (M (y) ∧ ¬S(y))
Conc ∃z(P (z) ∧ ¬S(z))
114
# 2016 - 4b
Let P , S and M be unary predicates and R a binary predicate. Decide for each of the sequents below whether they are valid or not, i.e., give a
proof in natural deduction or a counter-model.
Premiss ∀x¬R(x, x)
Conc ∀x ∀y (R(x, y) → ¬R(y, x))
115
# 2016 - 4c
Let P , S and M be unary predicates and R a binary predicate. Decide for each of the sequents below whether they are valid or not, i.e., give a
proof in natural deduction or a counter-model.
Premiss ∀x ∀y (R(x, y) → ¬R(y, x))
Conc ∀z ¬R(z, z)
116
# 2016 - 4d
Let P , S and M be unary predicates and R a binary predicate. Decide for each of the sequents below whether they are valid or not, i.e., give a
proof in natural deduction or a counter-model.
Conc ∀x∃y R(x, y) ∨ ∀x∃y ¬R(x, y)
117
118
119
120
# 2016- 5b
Let P, Q, and R be unary predicate symbols, and f a unary function
symbol. Give proofs in natural deduction of the following sequents
Premiss ∀x (f (f (x)) = x)
Conc ∀x∃y (x = f (y))
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
Describe in text how to convert a truth table to
* DNF
* CNF
* For DNF look at the rows where the expression becomes True, think of it as "the expression can be true at row x OR row 2 OR …..
* For DNF look at the rows where the expression becomes False, think of it as "the expression cannot be false at row x and row 2 and …
