Problem in Logic - Hilbert Systems

Click For Summary
SUMMARY

The discussion centers on proving the formula \(\phi[x|m] \rightarrow \forall y((y=m) \rightarrow \phi[x|y])\) within a Hilbert System, where \(\phi\) is a formula, \(y\) and \(x\) are variables, and \(m\) is a constant. The user attempts to apply the Deduction Theorem and Modus Ponens but struggles to incorporate the universal quantifier \(\forall y\) due to \(y\) being free in the formula. Suggestions are sought for both completing the proof and improving the alignment of equations in TeX.

PREREQUISITES
  • Understanding of Hilbert Systems and their axioms
  • Familiarity with logical proofs and the Deduction Theorem
  • Knowledge of Modus Ponens and substitution of equal variables
  • Basic proficiency in TeX for typesetting mathematical equations
NEXT STEPS
  • Research the application of the Universal Quantifier in Hilbert Systems
  • Study Godel's diagonal lemma and its implications in formal logic
  • Explore advanced techniques for equation alignment in TeX
  • Examine alternative proof strategies in formal logic
USEFUL FOR

Students of mathematical logic, particularly those studying Hilbert Systems, as well as educators and researchers looking to deepen their understanding of formal proofs and TeX typesetting.

andrewkirk
Science Advisor
Homework Helper
Insights Author
Gold Member
Messages
4,140
Reaction score
1,741

Homework Statement


In a Hilbert System, prove:
\phi[x|m] \rightarrow\forall y((y=m)\rightarrow\phi[x|y])
where \phi is a formula, y, x are variables and m is a constant.
\phi[a|b] denotes the formula obtained by substituting b for a in \phi
This problem crops up in my attempting to prove Godel's diagonal lemma (aka 'Fixed Point Theorem').

Homework Equations


The axioms of a Hilbert system are standard, as set out in http://en.wikipedia.org/wiki/Hilbert_system

The Attempt at a Solution


\begin{align}
\phi[x|m]\ \ \ \ \ \ \text{1. Hypothesis}\\
y=m\ \ \ \ \ \ \text{2. Hypothesis}\\
(y=m)\rightarrow(\phi[x|m]\rightarrow\phi[x|y))\ \ \ \ \ \ \text{3. Axiom Schema 6 (substitution of equal variables)}\\
\phi[x|m]\rightarrow\phi[x|y]))\ \ \ \ \ \ \text{4. Modus Ponens applied to 2 and 3}\\
\phi[x|y]\ \ \ \ \ \ \text{5. Modus Ponens applied to 1 and 4}\\
(y=m)\rightarrow\phi[x|y]\ \ \ \ \ \ \text{6. Deduction Theorem applied to 2 and 5)}\\
\phi[x|m]\rightarrow((y=m)\rightarrow\phi[x|y])\ \ \ \ \ \ \text{7. Deduction Theorem applied to 1 and 6)}\\
\end{align}
This is almost what's required, except it's missing the universal quantifier \forall y and I can't use Axiom Schema 4 of Generalisation to add it because y is free in this formula.
I tried a different approach that gave me the quantifier where I needed it, but it didn't have the right form.

Any suggestions gratefully received.

PS the equations are horribly aligned. Any suggestions about how to better align them in TeX would be appreciated too.
 
Last edited:

Similar threads

Replies
8
Views
2K
  • · Replies 43 ·
2
Replies
43
Views
5K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 26 ·
Replies
26
Views
1K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 0 ·
Replies
0
Views
3K