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

Explain conditions under which a deadlock situation arise, What are conditi...

What are conditions under which a deadlock situation may arise? A deadlock situation can arise if the following four conditions hold concurrently in a system:  a. Mutual exc

Define buffering, Define buffering.  A buffer is a memory area that kee...

Define buffering.  A buffer is a memory area that keeps data while they are transferred among two devices or among a device and an application. Buffering is done for three reas

State the web server security through ssl, Web server security through SSL ...

Web server security through SSL (Secure Socket Layer) As it is well known that the Intranets and internet are purely based on use of powerful web servers to deliver information

What is secondary storage systems, There are various limitations of primary...

There are various limitations of primary memory like limited capacity which is its not enough to store a very large volume of data and volatility which is when power is turned off

Difference between the fork -join and begin-end, Difference between the for...

Difference between the fork -join and begin-end. The fork - join keywords: Groups several statements together.Cause statements to be evaluated in parallel (all at the same

Explain with the help of examples fifo algorithms, Explain with the help of...

Explain with the help of examples FIFO algorithms? FIFO policy: This policy easy removes pages in the order they arrived into the main memory. By using this policy we easily

Describe about general-purpose microprocessor, Q. Describe about general-pu...

Q. Describe about general-purpose microprocessor? Keeping rapidity with electronics as more and more components were fabricated on a single chip fewer chips were required to ma

Face scanning security system - biometric, Face Scanning Security System - ...

Face Scanning Security System - Biometric Computer Security Systems Finally, face scanning security system are also one of biometric technologies. Generally, the principle of

Why does dma have priority over the cpu, Why does DMA have priority over th...

Why does DMA have priority over the CPU when both request a memory transfer? The data transfer monitored by DMA controller which is called as DMA channel. The CPU is included o

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