COMP 409: Logic Homework 5
|
|
- Andrew Martin
- 5 years ago
- Views:
Transcription
1 COMP 409: Logic Homework 5 Note: The pages below refer to the text from the book by Enderton. 1. Exercises 1-6 on p Translate into this language the English sentences listed below. If the English sentence is ambiguous, you will need more than one translation. (a) Zero is less than any number. ( n)(n(n)) (0 < n) (b) If any number is interesting, then zero is interesting. Here are two interpretations of this sentence: (c) No number is less than zero. ( n)(n(n) I(n)) I(0) also, we could interpret it as ( n)(n(n) I(n) I(0)) ( n)(n(n) (n < 0)) or, equivalently, ( n) ((N(n)) (n < 0)) (d) Any uninteresting number with the property that all smaller numbers are interesting certainly is interesting. ( n)(n(n) I(n) (( m)((n(m)) (m < n)) (I(m)))) I(n) (which is a contradiction!) (e) There is no number such that all numbers are less than it. ( n)(n(n)) ( m)(n(m) (m < n)) (f) There is no number such that no number is less than it. ( n)(n(n)) ( (( m)(n(m) (m < n)))) 1
2 2. Neither a nor b is a member of every set. ( ( s(a S))) ( ( s(b S))) 3. If horses are animals, then heads of horses are heads of animals. (E is a horse; A is an animal; h() designates a head.) ( x(e(x) A(x))) ( x((e(x) ( y(a(y) (h(x) h(y))))))) 4. P is a person; T is a time, F (x, y) means that you can fool x at time y. (a) You can fool some of the people all of the time. ( p)( t)(p (p)) (T (t) (F (p, t))) (b) You can fool all of the people some of the time. ( t)( p)(p (p)) (T (t) (F (p, t))) (c) You can t fool all of the people all of the time. (( p, t)(p (p) (T (t) (F (p, t))) 5. J is a job; a designates Adams; D(x, y) means that x can do y right. (a) Adams can t do every job right. ( j)(j(j) (D(a, j))) (b) Adams can t do any job right. ( j)(j(j) ( D(a, j)) 6. Nobody likes everybody. (L(x, y) means x likes y.) 2. Exercises 1-6 on pp Show that (a) Γ; α = ϕ iff Γ = (α ϕ) (( x)( y)(l(x, y))) : To show this holds, assume Γ; α = ϕ. We show that for every domain B and assignment β, if B; β = Γ, then B; β = (α ϕ), which is the definition of Γ = (α ϕ). Consider an arbitrary domain B and assignment β. The premise, that Γ; α = ϕ, implies that if B; β = Γ; α then B, β = ϕ. By definition, B; β = Γ; α when B; β = Γ and B; β = α. We thus consider 2
3 three cases: that B; β = Γ; α, that B; β = Γ but B; β = α, and that B; β = Γ. In the first case, our premise entails that B; β = ϕ, and thus by definition of we have B; β = (α ϕ). In the second case, where B; β = Γ but B; β = α, we cannot draw any conclusions from our premise. However, since B; β = α, by definition of we have that B; β = (α ϕ). In the third case, where that B; β = Γ, our conclusion holds trivially. : To show the reverse direction holds, assume Γ = (α ϕ). We show that for every domain B and assignment β, if B; β = Γ; α, then B; β = ϕ. We consider the same two cases: either both B; β = Γ and B; β = α, or not. In the first case, since B; β = Γ, our premise implies B; β = (α ϕ). Since B; β = α, this holds only when B; β = ϕ. In the second case, one of that B; β = Γ and B; β = α fails to hold, which implies B; β = Γ; α, and our conclusion holds. (b) ϕ == ψ iff = (ϕ ψ) Using the result from above, we have, ϕ == ψ iff ϕ = ψ and ψ = ψ iff = (ϕ ψ) and = (ψ ϕ) iff = (ϕ ψ) 2. Show that no one of the following sentences is logically implied by the other two. (This is done by giving a structure in which the sentence in question is false, while the other two are true.) (a) x y z(p xy (P yz P xz)) (b) x y(p xy (P yx x y) D = IR, P (x, y) is true iff (y = x) D = G{V, E} such that G is a clique, P (x, y) is true iff there is an edge connecting x to y (c) x yp xy y xp xy D = IR, P (x, y) is true iff (x y) 3. Show that { x(α β), xα} = xβ. { x(α β), xα} = xβ = ({ x(α β) xα} xβ) = ({ x( α β) xα} xβ) = ({ x(false β)} xβ) = (( xβ) xβ), which is trivially true. 4. Show that if x does not occur free in α, then α = xα. 3
4 We show that for every domain B and assignment β, if B; β = α, then B; β = xα. Consider a B; β. If B; β = α, our conclusion holds trivially. Thus let B, β be such that B; β = α. Since x is not in F V ars(α), for every d it holds that β F V ars(α) = β[x d] F V ars(α). By the Relevance Lemma of FOL, we can thus conclude that for every d, B; β = α iff B; β[x d] = α. Since B; β = α is our premise, we have that for every d, B; β[x d] = α: the definition of B; β = xα. 5. Show that the formula x y (P zfx P zfy) (where f is a one-place function symbol and P is a two-place predicate symbol) is valid. We ll prove a stronger claim ϕ = ((x y) (P (z, f(x)) (P (z, f(y))))) Proof. Let s select a structure A. 1) A, α = (x y) A, α = ϕ by the definition of. 2) A, α = (x y) α(x) = α(y). Thus, A, α = P (z, f(x)) iff P A (α(z), f A (α(x))) iff P A (α(z), f A (α(y))) iff A, α = P (z, f(y)). Therefore, A, α = (P (z, f(x)) (P (z, f(y)))) A, α = ϕ. Combining the two cases, we conclude that ϕ is valid. 6. Show that a formula θ is valid iff xθ is valid. Let s select a structure A. Let s select an α. = θ for all α, ( xθ) is valid. for all a D, A, α[x a] = θ iff A, α = ( xθ). Because it is true Suppose there exists α, A, α = θ exists α, A, α = ( θ) exists a D (a = α(x)), A, α[x a] = ( θ) A, α = ( x( θ)). On the contrary, for the same α, A, α = ( xθ) iff A, α = ( ( x( θ))). Because α cannot satisfy a formula and the same negated formula at the same time, the obtained contradiction concludes the proof. 3. Exercises 8-12 on p Assume that Σ is a set of sentences such that for any sentence τ, either Σ = τ or Σ = τ. Assume that U is a model of Σ. show that for any sentence τ, = U τ iff Σ = τ. 1) We will prove first that if Σ = τ then = U τ. = U Σ and Σ = τ implies = U τ. 2) Assume = U τ. We will prove by contradiction that Σ = τ. Assume that Σ = τ. Then, by hypothesis, Σ = τ. By point 1, it follows that = U τ. But then = U τ and = U τ, contradiction. Then Σ = τ. 9. Assume that the language has equality and a two-place predicate symbol P. For each of the following conditions, find a sentence σ such that the structure U(= ( U, P U )) is a model of σ iff the condition is met. 4
5 (a) U has exactly two members. x y z( (x y) (z x z y)) Exists two different elements but choose any element must me the same of one of the two. (b) P U is a function from U into U. x y z(p (x, y) (P (x, z) y z)) For P to be x y, there is a y for every x, and whenever P(x)=z, z=y. (c) P U is a permutation of U ; i.e., P U is a one-to-one function with domain and range equal to U. ( x y z(p (x, y) (P (x, z) y z))) ( y x z(p (x, y) (P (z, y) x z))) P is both a function from x to y and from y to x. 10. Show that = U v 2 Qv 1 v 2 [[c U ]] iff = U v 2 Qcv 2. Here Q is a two-place predicate symbol and c is a constant symbol. : Take A so that A, [v 1 c A ] = v 2 Q(v 1, v 2 ). This is equivalent to for all d A, A, [v 1 c A, v 2 d] = Q(v 1, v 2 ). i.e. For all d A, < c A, d > Q A. So A = v 2 Q(c, v 2 ). : Take A so that A = v 2 Q(c, v 2 ). For all d A, A, [v 2 d] = Q(c, v 2 ). So < c A, d > Q A. So A, [v 1 c A ] = v 2 Q(v 1, v 2 ) 11. For each of the following relations, give a formula which defines it in (N, +, ). (The language is assumed to have equality and the parameters, +, and.) (a) {0}. (b) {1}. (c) { m, n : n is the successor of m in N}. (d) { m, n : m < n in N}. zero(z) = ( n)((n + z) n) zero(z) = ( n)((n z) z) one(o) = ( n)((n o) n) successor(m, n) = ( x)(one(x) (n (m + x))) lessthan(m, n) = ( k)( zero(k) (n (m + k))) 5
6 12. Let R be the structure (IR, +, ). (The language is assumed to have equality and the parameters, +, and. R is the structure whose universe is the set IR of real numbers and such that + R and R are the usual addition and multiplication operations.) (a) Give a formula which defines in R the set [0, ). P (s) = ( r)(s (r r)) (b) Give a formula which defines in R the set {2}. 1(x) = ( r)(r x r) 2(x) = ( y)(1(y) (x (y + y))) (c) Show that any finite union of intervals, the endpoints of which are algebraic, is definable in R. (The converse is also true; these are the only definable sets in the structure. But we will not prove this fact.) A note on notation: Given a formula ϕ with a single free variables x, we will sometimes denote it ϕ(x) to make the free variable explicit. We first note that the natural linear order ( ) and the natural strict linear order (<) on R can be defined as follows: (x y) = z(y (x + z z)) (x < y) = (x y) (x y) For each integer m, we construct a formula ϕ m (x) that defines m. We first define 0 and 1: ϕ 0 (x) = y(x + y y) ϕ 1 (x) = y(x y y) Then, for natural number n > 1, ϕ n is inductively defined as ϕ n (x) = y z(x y + z) ϕ n 1 (y) ϕ 1 (z) and the negative integer n is defined by the formula ϕ n (x) = y z(x + y z) ϕ n (y) ϕ 0 (z) We note that we can now treat each integer m as a constant while defining new formulas. Our justification for this simplification is as follows: Given a formula ϕ with occurences of m as a constant term, we can obtain a formula ϕ by replacing each occurence of m with a fresh variable x m. Then ϕ = x m (ϕ m (x m ) ϕ ) is logically equivalent to ϕ and does not contain any occurence of m. Thus using integer constants in our formulas gives us no additional power and is merely a notational simplification. We next show that each algebraic number can be defined in R. By definition, each algebraic number is the root of a polynomial with integer coefficients. Given a polynomial p(x), we inductively define the corresponding term t p(x) as follows: For c Z, t c = c 6
7 t x = x For k > 0, t x k+1 = t x k x For a Z, t ax k = a t x k t p(x)+q(x) = t p(x) + t q(x) Then the roots of the polynomial p(x) can be defined by the formula ϕ p(x)=0 as follows: ϕ p(x)=0 = (t p(x) 0) In general, p(x) can have multiple roots, so we need to distinguish between the roots and obtain the one we want. Let α be an algebraic number such that α is a root of p(x). Since p(x) has a finite number n of distinct roots, we can order these roots using <. Then there exists k n such that α is the kth smallest root. We can then define α as follows: ϕ α (x) = x 1 x n ((x x k ) n i=1 ϕ p(xi)=0 i<k(x i < x k ) j>k(x j > x k ) i j (x i x j )) Therefore every algebraic number can be defined. Let α and β be algebraic numbers with α β. Then the following formula defines the interval [α, β] (here we only give the case for the closed interval; the other types of intervals can be defined similarly): ϕ [α,β] (x) = y z(ϕ α (y) ϕ β (z) (y x) (x z)) Finally, a finite union of intervals can be defined by simply taking the conjunction of the formulas for each interval in the collection. Thus the union of the intervals [α 1, β 1 ],..., [α k, β k ] can be defined by the formula: k ϕ [αi,β i](x) 4. Exercise 17(a) on p. 96: Moved to HW6 i=1 5. Consider the following English sentences. Can you formalize these sentences in first-order logic? How? There are some critics who admire only one another. We can interpret this statement as defining a clique on a graph, where there is an edge between two critics iff they admire one another. Since FOL is not powerful enough to express cliques, this sentence cannot be expressed either. It is not the case that there are some numbers among which none is least. Notice that here again there is a second-order quantification in disguise. We would like to be able to quantify over sets of numbers, but this is not allowed in FOL. 6. Show that the following formulas are valid, where in (b)-(i) x is not free in β. Can the material implication in (a) be reversed? We use the following lemma in our derivations below. 7
8 Lemma: x / F V ars(β) β == xβ. Proof: By the relevance lemma, α F V ars(β) = α[x d] F V ars(β) for all d D and so A, α[x d] = β iff A, α = β for all d D. Then, models( xβ) = {A, α for every d D A, α[x d] = β} = {A, α A, α = β} = models(β) (a) x(α β) ( xα xβ) x(ψ β) iff A, α = x(ψ β) iff, for all a D, A, α[x a] = ( ψ) or A, α[x a] = β exists a D, A, α[x a] = ( ψ) or for all a D, A, α[x a] = β iff ( x( ψ) ( xβ) iff (( xψ) ( xβ)) iff ( xψ xβ) In this part the material implication cannot be reversed because in the step for all a D, A, α[x a] = ( ψ) or A, α[x a] = β exists a D, A, α[x a] = ( ψ) or for all a D, A, α[x a] = β, the implication holds only in that one direction. (b) x(α β) ( xα β) (c) x(α β) ( xα β) (d) x(α β) ( xα β) (e) x(α β) ( xα β) (f) x(α β) ( xα β) x(α β) ( xα xβ) by distributivity of ( xα β) because x is not free in β x(α β) ( xα xβ) by the lemma ( xα β) because x is not free in β x(α β) ( xα xβ) by the lemma ( xα β) because x is not free in β x(α β) ( xα xβ) by distributivity of ( xα β) because x is not free in β x(α β) x( α β) by definition of ( x α xβ) by the lemma ( xα xβ) by complementation of ( xα β) because x is not free in β ( xα β) by definition of 8
9 (g) x(α β) ( xα β) (h) x(β α) (β xα) (i) x(β α) (β xα) x(α β) x( α β) by definition of ( x α xβ) by distributivity of ( xα xβ) by complementation of ( xα β) because x is not free in β ( xα β) by definition of x(β α) x( β α) by definition of ( x β xα) by the lemma ( xβ xα) by complementation of ( β xα) because x is not free in β (β xα) by definition of x(β α) x( β α) by definition of ( x β xα) by distributivity of ( xβ xα) by complementation of ( β xα) because x is not free in β (β xα) by definition of 7. Assume a relational vocabulary (i.e., no function symbols). For a sentence ϕ of 1st-order logic with equality, let ϕ be the result of replacing every atomic formula x = y in ϕ by E(x, y), where E is a new binary predicate symbol, and then conjoining with the equivalence and congruence axioms for E. (The equivalence axioms says that E is reflexive, symmetric and transitive. The congruence axioms says that if P (a 1,..., a k ) holds and E(a i, b i ) holds for i = 1,..., k, then P (b 1,..., b k ) holds.) Show that ϕ is satisfiable iff ϕ is satisfiable. (Recall that a sentence is satisfiable if it is satisfied by some structure.) (Hint: You can use equivalence classes as elements.) Notation: Given a formula ψ over a vocabulary that does not contain E, we define ψ E to be the formula obtained from ψ by replacing every atomic formula (x y) by E(x, y). We also define σ to be the sentence obtained by conjoining the equivalence and congruence axioms for equality. We note that in this notation, we have ϕ = ϕ E σ E = (ϕ σ) E. The sentence σ E is given by the conjunction of the following sentences ϕ reflexive = xe(x, x) ϕ symmetric = x y(e(x, y) E(y, x)) ϕ transitive = x y z(e(x, y) E(y, z) E(x, z)) ϕ congruence = x 1... x k y 1... y k ((P (x 1,..., x k ) E(x 1, y 1 ) E(x k, y k )) P (y 1,..., y k )) 9
10 where a congruence axiom is needed for each predicate symbol P in the vocabulary. Only If : Let ϕ be satisfiable. Then there exists a structure A such that A = ϕ. Let D be the domain of A. Let ψ = ϕ σ. Since every structure with equality is a model of σ, therefore A is also a model of ψ. Consider the structure B that consists of the structure A extended with the binary relation E B defined as follows: E B = {(a, a) : a D}. Thus, E B is the equality relation on D. Since A is a model of ψ and the symbol E does not occur in ψ, therefore B is also a model of ψ. Finally, note that ϕ is obtained from ψ by replacing each atomic formula (x y) by E(x, y). Since and E have the same interpretation in B, therefore B is also a model of ϕ. Thus, ϕ is satisfiable. If : Now suppose ϕ is satisfiable. Let B be a structure such that B = ϕ. Then B = ϕ E σ E. Since B is a model of σ E, therefore E B is a congruence relation for the structure B. For an element a D B, we use [a] to denote the equivalence class of a with respect to E B. Formally, [a] = {a D B : (a, a ) E B }. We use B to define a structure A as follows: D A = {[a] : a D B }, and for each k-ary predicate P B in B, define a k-ary predicate P A in A such that ([a 1 ],..., [a k ]) P A iff (a 1,..., a k ) P B. Note that each predicate P A is well defined because E B is a congruence. Also note that the domain of A is the set of equivalence classes of E B. Given a binding β : V ar D B, we define the corresponding binding α : V ar D A as follows: for all x V ar, α(x) = [β(x)]. Let θ be an arbitrary formula that does not contain the symbol E. We prove, by structural induction, that A, α = θ iff B, β = θ E. We note that since the vocabulary contains only relational symbols, the only terms are variables. Basis: There are two possibilities for the smallest formula: θ = P (x 1,..., x k ). Then θ E = θ. A, α = P (x 1,..., x k ) iff (α(x 1 ),..., α(x k )) P A (Defn. of =) iff ([β(x 1 )],..., [β(x k )]) P A (Defn. of α) iff (β(x 1 ),..., β(x k )) P B (Defn. of P A ) iff B, β = P (x 1,..., x k ) (Defn. of =) θ = (x y). Then θ E = E(x, y). A, α = (x y) iff α(x) = α(y) (Defn. of = and ) iff [β(x)] = [β(y)] (Defn. of α) iff (β(x), β(y)) E B (Defn. of equivalence class) iff B, β = E(x, y) (Defn. of =) Induction Step: We need to consider the following three possibilities: 10
11 θ = (θ 1 θ 2 ). Then, A, α = (θ 1 θ 2 ) iff A, α = θ 1 and A, α = θ 2 (Semantics of ) iff B, β = θ E 1 and B, β = θ E 2 (Induction Hypothesis) iff B, β = (θ E 1 θ E 2 ) (Semantics of ) iff θ = ( θ ). Then, B, β = (θ 1 θ 2 ) E A, α = ( θ ) iff A, α = θ (Semantics of ) iff B, β = θ E (Induction Hypothesis) iff B, β = ( (θ E )) (Semantics of ) iff θ = xθ. Then, B, β = ( θ ) E A, α = xθ iff for all [a] D A, A, α[x [a]] = θ (Semantics of ) iff for all a D B, A, α[x [a]] = θ iff for all a D B, B, β[x a] = θ E (I.H. and Defn. of α) iff B, β = x(θ E ) (Semantics of ) iff B, β = ( xθ ) E Since B satisfies the sentence ϕ = ϕ E σ E, it also satisfies the sentence ϕ E. Then B, β = ϕ E for any binding β. Then, by the result above, A, α = ϕ. Since ϕ is also a sentene, by the relevance lemma, A = ϕ. Thus, ϕ is satisfiable. 8. Problem Complexity of existential-conjunctive queries of a formula ϕ. Suppose the domain D is finite and of cardinality m. We can evaluate any given assignment in time i α i. Thus an upper bound for evaluation is O (( i α i ) m n ), and this problem is in NP: guess such an assignment. That the problem is in fact NP-complete can be derived from the following theorem: Theorem 1. 3-colorability can be expressed as existential-conjunctive queries. Proof. For a graph G = (V, E) where V = n, take ϕ G = x 1... x n (v i,v j) E (R(x i, x j ). Assume ϕ G is satisfiable. Then we know there are some assignment a such that A, a = (v i,v j) E (R(x i, x j ). For each vertex v i, we assign it color x i. The fact that A, a = R(x i, x j ) for all edges ensures there are no edge with the same color. 11
12 Assume the G is 3-colorable. Take a 3-coloring and construct the assignment a. A, a = R(x i, x j ) since x i x j since it is a 3-coloring. So A = ϕ G. 9. In every group of people one can point to one person in the group such that if that person drinks then all the people in the group drink. Formulate this principle in first-order logic and prove its validity. We model different groups of people by using different values of the domain in our structures. The structure gives us a group of people, so the domain of the structure will be D = G = {a set of people}. We include one unary predicate Drinks(p) where p Drinks(p) iff the person p drinks. Thus our structure will look like A = (G, Drinks) and we can formalize the statement in FOL as follows ( p)(drinks(p) ( m)drinks(m)) To show this is valid we need to show that this formula is always true for all structures with the appropriate vocabulary. We can do this by case analysis on the predicate Drinks. Since this is the only element of our vocabulary we can exhaustively look at all structures by examining this predicate. Every structure with this vocabulary must fall into one of three cases: Drinks = In this case nobody in the group drinks. If this is the case then the formula is true since the first part of the implication will always be false. Drinks = G In this case everybody in the group drinks. If this is the case the formula will also be true since the latter part of the implication is always true. Drinks G In this case the people that drink is a proper subset of the entire group. If this is the case then there is at least one person in the group that does not drink (since the relation is a proper subset). The formula will be valid becausethere will always exist a person for which the first part of the implication is false, and thus the formula will be true. Typeset with L A TEX 2ε 12
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationHandout: Proof of the completeness theorem
MATH 457 Introduction to Mathematical Logic Spring 2016 Dr. Jason Rute Handout: Proof of the completeness theorem Gödel s Compactness Theorem 1930. For a set Γ of wffs and a wff ϕ, we have the following.
More informationLogic and Modelling. Introduction to Predicate Logic. Jörg Endrullis. VU University Amsterdam
Logic and Modelling Introduction to Predicate Logic Jörg Endrullis VU University Amsterdam Predicate Logic In propositional logic there are: propositional variables p, q, r,... that can be T or F In predicate
More information1 First-order logic. 1 Syntax of first-order logic. 2 Semantics of first-order logic. 3 First-order logic queries. 2 First-order query evaluation
Knowledge Bases and Databases Part 1: First-Order Queries Diego Calvanese Faculty of Computer Science Master of Science in Computer Science A.Y. 2007/2008 Overview of Part 1: First-order queries 1 First-order
More informationSyntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.
First-Order Logic Syntax The alphabet of a first-order language is organised into the following categories. Logical connectives:,,,,, and. Auxiliary symbols:.,,, ( and ). Variables: we assume a countable
More informationSection Summary. Section 1.5 9/9/2014
Section 1.5 Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements into Statements involving Nested Quantifiers Translated
More information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
More informationLING 501, Fall 2004: Quantification
LING 501, Fall 2004: Quantification The universal quantifier Ax is conjunctive and the existential quantifier Ex is disjunctive Suppose the domain of quantification (DQ) is {a, b}. Then: (1) Ax Px Pa &
More informationMat 243 Exam 1 Review
OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for
More informationFriendly Logics, Fall 2015, Lecture Notes 5
Friendly Logics, Fall 2015, Lecture Notes 5 Val Tannen 1 FO definability In these lecture notes we restrict attention to relational vocabularies i.e., vocabularies consisting only of relation symbols (or
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More information1 Predicates and Quantifiers
1 Predicates and Quantifiers We have seen how to represent properties of objects. For example, B(x) may represent that x is a student at Bryn Mawr College. Here B stands for is a student at Bryn Mawr College
More informationPreliminaries. Introduction to EF-games. Inexpressivity results for first-order logic. Normal forms for first-order logic
Introduction to EF-games Inexpressivity results for first-order logic Normal forms for first-order logic Algorithms and complexity for specific classes of structures General complexity bounds Preliminaries
More informationFinal Exam (100 points)
Final Exam (100 points) Honor Code: Each question is worth 10 points. There is one bonus question worth 5 points. In contrast to the homework assignments, you may not collaborate on this final exam. You
More informationExercises 1 - Solutions
Exercises 1 - Solutions SAV 2013 1 PL validity For each of the following propositional logic formulae determine whether it is valid or not. If it is valid prove it, otherwise give a counterexample. Note
More informationHerbrand Theorem, Equality, and Compactness
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Herbrand Theorem, Equality, and Compactness The Herbrand Theorem We now consider a complete method for proving the unsatisfiability of sets of first-order
More informationMotivation. CS389L: Automated Logical Reasoning. Lecture 10: Overview of First-Order Theories. Signature and Axioms of First-Order Theory
Motivation CS389L: Automated Logical Reasoning Lecture 10: Overview of First-Order Theories Işıl Dillig Last few lectures: Full first-order logic In FOL, functions/predicates are uninterpreted (i.e., structure
More informationFirst order Logic ( Predicate Logic) and Methods of Proof
First order Logic ( Predicate Logic) and Methods of Proof 1 Outline Introduction Terminology: Propositional functions; arguments; arity; universe of discourse Quantifiers Definition; using, mixing, negating
More informationThis is logically equivalent to the conjunction of the positive assertion Minimal Arithmetic and Representability
16.2. MINIMAL ARITHMETIC AND REPRESENTABILITY 207 If T is a consistent theory in the language of arithmetic, we say a set S is defined in T by D(x) if for all n, if n is in S, then D(n) is a theorem of
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition
More informationFirst Order Logic (FOL) 1 znj/dm2017
First Order Logic (FOL) 1 http://lcs.ios.ac.cn/ znj/dm2017 Naijun Zhan March 19, 2017 1 Special thanks to Profs Hanpin Wang (PKU) and Lijun Zhang (ISCAS) for their courtesy of the slides on this course.
More informationMathematics 114L Spring 2018 D.A. Martin. Mathematical Logic
Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)
More informationChapter 3. Formal Number Theory
Chapter 3. Formal Number Theory 1. An Axiom System for Peano Arithmetic (S) The language L A of Peano arithmetic has a constant 0, a unary function symbol, a binary function symbol +, binary function symbol,
More informationPredicate Logic. Predicates. Math 173 February 9, 2010
Math 173 February 9, 2010 Predicate Logic We have now seen two ways to translate English sentences into mathematical symbols. We can capture the logical form of a sentence using propositional logic: variables
More informationCS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati
CS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati Important 1. No questions about the paper will be entertained during
More informationCraig Interpolation Theorem for L!1! (or L!! )
Craig Interpolation Theorem for L!1! (or L!! ) Theorem We assume that L 1 and L 2 are vocabularies. Suppose =!, where is an L 1 -sentence and is an L 2 -sentence of L!!. Then there is an L 1 \ L 2 -sentence
More informationPeano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now
CSC 438F/2404F Notes (S. Cook) Fall, 2008 Peano Arithmetic Goals Now 1) We will introduce a standard set of axioms for the language L A. The theory generated by these axioms is denoted PA and called Peano
More informationCOMPLETENESS OF THE RANDOM GRAPH: TWO PROOFS
COMPLETENESS OF THE RANDOM GRAPH: TWO PROOFS EUGENIA FUCHS Abstract. We take a countably infinite random graph, state its axioms as a theory in first-order logic, and prove its completeness in two distinct
More informationIncomplete version for students of easllc2012 only. 6.6 The Model Existence Game 99
98 First-Order Logic 6.6 The Model Existence Game In this section we learn a new game associated with trying to construct a model for a sentence or a set of sentences. This is of fundamental importance
More informationIntroduction to first-order logic:
Introduction to first-order logic: First-order structures and languages. Terms and formulae in first-order logic. Interpretations, truth, validity, and satisfaction. Valentin Goranko DTU Informatics September
More informationPropositional and Predicate Logic - VII
Propositional and Predicate Logic - VII Petr Gregor KTIML MFF UK WS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - VII WS 2015/2016 1 / 11 Theory Validity in a theory A theory
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
More informationPredicate Calculus - Syntax
Predicate Calculus - Syntax Lila Kari University of Waterloo Predicate Calculus - Syntax CS245, Logic and Computation 1 / 26 The language L pred of Predicate Calculus - Syntax L pred, the formal language
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationThe Language. Elementary Logic. Outline. Well-Formed Formulae (wff s)
The Language Elementary Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan July 1, 2009 The following symbols are used in sentential logic Symbol Name Remark ( left parenthesis
More informationMAT 243 Test 1 SOLUTIONS, FORM A
t MAT 243 Test 1 SOLUTIONS, FORM A 1. [10 points] Rewrite the statement below in positive form (i.e., so that all negation symbols immediately precede a predicate). ( x IR)( y IR)((T (x, y) Q(x, y)) R(x,
More informationCHAPTER 2. FIRST ORDER LOGIC
CHAPTER 2. FIRST ORDER LOGIC 1. Introduction First order logic is a much richer system than sentential logic. Its interpretations include the usual structures of mathematics, and its sentences enable us
More informationComp487/587 - Boolean Formulas
Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationMathematical Logic. Reasoning in First Order Logic. Chiara Ghidini. FBK-IRST, Trento, Italy
Reasoning in First Order Logic FBK-IRST, Trento, Italy April 12, 2013 Reasoning tasks in FOL Model checking Question: Is φ true in the interpretation I with the assignment a? Answer: Yes if I = φ[a]. No
More informationMathematical Preliminaries. Sipser pages 1-28
Mathematical Preliminaries Sipser pages 1-28 Mathematical Preliminaries This course is about the fundamental capabilities and limitations of computers. It has 3 parts 1. Automata Models of computation
More informationOverview of Topics. Finite Model Theory. Finite Model Theory. Connections to Database Theory. Qing Wang
Overview of Topics Finite Model Theory Part 1: Introduction 1 What is finite model theory? 2 Connections to some areas in CS Qing Wang qing.wang@anu.edu.au Database theory Complexity theory 3 Basic definitions
More information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationSeminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)
http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product
More informationMath 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10
Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10 Inductive sets (used to define the natural numbers as a subset of R) (1) Definition: A set S R is an inductive
More informationOn the Expressive Power of Logics on Finite Models
On the Expressive Power of Logics on Finite Models Phokion G. Kolaitis Computer Science Department University of California, Santa Cruz Santa Cruz, CA 95064, USA kolaitis@cs.ucsc.edu August 1, 2003 Partially
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationExercises. Exercise Sheet 1: Propositional Logic
B Exercises Exercise Sheet 1: Propositional Logic 1. Let p stand for the proposition I bought a lottery ticket and q for I won the jackpot. Express the following as natural English sentences: (a) p (b)
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationLöwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007)
Löwenheim-Skolem Theorems, Countable Approximations, and L ω 0. Introduction David W. Kueker (Lecture Notes, Fall 2007) In its simplest form the Löwenheim-Skolem Theorem for L ω1 ω states that if σ L ω1
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
More informationExercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements.
1. Find the truth tables of each of the following compound statements. (a) ( (p q)) (p q), p q p q (p q) q p q ( (p q)) (p q) 0 0 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 1 1 1 1 0 0 1 0 (b) [p ( p q)] [( (p
More informationA GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY
A GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY Tame congruence theory is not an easy subject and it takes a considerable amount of effort to understand it. When I started this project, I believed that this
More informationAxiomatic set theory. Chapter Why axiomatic set theory?
Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its
More informationA MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ
A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ NICOLAS FORD Abstract. The goal of this paper is to present a proof of the Nullstellensatz using tools from a branch of logic called model theory. In
More informationCOMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationIntro to Logic and Proofs
Intro to Logic and Proofs Propositions A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both. Examples: It is raining today. Washington
More informationReview 3. Andreas Klappenecker
Review 3 Andreas Klappenecker Final Exam Friday, May 4, 2012, starting at 12:30pm, usual classroom Topics Topic Reading Algorithms and their Complexity Chapter 3 Logic and Proofs Chapter 1 Logic and Proofs
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationINTRODUCTION TO PREDICATE LOGIC HUTH AND RYAN 2.1, 2.2, 2.4
INTRODUCTION TO PREDICATE LOGIC HUTH AND RYAN 2.1, 2.2, 2.4 Neil D. Jones DIKU 2005 Some slides today new, some based on logic 2004 (Nils Andersen), some based on kernebegreber (NJ 2005) PREDICATE LOGIC:
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationSection 2.3: Statements Containing Multiple Quantifiers
Section 2.3: Statements Containing Multiple Quantifiers In this section, we consider statements such as there is a person in this company who is in charge of all the paperwork where more than one quantifier
More informationCSI30. Chapter 1. The Foundations: Logic and Proofs Nested Quantifiers
Chapter 1. The Foundations: Logic and Proofs 1.9-1.10 Nested Quantifiers 1 Two quantifiers are nested if one is within the scope of the other. Recall one of the examples from the previous class: x ( P(x)
More informationCSE 1400 Applied Discrete Mathematics Definitions
CSE 1400 Applied Discrete Mathematics Definitions Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Arithmetic 1 Alphabets, Strings, Languages, & Words 2 Number Systems 3 Machine
More informationUniversity of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. March 1, :00 pm Duration: 1:15 hs
University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura March 1, 2012 1:00 pm Duration: 1:15 hs Closed book, no calculators THIS MIDTERM AND ITS SOLUTION IS SUBJECT TO COPYRIGHT; NO PARTS OF
More informationExistential Second-Order Logic and Modal Logic with Quantified Accessibility Relations
Existential Second-Order Logic and Modal Logic with Quantified Accessibility Relations preprint Lauri Hella University of Tampere Antti Kuusisto University of Bremen Abstract This article investigates
More informationPropositional Logic: Syntax
Logic Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and programs) epistemic
More information15414/614 Optional Lecture 3: Predicate Logic
15414/614 Optional Lecture 3: Predicate Logic Anvesh Komuravelli 1 Why Predicate Logic? Consider the following statements. 1. Every student is younger than some instructor. 2. Not all birds can fly. Propositional
More information! Predicates! Variables! Quantifiers. ! Universal Quantifier! Existential Quantifier. ! Negating Quantifiers. ! De Morgan s Laws for Quantifiers
Sec$on Summary (K. Rosen notes for Ch. 1.4, 1.5 corrected and extended by A.Borgida)! Predicates! Variables! Quantifiers! Universal Quantifier! Existential Quantifier! Negating Quantifiers! De Morgan s
More informationMath 10850, fall 2017, University of Notre Dame
Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need
More information1 Introduction to Predicate Resolution
1 Introduction to Predicate Resolution The resolution proof system for Predicate Logic operates, as in propositional case on sets of clauses and uses a resolution rule as the only rule of inference. The
More information1 Direct Proofs Technique Outlines Example Implication Proofs Technique Outlines Examples...
CSE 311: Foundations of Computing I Proof Techniques What Is This? Each of the following is as close as we can get to giving you a template (and a completely worked out example) for every proof technique
More informationMAD 3105 PRACTICE TEST 2 SOLUTIONS
MAD 3105 PRACTICE TEST 2 SOLUTIONS 1. Let R be the relation defined below. Determine which properties, reflexive, irreflexive, symmetric, antisymmetric, transitive, the relation satisfies. Prove each answer.
More informationTheorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)
Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +
More informationFoundations of Mathematics Worksheet 2
Foundations of Mathematics Worksheet 2 L. Pedro Poitevin June 24, 2007 1. What are the atomic truth assignments on {a 1,..., a n } that satisfy: (a) The proposition p = ((a 1 a 2 ) (a 2 a 3 ) (a n 1 a
More informationBefore you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.
Chapter 2 Mathematics and Logic Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. 2.1 A Taste of Number Theory In this section, we will
More informationMACM 101 Discrete Mathematics I. Exercises on Predicates and Quantifiers. Due: Tuesday, October 13th (at the beginning of the class)
MACM 101 Discrete Mathematics I Exercises on Predicates and Quantifiers. Due: Tuesday, October 13th (at the beginning of the class) Reminder: the work you submit must be your own. Any collaboration and
More informationLogic Overview, I. and T T T T F F F T F F F F
Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical
More informationLloyd-Topor Completion and General Stable Models
Lloyd-Topor Completion and General Stable Models Vladimir Lifschitz and Fangkai Yang Department of Computer Science The University of Texas at Austin {vl,fkyang}@cs.utexas.edu Abstract. We investigate
More informationMTH 299 In Class and Recitation Problems SUMMER 2016
MTH 299 In Class and Recitation Problems SUMMER 2016 Last updated on: May 13, 2016 MTH299 - Examples CONTENTS Contents 1 Week 1 3 1.1 In Class Problems.......................................... 3 1.2 Recitation
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #4: Predicates and Quantifiers Based on materials developed by Dr. Adam Lee Topics n Predicates n
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationUniversity of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. February 9, :30 pm Duration: 1:50 hs. Closed book, no calculators
University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura February 9, 2010 11:30 pm Duration: 1:50 hs Closed book, no calculators Last name: First name: Student number: There are 5 questions and
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents
More informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationSTRATEGIES OF PROBLEM SOLVING
STRATEGIES OF PROBLEM SOLVING Second Edition Maria Nogin Department of Mathematics College of Science and Mathematics California State University, Fresno 2014 2 Chapter 1 Introduction Solving mathematical
More informationRelations to first order logic
An Introduction to Description Logic IV Relations to first order logic Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, November 6 th 2014 Marco
More informationArithmetic and Incompleteness. Will Gunther. Goals. Coding with Naturals. Logic and Incompleteness. Will Gunther. February 6, 2013
Logic February 6, 2013 Logic 1 2 3 Logic About Talk Logic Things talk Will approach from angle of computation. Will not assume very much knowledge. Will prove Gödel s Incompleteness Theorem. Will not talk
More informationCMPSCI 601: Tarski s Truth Definition Lecture 15. where
@ CMPSCI 601: Tarski s Truth Definition Lecture 15! "$#&%(') *+,-!".#/%0'!12 43 5 6 7 8:9 4; 9 9 < = 9 = or 5 6?>A@B!9 2 D for all C @B 9 CFE where ) CGE @B-HI LJKK MKK )HG if H ; C if H @ 1 > > > Fitch
More informationSolution. 1 Solutions of Homework 1. 2 Homework 2. Sangchul Lee. February 19, Problem 1.2
Solution Sangchul Lee February 19, 2018 1 Solutions of Homework 1 Problem 1.2 Let A and B be nonempty subsets of R + :: {x R : x > 0} which are bounded above. Let us define C = {xy : x A and y B} Show
More informationFor all For every For each For any There exists at least one There exists There is Some
Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following
More information3. The Logic of Quantified Statements Summary. Aaron Tan August 2017
3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationCSE 311: Foundations of Computing I Autumn 2014 Practice Final: Section X. Closed book, closed notes, no cell phones, no calculators.
CSE 311: Foundations of Computing I Autumn 014 Practice Final: Section X YY ZZ Name: UW ID: Instructions: Closed book, closed notes, no cell phones, no calculators. You have 110 minutes to complete the
More informationIntroduction to Logic in Computer Science: Autumn 2006
Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today Today s class will be an introduction
More informationHarmonious Logic: Craig s Interpolation Theorem and its Descendants. Solomon Feferman Stanford University
Harmonious Logic: Craig s Interpolation Theorem and its Descendants Solomon Feferman Stanford University http://math.stanford.edu/~feferman Interpolations Conference in Honor of William Craig 13 May 2007
More information1. Propositions: Contrapositives and Converses
Preliminaries 1 1. Propositions: Contrapositives and Converses Given two propositions P and Q, the statement If P, then Q is interpreted as the statement that if the proposition P is true, then the statement
More informationInfinite and Finite Model Theory Part II
Infinite and Finite Model Theory Part II Anuj Dawar Computer Laboratory University of Cambridge Lent 2002 3/2002 0 Finite Model Theory Finite Model Theory motivated by computational issues; relationship
More information