Can You Prove These Hypotheses in Predicate Calculus?

  • Context: Graduate 
  • Thread starter Thread starter stauros
  • Start date Start date
  • Tags Tags
    Calculus Proof
Click For Summary

Discussion Overview

The discussion revolves around proving hypotheses in predicate calculus, focusing on the formal structure and requirements of such proofs. Participants explore the implications of given hypotheses and the strategies for constructing proofs based on those premises.

Discussion Character

  • Technical explanation
  • Mathematical reasoning
  • Homework-related

Main Points Raised

  • Participants present a set of hypotheses involving constants, one-place operation symbols, and two-place predicate symbols, and seek to prove specific statements based on these hypotheses.
  • One participant suggests a strategy of letting B = P(A) to simplify the proof process.
  • Another participant emphasizes the need for rigorous justification in each step of the proof, referencing the role of the hypothesis ∀A(G(A,A)).
  • There is mention of four general laws of predicate calculus that are necessary for constructing the proofs: Universal Elimination, Universal Introduction, Existential Elimination, and Existential Introduction.
  • One participant expresses concern about inconsistent notation in the proofs presented, indicating that clarity is needed before further assistance can be provided.
  • Another participant questions the familiarity of others with predicate calculus, indicating a potential gap in understanding among participants.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the proofs, as there are differing views on the clarity of notation and the approach to the proofs. Some participants assert that the proofs are simple, while others express uncertainty about the formal requirements.

Contextual Notes

There are indications of missing assumptions and the need for clearer notation, which may affect the ability to construct the proofs accurately. The discussion also reflects varying levels of familiarity with predicate calculus among participants.

Who May Find This Useful

This discussion may be useful for individuals interested in formal logic, particularly those studying predicate calculus and seeking to understand proof construction and the nuances of formal reasoning.

stauros
Messages
35
Reaction score
0
Given :

a)

1) c is a constant

2) P and K are one place operation symbols

3) G and H are a two place predicate symbols

b)

The following hypothesis

1)for all A { G(A,A) }

2) for all A,B { H(A,c) =>( G[P(A),B] <=> ( G[K(B),A] and H(B,c)))}

Then prove :

1) for all A { H(A,c) => G[K(P(A),A] }

2) for all A { H(A,c) => H( P(A),c) }
 
Physics news on Phys.org
How you formally work this through depends on what system you're asked to work with, but a strategy would be to let B=P(A).
 
Thanks dcpo .So i put B=P(A) in 2 and i get :

{ H(A,c) =>( G[P(A),P(A)] <=> ( G[K(P(A)),A] and H(P(A),c)))}
is that correct?

The proof is in predicate calculus ,so every line of the proof has to be accounted for and justified
 
Well, what you need to say depends on how formal you have to be, and on what deduction system you have to use, but what you have is the basis for a rigorous 'everyday' proof, so long as you make explicit the role of the \forall A(G(A,A)) hypothesis. If you haven't been given an explicit formal deduction system to work with that should be enough.
 
The proof as i said is an ordinary proof in predicate calculus with the usal 4 general laws i.e

1) Universal Elimination
2) Universal Introduction
3) Existential Elimination
4) Existential Introduction

Plus the rules of statement calculus
 
stauros said:
Given :

a)
1) c is a constant
2) P and K are one place operation symbols
3) G and H are a two place predicate symbols

b)
The following hypothesis
1)for all A { G(A,A) }
2) for all A,B { H(A,c) =>( G[P(A),B] <=> ( G[K(B),A] and H(B,c)))}

Then prove :

1) for all A { H(A,c) => G[K(P(A),A] }
2) for all A { H(A,c) => H( P(A),c) }

Well, we ain't supposed to be doing homework problems here, but the proofs are extremely simple.

for proof 1: Your notation is inconsistent, so can't help until you clean that up.

for proof 2: \forall A (H(A,c) \Rightarrow H(P(A),c))
Assuming A, H(A,c), and P(A) exist immediately gives result H(P(A),c) from b 1 and 2.
 
pridicate said:
Well, we ain't supposed to be doing homework problems here, but the proofs are extremely simple.

for proof 1: Your notation is inconsistent, so can't help until you clean that up.

for proof 2: \forall A (H(A,c) \Rightarrow H(P(A),c))
Assuming A, H(A,c), and P(A) exist immediately gives result H(P(A),c) from b 1 and 2.

Sorry to ask but do you know how a proof is done in predicate calculus?

I mean have you done any predicate calculus?
 
stauros said:
Sorry to ask but do you know how a proof is done in predicate calculus?

I mean have you done any predicate calculus?

Um yeah ...
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K