Existential introduction, Computer Engineering

Assignment Help:

Existential Introduction:

Now if we have any sentence as, A, and variable, v, that does not occur in A, so then for any ground term, g, such occurs in A, than we can turn A into an existentially quantified sentence by substituting v for g as: 

∃A /v Subst({g/v}, A)

So now we have for example like, if we know  likes(jerry, ice_cream), so then we can infer that  ?X (likes(X, ice_cream)), just because the constant jerry doesn't appear anywhere else in the original sentence. Thus the conditions v and g don't occur in A is for similar reasons as those given for the before this rule. Now as an exercise, here find a situation when ignoring this condition would mean the inferred sentence did not follow logically from the premise sentence.

 


Related Discussions:- Existential introduction

Define access time for magnetic disk, Define access time for magnetic disk....

Define access time for magnetic disk. The sum of seek time and rotational delay is known as access time for disks. Normal 0 false false false EN-IN

Define class p, Define class P  The class of all sets L that can be kno...

Define class P  The class of all sets L that can be known in polynomial time by deterministic TM. The class of all decision problems that can be decided in polynomial time.

What is command prompt interface, Q. What is Command Prompt Interface? ...

Q. What is Command Prompt Interface? Operating System gives a text based interface called command prompt.  With the help of command prompt commands can be issued to perform fil

Illustrate design of combinational circuits, The digital circuits that we u...

The digital circuits that we use now-a-days are constructed with NOR or NAND gates in place of AND-OR-NOT gates. NOR & NAND gates are known as Universal Gates as we can realize any

Draw the logic circuit of a 3 line to 8 line decoder, What is a decoder? Dr...

What is a decoder? Draw the logic circuit of a 3 line to 8 line decoder and explain its working. Ans. Decoder: it is a combinational logic circuit which converts Binary words

Eme, state function and path function

state function and path function

Logic diagrams for same boolean expression, Q. Logic diagrams for same Bool...

Q. Logic diagrams for same Boolean expression? The expression F can be simplified using Boolean algebra. The logic diagram of simplified expression is drawn in fig (b)

What are the different types of computer networks, Q. Mention different cla...

Q. Mention different classes of computer networks (on the basis of scale) and distinguish one from the other. Ans: Local Area Network (LAN) Metropolitan Area Netw

What is the linkage section, The linkage section is part of a known as prog...

The linkage section is part of a known as program that 'links' or maps to data items in the calling program are working storage. It is the part of the called program where these sh

Expalin johnson counter, Write short note on the Johnson counter. Ans:...

Write short note on the Johnson counter. Ans:  Johnson Counter: It is a synchronous counter, where all flip-flops are clocked concurrently and the clock pulses drive the

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd