Prove the Validity of Euclid's Elements

In summary, the conversation discusses various assumptions and premises related to mathematical operations and predicates. The main focus is on proving a statement involving the application of these operations and predicates. The conversation also touches on the concept of proof and its changing nature over time. The importance and relevance of the problem is questioned, as it may just be a manipulation of symbols without any deeper insight into logic. Mention is made of Euclid's "Elements" and the lost book "Pseudaria" which was considered to be the first proof checker in human history.
  • #1
solakis1
422
0
Let:

1) m be a constant

2) P ,K be one place operation symbols

3) F be two places operation symbol4) H,G be two places predicate symbols
Let, the following assumptions:1) $\forall A\forall B [ H(A,m)\Longrightarrow G[P(A),B]\Longleftrightarrow G[K(B),A]\wedge H(B,m)]$2) $\forall A\forall B[ H(A,m)\wedge H(B,m)\Longrightarrow H(F(A,B),m)]$

3)$\forall A\forall B\forall C\forall D[ G[A,B]\wedge G[C,D]\Longrightarrow G[F(A,C),F(B,D)]]$

4)$\forall A\forall B [ G[F(K(P(A)),K(P(B))),K(F(P(A),P(B)))]]$

5)$\forall A\forall B\forall C [ G[A,B]\wedge G[A,C]\Longrightarrow G[B,C]]$

6) $\forall A [ G(A,A) ]$

Then prove :

$\forall A\forall B [ H(A,m)\wedge H(B,m)\Longrightarrow G[ P(F(A,B)),F(P(A),P(B))]]$
 
Physics news on Phys.org
  • #2
In premise (1), is it

H(A,m) => (G[P(A),B] <=> G[K(B),A] /\ H(B,m))

or

(H(A,m) => G[P(A),B]) <=> G[K(B),A] /\ H(B,m)?

Also, this is a metamathematical question, but why is this problem interesting? Without knowing the semantics of P, K, F, H and G, it's just some manipulation of symbols. I am not sure how it gives any additional insight into logic.
 
  • #3
Evgeny.Makarov said:
In premise (1), is it

H(A,m) => (G[P(A),B] <=> G[K(B),A] /\ H(B,m))

or

(H(A,m) => G[P(A),B]) <=> G[K(B),A] /\ H(B,m)?

Also, this is a metamathematical question, but why is this problem interesting? Without knowing the semantics of P, K, F, H and G, it's just some manipulation of symbols. I am not sure how it gives any additional insight into logic.
It is : H(A,m) => (G[P(A),B] <=> G[K(B),A] /\ H(B,m))

Well is it not every mathematical proof a manipulation of symbols??
 
  • #4
solakis said:
It is : H(A,m) => (G[P(A),B] <=> G[K(B),A] /\ H(B,m))

Well is it not every mathematical proof a manipulation of symbols??

Actually no, this is a fiction foisted on us by certain philosophies of mathematics.

A proof is an argument that convinces mathematicians. What counts as proof changes with time and context.

CB
 
  • #5
CaptainBlack said:
.

A proof is an argument that convinces mathematicians.

CB
How ??
 
  • #6
solakis said:
How ??

How is anyone convinced of anything. Look at Euclid, it is full of "proofs" that were considered convincing for over 2000 years.

CB
 
  • #7
CaptainBlack said:
How is anyone convinced of anything.

Not of anything ,but of a mathematical argument.

Anyway that is what i asked you
CaptainBlack said:
Look at Euclid, it is full of "proofs" that were considered convincing for over 2000 years.

CB

Euclid along with his "elements " wrote a book called "Pseudaria".

The contents and the magnitude of its validity can be found in Proclus,p.70,1- 18

The book is considered to be the 1st proof checker in human history (at least for the Geometrical theorems,that is).

Unfortunately the book was irreparably lost.
 

FAQ: Prove the Validity of Euclid's Elements

What is predicate calculus 2?

Predicate calculus 2 is a logical system used to reason about the truth or falsity of statements, using quantifiers and variables to express relationships between objects.

How is proof in predicate calculus 2 different from other forms of logic?

Proof in predicate calculus 2 follows a specific set of rules and symbols, including quantifiers and variables, to derive conclusions from given premises. It is often used in mathematical and computer science applications.

What are the basic components of a proof in predicate calculus 2?

The basic components of a proof in predicate calculus 2 include axioms, rules of inference, and logical equivalences. Axioms are statements that are assumed to be true, rules of inference are used to derive new statements from existing ones, and logical equivalences are used to show that two statements are equivalent.

How are quantifiers used in predicate calculus 2?

Quantifiers, such as "for all" (∀) and "there exists" (∃), are used to express statements about all or some objects in a given domain. They are essential in expressing relationships between variables and making universal or existential claims.

What are some common strategies for proving statements in predicate calculus 2?

Some common strategies for proving statements in predicate calculus 2 include using universal instantiation (replacing a variable with a specific object), modus ponens (using a conditional statement and its antecedent to infer the consequent), and proof by contradiction (assuming the opposite of what is to be proven and showing it leads to a contradiction).

Similar threads

Replies
1
Views
1K
Replies
1
Views
1K
Replies
2
Views
2K
Replies
1
Views
1K
Replies
1
Views
2K
Replies
11
Views
3K
Replies
10
Views
2K
Replies
1
Views
1K
Back
Top