MHB Intro to Logic (prove sequents)

  • Thread starter Thread starter kk12
  • Start date Start date
  • Tags Tags
    Intro Logic
AI Thread Summary
The discussion focuses on proving specific logical sequents, with participants expressing difficulty in starting the proofs. The first sequent involves demonstrating the relationship between existential and universal quantifiers. The second sequent requires proving the negation of an existential statement based on a universal condition. The third sequent connects the existence of a property with its implication to another property. Overall, the thread emphasizes the challenges of understanding and applying logical proofs in formal logic.
kk12
Messages
1
Reaction score
0
I am stuck on these questions and don't really know how to start/solve them.
prove the following sequent:
1. $(\exists x) Fx \to (\forall x) Gx \vdash (\exists x)(Fx \to (\forall x)Gx)$

2. $(\forall x)(Fx \to (\forall y)\neg Fy) \vdash \neg(\exists x)Fx$

3. $(\exists x)Fx, (\forall x)(Fx \; à \; Gx) \vdash (\exists x)G$
 
Physics news on Phys.org
See this https://driven2services.com/staging/mh/index.php?threads/29/.
 
I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Replies
1
Views
1K
Replies
6
Views
1K
Replies
1
Views
1K
Replies
3
Views
2K
Replies
3
Views
5K
Replies
2
Views
2K
Replies
1
Views
1K
Back
Top