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

Process of world wide web, Q. Process of World Wide Web? When you type ...

Q. Process of World Wide Web? When you type a URL in a web browser, this is what happens: 1. If URL contains a domain name, browser first connects to a domain name server an

What is an compiled languages, What is an compiled languages In compile...

What is an compiled languages In compiled languages the instructions into machine code and kept them  in a separate file for later implementation. Many modern compilers can com

Flowchart, How to calculate the flowchart

How to calculate the flowchart

Mini project, give proper code for any kind of project in oop c++

give proper code for any kind of project in oop c++

Assessing heuristic searches-artificial intelligence, Assessing Heuristic S...

Assessing Heuristic Searches Given a specific problem you want to create an agent to solve, there can be more than one way of specifying it as a search problem, more than one o

Transition management system, please help me with psudocode for schedule ma...

please help me with psudocode for schedule management which contains stakeholder and application table

Meaning of all variable, A project having of a set of jobs and a set of pre...

A project having of a set of jobs and a set of precedences, where precedence (i; j) show that job j cannot begin before job i is completed. Let c i be the duration of job i. We wi

What are sequential algorithms, What are Sequential Algorithms? The cen...

What are Sequential Algorithms? The central assumption of the RAM model is that instructions are implemented one after   another, one operation at a time. Accordingly, algorith

Predicate logic - artificial intelligence, Translate the following sentence...

Translate the following sentences into predicate logic, using Russell's theory of definite descriptions to represent the article the. a. The wizzard of Oz fell. b. Everyone a

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