Existential introduction, Computer Engineering

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.

 

Posted Date: 1/11/2013 6:03:51 AM | Location : United States







Related Discussions:- Existential introduction, Assignment Help, Ask Question on Existential introduction, Get Answer, Expert's Help, Existential introduction Discussions

Write discussion on Existential introduction
Your posts are moderated
Related Questions
data dictionary for online banking system in software engineering

What is a Diagonalization language LD?  The  diagonalization  language  having  of  all  strings  w  such  that  the  TM  whose  code is w does not accept when w is given as in

hidden edge/surface removal

Interval between the time of submission and completion of the job is? Ans. Turnaround time is the interval in between the time of submission and completion  of the job.

In general what are the two ways in which one can retrieve data from tables? Using Select statements, Database Program.

Define the types Programmable logic devices? There are mostly three types PLDs. These are vary in the placement of fuses in the AND- OR array. 1. ROM- It has fixed AND array

How do you turn off cookies for single page in your site? We can turn off the cookies for one page:- By setting the Cookie. Discard property false.

What is C++ reference and JAVA final? Association ends must be bound at initialization and cannot be altered. C++ references can fully enforce these semantics, and the JAVA fin

In this technique, operand field of instruction includes an address and an index register thatcomprises an offset. This addressing scheme is normally used to address the consecutiv

Write a short note on structure chart.    Structure Chart is an significant program design method and it shows all components of code in a hierarchical format