We learnt in class/Notes that A[x] → (Vx)A[x] is NOT atheorem if x indeed occurs free in A.Yet, I think I got a proof: First, let me use DThm and prove insteadA[a] F (Væ)A[a]:1) A[a]2) (Væ)A[x] (1 + Gen)(hуp)Something must be wrong in my "PROOF"! What EXACTLY (not toomany words please and above all don't say "it's not a theorem"!)2.

2. We learnt in class/Notes that A[x] → (Vx)A[x] is NOT a theorem if x indeed occurs free in A. Yet, I think I got a proof: First, let me use DThm and prove instead A[a] F (Væ)A[x]: A[a] 1) 2) (Væ)A[x] (1+ Gen) (hyp) Something must be wrong in my “PROOF"! What EXACTLY (not too many words please and above all don't say "it's not a theorem"!)

2. We learnt in class/Notes that A[x] → (Vx)A[x] is NOT a theorem if x indeed occurs free in A. Yet, I think I got a proof: First, let me use DThm and prove instead A[a] F (Væ)A[x]: A[a] 1) 2) (Væ)A[x] (1+ Gen) (hyp) Something must be wrong in my “PROOF"! What EXACTLY (not too many words please and above all don't say "it's not a theorem"!)

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

3.
course (discrete structure) help plz
Question For each of the following, determine whether argument is valid. You may use a counterexample or equivalence transformations to justify your answer. (a) P→ q (b) (c) קר :: 79 P→r q→r ¬(pv q) :: r P→r q→r qV¬r :: 19
Prove using the concept of interpretations and the value of a formula vI under an interpretation I that [∀x p(x) ∨ ∃x q(x)] → ∃x[p(x) ∨ q(x)] is valid.
Hello, Can you please help me with this problem because I don't understand how to do this problem can you please do it step by step and can you explain it in full detail on answer this question. Thank you.
7 (p ↔ r) → (∼q → (p ∧ r)) simplify this by propositional laws
prove the following using an equational style proof if x does not occur free in A
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 reduce the addition of two natural numbers into the corresponding result. (λz. z) (λy. y y) (λx. x a)
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).
Make a conjecture whether or not it is regular and prove your assertion. When you prove a language is not regular, use the game with demon. Do not apply Pumping Lemma directly.
Prove that the following languages are not regular using the Pumping lemma and/or closure properties. Note: Do not use other methods. a. L1 = {w ∈ {a, b}∗: na(w) + nb(w) = 3 · nb(w)} (na (w) is used to denote the number of a's in the string w) b. L2 = {anbmck: n, m, k ∈ ℕ, n < m or n < k}
4. Using the construction in the proofs of Theorem 2.3.1, construct finite automaton accepting the language (ab)* U (bc) *. Show your construction process.