Questions tagged [proof]

For questions about the correctness of a proof or the nature of proofs in general.

Filter by
Sorted by
Tagged with
-1
votes
2answers
60 views

Is there any proof of assertion that “assertion can be proved”?

Here's some reason to doubt any proof: Dissent – The uncertainty demonstrated by the differences of opinions among philosophers and people in general. Progress ad infinitum – All proof rests on ...
2
votes
1answer
58 views

Soundness and Completeness of Tableaux

Tableaux to my knowledge are both sound and complete. The statement: "If P is valid then tableau for -P eventually closes". Does this statement prove that tableau is sound and complete or ...
0
votes
0answers
32 views

Is the included derivation feasible? If so, would my proof be correct?

The simple derivation seems correct and intuitive, and yet I feel as if something is off. I would greatly appreciate it if someone could double-check the provided formal proof. Thank you in advance ...
-1
votes
1answer
106 views

How do philosophers answer a question like 'How do you know something exists?'

I recently watched a video from Rationality Rules titled "The Argument from Personal Experience - Debunked (Why Personal Experiences are NOT Proof)". As the title reveals, the video's goal ...
-1
votes
2answers
175 views

How would an philosopher and scientist solve the following kidnapping - scenario?

I would like to hear your opinion as philosophers and scientists regarding how you would solve the problem of proof in the following scenario: "Plato" who has dementia and a damaged left ...
-1
votes
0answers
21 views

Proving (P → Q) ↔ ¬ (P ∧ ¬ Q) in Fitch with no premise [duplicate]

I am struggling with this one for days and keep getting stumped |_ | |_ P → Q | | |_ P ∧ ¬Q | | | : | | | # | | ¬(P & -Q) | (P → Q) → ¬(P ∧ -Q) | |_ ¬(P ∧ ¬Q) | | |_ P | | | : | ...
0
votes
1answer
24 views

Rudimentary Proof in SL

So I'm currently being introduced to SL and asked to prove a statement. A simple question with the premise L & W and L ⇒ ¬ F. I am asked to prove W & ¬ F. Could someone verify my solution? So ...
-1
votes
2answers
55 views

Prove that the following is a logical truth (tautology) using a natural deduction derivation: (B → C) ˅ (¬B → C) [closed]

Prove that the following is a logical truth (tautology) using a natural deduction derivation: (B → C) ˅ (¬B → C) How do I prove this using statement logic? I know I need to start with a supposition ...
1
vote
2answers
115 views

What is the difference between these two types of proofs?

While employing induction method for proving, is deriving the string(formula) "Fn → Fn+1 " any different from showing that if Fn holds true, then so does Fn+1 ? By showing I mean that we use ...
0
votes
1answer
67 views

Functional Abbreviation for Inst Expression in Turing's Paper [closed]

In Turing's 1936 paper On Computable Numbers Page 30-31, and its Correction Page 1-2 For a Turing Machine M, Inst(i,j,k,LEFT,l) means that if M scans symbol j under m-configuration i, then the symbol ...
0
votes
1answer
61 views

How does one prove (A->B)vC from the premise ~A? [closed]

Is the premise really enough to prove this?
-1
votes
1answer
64 views

How to prove the following arguments [closed]

I'm trying to do a bunch of proofs to get better at them but it seems like I need some help with negation. Can anyone who has time prove the following arguments? I would really appreciate it! ¬(P ∧ ¬Q)...
-2
votes
1answer
38 views

Validity of the Definiton of the Conditional [closed]

Can a proof for Premise (P→Q) ... Goal (¬P∨Q) be derived using only the following rules? Conjunction Introduction Conjunction Elimination Left Conjunction Elimination Right Disjunction Introduction ...
-1
votes
1answer
26 views

Modal Logic Proof in System T

I need to provide an axiomatic proof of the following formula in System T of modal logic: ◇(A→□B)→(□A→◇B). Any advice on how to start would be great!
1
vote
6answers
340 views

Is there anything a supernatural entity (e.g. God) could do to irrefutably prove its existence to humans? [closed]

I just posted a question in which I ask if spontaneously regrowing amputated limbs would constitute a proof of the supernatural, and several of the answers have presented interesting objections. This ...
10
votes
8answers
4k views

Is watching an amputated limb regrow proof of the supernatural?

A typical challenge skeptics present when confronted with claims of alleged miracles is "why won't God Heal amputees?". But, would that do the job? Consider the following thought experiment: ...
2
votes
0answers
104 views

How to do indirect proof (reductio ad absurdum) using natural deduction for modal logic?

I have been using Garson's Modal Logic for Philosophers, 2nd edition, to learn how to use natural deduction with modal logic. (BTW, does anyone know where there's an answer key for chapters 1 and 2 of ...
0
votes
0answers
67 views

Computing Premises from Consequence

We write 'If A, then B' to mean that if A is true, then B must be true because B is a logical consequence of A i.e. it is impossible for A to be true but B to be false. Let us consider one such ...
2
votes
1answer
134 views

How can a proof system be unsound?

I have recently started learning propositional logic. I stumbled upon the concepts of soundness and completeness. According to http://intrologic.stanford.edu/chapters/chapter_04.html, a proof system ...
1
vote
3answers
125 views

can an argument containing a contradiction be valid argument

I know that validity has nothing with truth of the conclusion or with how good argument is in general, and an argument is valid iff the truth of its premises guarantees the truth of its conclusion. ...
-1
votes
2answers
56 views

Question about fitch 6.19 proving A or C from premises A or B and -B or C

How to prove A or C from premises A or B and -B or C. Am using fitch and have been stuck on this for an hour
-2
votes
2answers
100 views

I need help using the rules of implication/inference to construct a proof for the following argument: [closed]

I need help using the rules of implication/inference to construct a proof for the following argument: 1.(A ∨ B) ⊃ (C ∨ D) C ⊃ E C ∨ ~F A ● ~E F ∨ (D ⊃ Z) .: Z KEY: Tilde (~) forms negations (“...
0
votes
1answer
47 views

Negation of the Rule of Implication proof

tried forever to figure out a solution to this problem. It's based on the rule of Material Implication with a negation in front of both sides. Namely the premise is ~(A>B) with the goal solution ...
-1
votes
1answer
122 views

First Order Languages [closed]

C1: ∀xWeakPref(x,x) C2: ∀xIndiff(x,x) C3: ∀x∀y(Indiff(x,y)↔Indiff(y,x)) C4: ∀x∀y∀z((Indiff(x,y)∧Indiff(y,z))→Indiff(x,z)) C5: ∀x∀y(StrongPref(x,y)→WeakPref(x,y)) C6: ∀x∀y(StrongPref(x,y)→ ¬StrongPref(...
2
votes
1answer
66 views

Actual and potential truth for neo-verificationists

Neo-verificationists such as Martin-Löf and Prawitz make a distinction between actual and potential truth of a proposition, roughly defined as follows: ... that a proposition A is actually true means ...
-1
votes
2answers
84 views

How to prove A<—>not A

So basically there are no premises, but the file I have received to start this problem has a contradiction symbol as step one. I’m not sure if this was a mistake or purposeful, and if it was ...
0
votes
2answers
119 views

fitch proof chapter 13 (ex. 13.29) [closed]

how to proof exercise 13.29 without using taut con
-1
votes
2answers
89 views

Logic – Deduction in Tarski's World (Fitch/LPL 13.22) [closed]

I am trying to use existential elimination to derive Brillig(a) & Tove(a). how would I do this? I have tried to do separate sub proofs to prove both Brillig(a) & Tove(a) but that doesn't work ...
-2
votes
1answer
42 views

Fitch Question, Please help! [closed]

Q ∧ S (Q ∧ ¬P) → ¬R Q → ¬P (S ∧ T) → (P ∨ R) The goal is:¬T
-2
votes
3answers
136 views

To say that something is a logical consequence is always a subjective statement?

"A mathematically proven statement would be absolutely correct if all the axioms and inference rules used in the proof are first accepted as absolutely correct. That is the whole purpose of creating ...
0
votes
2answers
82 views

fitch proof. P v Q Q→ ¬ R ¬ P ¬ R → ¬ S GOAL: ¬ S

Need help exercise using the FITCH program format. I'm stuck on where to start. The following 4 steps must be used to prove the goal. P v Q Q→ ¬ R ¬ P ¬ R → ¬ S GOAL: ¬ S Now I know: ¬ P and P v Q ...
-1
votes
1answer
68 views

Solving a proof with Fitch

I'm working on an assignment and I'm stuck on this proof. I feel like I'm on the right track but I can't find the way to prove the goal. B ^ D (B^¬A) → ¬C B → ¬A (D^E)→ (A v C) GOAL: ¬E
3
votes
2answers
348 views

Deductive argument in which every step and premises are explicitly stated?

Is there in philosophy a word/term describing an argument in which all the premises and rules for derivation from those premises are stated explicitly so that even a computer can check it? I know that ...
-2
votes
2answers
98 views

Predicate Logic

How do I derive this? Pr 1 ∀x(Fx -> ∀xGx) ∴ ∀x(Fx -> ∀x(Gx \ / Hx)) My attempt: However I cannot used universal derivation due to the free x. I think using ass id and qn would be better ...
-1
votes
1answer
63 views

How to solve this Predicate logic derivation

I want to derive the following: ∀x(Fx ↔ (¬Gx ∨ ¬Hx)). ¬∀x(Gx ∧ Hx) → ∃x(Ix ∧ ¬Gx) ∴ ∃xFx → ∃x(Ix ∧ Fx) This is my attempt: Any suggestions as to how I continue and derive this? I cannot figure out ...
0
votes
1answer
155 views

Classification of deductive reasoning types

Please, could you help me make sense of/classify types of deductive reasoning? When studying mathematical logical, I have noticed there is this Hilbert's axiomatic system (Hilbert calculus) with its ...
0
votes
1answer
56 views

Predicate Logic Proof Help! ∃xAx ∨ ∃yFy , ∀x(Ax → Fx) |= ∃xFx [closed]

I am unable to prove it :( I think I need to assume - ∃xFx but what follows later on?
0
votes
0answers
104 views

fitch arrow proof

using the FITCH program and the FITCH derivation rules you should make a proof or derivation of C7 from P5 through P11. P5: ∀x∀y(StrongPref(x,y)→ ¬StrongPref(y,x)) P6: ∀x∀y∀z((StrongPref(x,y)∧...
-1
votes
1answer
49 views

How would I create a proof In SL

H Therefore, S ⇒(B ⇒H) How would I create a proof in SL which shows the following argument is valid in SL.
0
votes
1answer
119 views

Complete a formal proof of ~(~A&~B) from A in as few lines as possible

Prove ~(~A&~B) from A in as few lines as possible. ~ = negation & = conjunction v = disjunction | = line in a subproof Here's what I have: A - Premise |~A - Assume |~B ...
1
vote
2answers
125 views

In what contexts or disciplines does “One may assume X” imply “One may ignore the possibility of any statement contrary to X being true”?

In computer programming, it has become fashionable for compilers (processors of computer language) to apply the following form of reasoning: A language standard would permit a compiler to assume that ...
0
votes
1answer
68 views

How do I prove :((A ⊃ B) ⊃ C) ⊃ (B ⊃ C)?

How do I prove, :((A ⊃ B) ⊃ C) ⊃ (B ⊃ C), using symbolic logic derivations where ⊃ represents a conditional i.e. A ⊃ B = A implies B? The first line of my derivations is the assumption, (A ⊃ B) ⊃ C)....
7
votes
2answers
180 views

How do proofs about logic fit into a logical framework?

I'm learning logic from Michael O'Leary's A First Course in Mathematical Logic and Set Theory. In chapter 1 he carefully explains the meaning of logical implication (p ⊨ q), logical inference (p ⟹ q), ...
2
votes
1answer
134 views

Proving A ⊨ B iff ⊨A → B

Let A and B represent arbitrary formulas. Also let 1 ≡ True and 0 ≡ False Prove that A ⊨ B iff ⊨A → B For my proof, I break down the biconditional into two conditionals and prove each conditional. ...
4
votes
2answers
532 views

How to show (in a hand waving manner) that the Godel sentence is true

I have been reading Graham Priest's The Logic of Paradox, and there is a section where he tried to show that our informal proof argument (in Priest's terminology, naive proof procedure) is more ...
2
votes
2answers
230 views

I could prove: Solipsism is wrong. Is my argument acceptable?

Solipsism is the idea that one cannot be sure of anyone's existence but only themself. I think that one can assume this idea to be right and then prove that this is wrong. This self-inconsistency ...
0
votes
0answers
45 views

why are ∀x(P(x)→ ∃y(Q(y)∧R(x,y))) and ∃y(Q(y)∧∀x(P(x)→(R(x,y))) not logically equivalent?

been sitting here for hours and still can't figure this out. is the order of ∀x and ∃y important in this case? all I can think of now is "all P is R of some Q", but I don't think this is right.
-2
votes
1answer
361 views

Language, Proof and Logic Exercise 14.13 (Fitch)

Having trouble proving this. I know how to prove the first conjunct of the conclusion, but not the second one. Picture shown is the attempt proof of the second conjunct (rules haven't been added yet). ...
-1
votes
1answer
502 views

Language, Proof, and Logic 14.11 Fitch Proof

Been stuck on this question for awhile now and I just don't know how to get Cube(x) so that I can use ^ intro with Cube(x) and ∀y (Cube(y) → y = a) and then use ∃ intro to get the conclusion. This is ...
0
votes
2answers
278 views

Fitch Proof Exercise 6.20

I am working on a proof and am stuck on a step. I am not sure why I cannot assume the negation of B. Is it not allowed or am I missing something? Thank you]1

1
2 3 4 5 6