q. (A (BC)), ~B (FvG), (G·~H) (DB), (A~C) v H, (~H•~F) / ~D Construct proofs for the following more challenging problems, justifying each step that is not a premise. b. (BVC)A, A (S v T), B. ~S, (TA)(WS) /~W d. (AB) (CƆ D), (FA) (AB), A (FA), A·C / DvF i.(~ Pv~Q) (~R~S), (PT), (~WƆ(~T•~Z)), (~SZ) ·~(X •Y), (~Wv(XY)) / (~R•~W)

q. (A (BC)), ~B (FvG), (G·~H) (DB), (A~C) v H, (~H•~F) / ~D Construct proofs for the following more challenging problems, justifying each step that is not a premise. b. (BVC)A, A (S v T), B. ~S, (TA)(WS) /~W d. (AB) (CƆ D), (FA) (AB), A (FA), A·C / DvF i.(~ Pv~Q) (~R~S), (PT), (~WƆ(~T•~Z)), (~SZ) ·~(X •Y), (~Wv(XY)) / (~R•~W)

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

4. For each of the following propositional formulae, use the laws of propositional logic to prove it is either a tautology or contradiction. a. ((¬p→q)∧(¬p→¬q))→p((¬p→q)∧(¬p→¬q))→p b. ((p∧q)∨¬(¬p∨r))∧¬p
Prove that there are no solutions in positive integers x and y to the equation ?3 + ?3 = 125 (Hint: Use proof by cases and, if useful, WLOG.)
In "Computing Machines and Intelligence," the English mathematician Alan Turing (1912-1954) wrote, "If each man had a definite set of rules of conduct by which he regulated his life, he would be a machine, but there are no such rules, so men cannot be machines." Using what you now know about Logic, determine whether this statement make sense and explain. Construct a truth table for Turing's statement and determine if this statement is a tautology.
4. Look up the Pythagorean theorem if you are not already familiar with it. Use the following formula to solve for c in the formula: c = √a2 + b2. Use the proper functions from the cmath header file. Be sure to output the result..
1. a) Solve the following system of linear equations using Gaussian Elimination with Back Substitution. 2x1 + x2 + 2x3 = 5 x1 + 4x2 + 3x3 = 1 3x1 +2x2 +5x3 =3 b) Write a matlab code (function/script) for the ’Naive’ Gaussian Elimination Method with back substitution (i.e without partial pivoting) c) Use your code in question (1b) above to answer the question 1a)
A) Prove with Boolean Algebra the consensus theorem: x * y + x’ * z + y * z = x * y + x’ * zGive a reason for each step in your proof. B) Show the dual proof of part (A).
CONSTRUCT THE TRUTH TABLE OF THE FOLLOWING PROPOSITIONS. 1. (p Λ ~r) → q
Determine if the following formula is a tautology, contradiction, or neither. Show work. (p∧q)⟷(¬p∨¬q)
(3a) Compute the stability function S of the Rosenbrock method (108), that is, compute the (rational) function S(z), such that y1 = S(z)y0, z ∶= hλ, when we apply the method to perform one step of size h, starting from y0, of the linear scalar model ODE y˙ = λy, λ ∈ C
Prove that the following compound propositions are logically equivalent by using the laws of propositional logic. You do not need to indicate the name of the law used in each step of the proof. 1. ¬ (? ∨ ?) ∧ (? ∨ ?) and ¬? ∧ ¬? ∧ ?
2. Heat conduction in a square plate Three sides of a rectangular plate (@ = 5 m, b = 4 m) are kept at a temperature of 0 C and one side is kept at a temperature C, as shown in the figure. Determine and plot the ; temperature distribution T(x, y) in the plate. The temperature distribution, T(x, y) in the plate can be determined by solving the two-dimensional heat equation. For the given boundary conditions T(x, y) can be expressed analytically by a Fourier series (Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley and Sons, 1993):
TROUBLESHOOTING: Fix the errors in the code below MATLAB function [x,numIter,omega] = gaussSeidel(func,x,maxIter,epsilon) % Solves Ax = b by Gauss-Seidel method with relaxation. % USAGE: [x,numIter,omega] = gaussSeidel(func,x,maxIter,epsilon) % INPUT: % func = handle of function that returns improved x using % x = starting solution vector % maxIter = allowable number of iterations (default is 500) % epsilon = error tolerance (default is 1.0e-9) % OUTPUT: % x = solution vector % numIter = number of iterations carried out % omega = computed relaxation factor if nargin < 4; epsilon = 1.0e-9; end if nargin < 3; maxIter = 500; end k = 10; p = 1; omega = 1; for numIter = 1:maxIter xOld = x; x = feval(func,x,omega); dx = sqrt(dot(x - xOld,x - xOld)); if dx < epsilon; return; end if numIter == k; dx1 = dx; end if numIter == k + p omega = 2/(1 + sqrt(1 - (dx/dx1)ˆ(1/p))); end end error(’Too many iterations’)