kenneth h rosen chapter 1 section section 1.5 nested quatnifiers excercise 49
in Mathematical Logic
19 views
0 votes
0 votes
 
49. a) Show that ∀xP (x) ∧ ∃xQ(x) is logically equivalent
to ∀x∃y (P (x) ∧ Q(y)), where all quantifiers have
the same nonempty domain.
b) Show that ∀xP (x) ∨ ∃xQ(x) is equivalent to ∀x∃y
(P (x) ∨ Q(y)), where all quantifiers have the same
nonempty domain.

 

please anybody tell how to prove this logical equivalency ?
in Mathematical Logic
by
103 points
19 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.