How to prove a mathematical logical problem with predicates?

  • Thread starter Xamaa
  • Start date
In summary, to prove a mathematical logical problem using predicates, one should begin by clearly defining the predicates involved and the structure of the logical statements. Next, establish the axioms or premises relevant to the problem. Apply logical reasoning and rules of inference, such as universal instantiation and existential generalization, to derive conclusions from the premises. It is also essential to use proof techniques like direct proof, proof by contradiction, or proof by contrapositive as appropriate. Finally, ensure that each step in the proof is justified and that the conclusion follows logically from the premises.
  • #1
Xamaa
4
0
1 Prove that the following argument is coherent, that is, based on the premises, draw the conclusion: Every city with more than 5 million inhabitants is a metropolis. ABC is a city with more than 5 million inhabitants. There is some city that is a metropolis.

I'm trying this:

∀x (City with more than 5 million inhabitants (ABC, x) → is a metropolis (x, ABC)
(metropolis (ABC)

1.∀x (City with more than 5 million inhabitants (ABC, x) → is a metropolis premise (x, ABC)

City with more than 5 million inhabitants (ABC) premisse
(ABC) is a metropolis premisse

City with more than 5 million inhabitants (ABC) → is a metropolis S x over ABC (1)
4, (ABC) is metropolis MP(3.2)
 
Physics news on Phys.org
  • #2
A few things:
1. The form of your post is very difficult to follow. You have a 1, a 4, but no 2 or 3. You have things labeled as premises in very odd (and likely incorrect) ways. I would lay out everything a little more cleanly than this if I were you.
2. This looks like a homework problem. I'll ping a mentor to get it moved into the homework section.
3. For problems where you have quantifiers with no free variables along with specific instantiations, you're going to need to do introduction and elimination of quantifiers at some point in your argument.
 
  • #3
I cant remember the exact syntax rules but I think you have to use contradiction to prove these. It will go like this:

1. Premise: ForAll x If x pop > 5mill then x is a metro
2. Premise: ThereExist y such that pop y > 5mill
3. ASSUME: Not Exists z such that z is a metro
4. From 3 therefore, For All z z is not a metro
5. From 3,1 For all z, z <= 5mill
6. From 5,2 Contradiction
7. Therefore NOT 3

This is a box proof where you make an assumption and show it leads to a contradiction.
 
  • #4
Kavi said:
I cant remember the exact syntax rules but I think you have to use contradiction to prove these. It will go like this:

1. Premise: ForAll x If x pop > 5mill then x is a metro
2. Premise: ThereExist y such that pop y > 5mill
3. ASSUME: Not Exists z such that z is a metro
4. From 3 therefore, For All z z is not a metro
5. From 3,1 For all z, z <= 5mill
6. From 5,2 Contradiction
7. Therefore NOT 3

This is a box proof where you make an assumption and show it leads to a contradiction.
You definitely don't need to assume a contradiction. Also, 2 is not a premise. 2 can be derived from the premise "ABC is a city with more than 5 million inhabitants" by using existential introduction:
##P(a)\vdash\exists x P(x)##
but this is also not necessary in the proof.
 
  • Like
Likes Xamaa
  • #5
TeethWhitener said:
You definitely don't need to assume a contradiction. Also, 2 is not a premise. 2 can be derived from the premise "ABC is a city with more than 5 million inhabitants" by using existential introduction:
##P(a)\vdash\exists x P(x)##
but this is also not necessary in the proof.

It was a long time since I studied this but from the OPs wording

PREMISE1: Every city with more than 5 million inhabitants is a metropolis.
PREMISE2: ABC is a city with more than 5 million inhabitants.
CONCLUSION: There is some city that is a metropolis.


(Edit: Ok I understand, I think I maybe missed a formal step, I just took 2. as a premise instead of deriving it from the rule you posted but as I mentioned I cant remember all the exact details)

I still think it must be proven by contradiction but i cant remember for sure...
 
  • #6
Thanks guys for your precious time, the query has been solved now. Really Appreciated.... .
 
  • #7
IIRC, you need to use instantiation, as used in FOL.
 
  • Like
Likes TeethWhitener

FAQ: How to prove a mathematical logical problem with predicates?

What is a predicate in mathematical logic?

A predicate in mathematical logic is a function that takes one or more arguments and returns a true or false value. Predicates are used to express properties of objects or relationships between objects within a domain of discourse.

How do you symbolize a predicate in logical notation?

A predicate is usually symbolized by a capital letter followed by its arguments in parentheses. For example, P(x) could denote a predicate P with a single argument x, and R(x, y) could denote a predicate R with two arguments x and y.

What are the steps to prove a mathematical logical problem using predicates?

The steps to prove a mathematical logical problem using predicates typically include: (1) identifying the predicates and variables involved, (2) expressing the problem in formal logical notation, (3) using logical rules and axioms to manipulate the expressions, and (4) deriving the conclusion from the premises through a sequence of valid logical steps.

What are some common logical rules used in predicate logic proofs?

Some common logical rules used in predicate logic proofs include universal instantiation, existential instantiation, universal generalization, existential generalization, modus ponens, modus tollens, and the rules of conjunction, disjunction, and negation.

Can you give an example of a simple proof using predicates?

Sure! Let's prove that if all humans are mortal and Socrates is a human, then Socrates is mortal. Let H(x) denote "x is a human" and M(x) denote "x is mortal". The premises are: (1) ∀x (H(x) → M(x)) and (2) H(Socrates). To prove: M(Socrates). By universal instantiation on premise (1), we get H(Socrates) → M(Socrates). Given premise (2) H(Socrates), we can apply modus ponens to conclude M(Socrates).

Back
Top