1. Consider the formula A = (Vx pi(x, a1)) → (3y (p2(y) p3(y, a2)) ^ (a) Create a formula tree for A. (b) Give two examples of interpretations for A. (c) Determine the truth value of A under the interpretation 9 = (Z, {≥, prime(), <}, {0,2}), where prime() is the relation that determines whether its argument is a prime number, i.e. the relation prime(r) is satisfied if and only if x is prime.

1. Consider the formula A = (Vx pi(x, a1)) → (3y (p2(y) p3(y, a2)) ^ (a) Create a formula tree for A. (b) Give two examples of interpretations for A. (c) Determine the truth value of A under the interpretation 9 = (Z, {≥, prime(), <}, {0,2}), where prime() is the relation that determines whether its argument is a prime number, i.e. the relation prime(r) is satisfied if and only if x is prime.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider F = {BC -> D, B -> E, CE -> D, E -> CA, BF -> G} and R(A,B,C,D,E,F,G) 1.Find a minimal cover for F. 2.Find all many keys for R.
Computer Science Suppose L ⊆{a, b}∗ is defined as follows: Λ∈L; for every x and y in L, the strings axb, bxa, and x yare in L. Show that L =AEqB , the language of all strings x in {a, b}∗ satisfying n_a (x) =n_b (x).
Reduce the following lambda calculus terms to the normal form. Show all intermediate steps, with one beta reduction at a time. In the reduction, if necessary, assume that you are supplied with extra rules that allow you to rehice the additLion of two natural mumbers into the corresponding result. (Az. 2) (Ny. y y) (\x. z a).
The format P(X) represents as a power set of given "X", (of all X's subsets) Now, assume there are two sets A= {q, w, e, r} and B = {w, r, f}. (a) What are the elements of P(A) ∩P(B )?(b) What is the cardinality of P(A ∪B )?(c) What is |P(A) ∪P(B )|?