Questions tagged [proof]

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

Filter by
Sorted by
Tagged with
2 votes
1 answer
955 views

De Morgan for Quantifiers Formal Proof: ∀∃-intro and -elim Questions

I have a problem reading existing question's answers. I've successfully encoded the proof of one of De Morgan's Laws, ¬∃x P(x) → ∀x ¬P(x), for Quantifiers formally via cubicaltt type-checker via Curry-...
Kostiantyn Rybnikov's user avatar
1 vote
2 answers
458 views

De Morgan for Quantifiers Formal Proof: Inhabitance Question

I have a problem reading existing question's answers. I've successfully encoded the proof of one of De Morgan's Laws, ¬∃x P(x) → ∀x ¬P(x), for Quantifiers formally via cubicaltt type-checker via Curry-...
Kostiantyn Rybnikov's user avatar
1 vote
3 answers
204 views

Modal validity & vagueness

(2nd version to make explicit my implicit assumptions about A, B and C, and the definitions of the non-logical constants "⊂" and "≡".) Intuitively, the following modal argument ...
Speakpigeon's user avatar
  • 6,258
1 vote
4 answers
681 views

Is the Kalam cosmological argument scientifically provable?

Kalam Cosmological Argument: (1) Everything that has a beginning of its existence has a cause of its existence. (2) The universe has a beginning of its existence. Therefore: (3) The universe has a ...
john taylor's user avatar
2 votes
2 answers
147 views

How to get the refutation of (OP ⊃ OQ) ∴ O(P ⊃ Q) in Deontic Logic

In Deontic Logic, one could easily infer "If it is obligatory that P, then it is Obligatory that Q", from "It is obligatory that if P then Q" O(P ⊃ Q) ∴ (OP ⊃ OQ) Where the ⊃ is an implication (...
SmootQ's user avatar
  • 2,369
-1 votes
2 answers
258 views

Language Proof and logic Chapter 13 problem 31

I have been working on this problem for over an hour and I think I have simply missed something. I need some help. I don't see how this is supposed to work out Here are the premises: ∀x ∀y[Likes(x,...
jessie's user avatar
  • 73
1 vote
2 answers
160 views

If I saw UFOs, and I was of sound mind and body, does that give the right to say that it is true? [closed]

Around a year ago I saw some spectacular things in the skies above me, on three separate occasions. I believe I was of sound mind and what I saw really did exist. Given that what I saw was so out-...
Dan Rayson's user avatar
0 votes
2 answers
591 views

Language proof and logic Chapter 15 question 21 how?

I'm really not understanding the set up of how to go about solving this problem any help is welcome
jessie's user avatar
  • 73
0 votes
2 answers
791 views

Language proof and logic Chapter 15 question 16 help

I'm trying to go about solving this problem but I'm having problems even knowing how to approach it. Can someone help me to set it up? Here is the premise: ∀x∀y(x ⊆ y ↔️ ∀z(z ∈ x ⟶ z ∈ y) Here is ...
jessie's user avatar
  • 73
0 votes
2 answers
413 views

language proof and logic chapter 13 question 49 Help

Premises: ∃xP(x) ∀x∀y((P(x)∧P(y)) → x = y) Prove: ∃x(P(x)∧∀y(P(y) → y = x)) I've started it but the end is starting to get super muddy and not work out and I don't know where I went wrong.
jessie's user avatar
  • 73
0 votes
2 answers
326 views

In Fitch, how does one prove “P” from the premise “(¬P ∨ Q)→P”?

I can't figure out how to prove that formally. Please, help!!
user36043's user avatar
2 votes
4 answers
3k views

How to prove ‘∃xP(x)’ from ‘¬∀x(P(x)→Q(x))’

What would a formal Fitch proof for this look like? I am given ¬∀x(P(x)→Q(x)), and need to derive ∃xP(x) from it. I started with this, but I don't know if I am doing the right thing, and where to go ...
35308's user avatar
  • 125
1 vote
2 answers
829 views

Fitch Proof by Contradiction help

Hi, I'm pretty new to writing formal proofs and I was wondering if I could get some help solving this question. I've set up the problem and I was thinking of perhaps proving it by contradiction that ...
John Abercrombie's user avatar
2 votes
2 answers
407 views

Fitch Biconditional Proof Help?

Hi, I'm starting to learn formal proofs using Fitch, but I'm having a bit of trouble figuring out my arguments. I've generally mapped out the subproofs I was considering to use, but I'm unsure how to ...
John Abercrombie's user avatar
3 votes
2 answers
90 views

Can results be predicted?

I wanted to know that, what can we assume as the result of some experiment which we have not conducted on the basis of mathematical proofs? I mean, in general, equations are created after analyzing ...
serv0id's user avatar
  • 223
1 vote
1 answer
542 views

How to solve the derivation?

Derive the following without assumptions: ¬∃xFx↔∀x¬Fx How do I solve this derivation?
user34930's user avatar
  • 343
2 votes
2 answers
516 views

How does one prove ‘(B→C)→¬A’ from ‘(A→B)∨C’ and ‘(A→¬C)’ in Fitch?

I am trying to work my way through this Fitch proof, and I am not sure what I am doing wrong, but I keep getting stuck no matter what I try. First attempt: Second attempt:
35308's user avatar
  • 125
3 votes
3 answers
2k views

2 simple Formal Fitch Proofs

I'm having difficulty proving these. They seem obvious, but I can't figure how to set up formal proofs for them. Could anyone give me clues on how to start them? ¬(P∧¬Q) from the premise P→Q; ¬Q→(R→P)...
35308's user avatar
  • 125
5 votes
1 answer
1k views

Does anyone have a proof checker they prefer using for modal logic?

I am looking for a proof checker for modal logic using natural deduction or sequent calculus. I am trying to learn Isabelle, but I think there should be a simpler solution. Although I can rely on ...
Frank Hubeny's user avatar
  • 19.2k
1 vote
1 answer
80 views

Does this symbolic logic proof work?

So, I have this proof: Let a be an open sentential variable. Let K and C be prepositional variables asserted of sentences. Given K(a) <=> C(a) & a C(a) <=> C( C(a)) C(a & b) <=> C(...
lware's user avatar
  • 87
1 vote
1 answer
143 views

Why cannot the following theory be refuted by logic but is rejected because of lack of empirical support?

The following statements are taken from a book: The man in the street, and also the philosopher K. Marbe, believe that after a run of seventeen heads tail becomes more probable. This argument has ...
Turkhan Badalov's user avatar
2 votes
1 answer
115 views

Is Frankenstein's monster tantamount to positive proof in Science?

Specifically Biology presents some problems for me. For instance, now that we have Evolution we know what to look for. Thus we are bound to observe some adaptations, and over time even new species. ...
christo183's user avatar
  • 2,387
12 votes
16 answers
7k views

Can we logically prove that anything exists?

Suppose I want to prove that negative numbers exist. Well, I could easily do that using a mathematical proof. However, all I would be doing is adding another logical object to a list of known logical ...
user34467's user avatar
  • 121
1 vote
0 answers
57 views

Are arguments claiming the impossibility to prove or disprove anything themselves impossible to prove? [duplicate]

Could arguments claiming the impossibility to prove or disprove anything be flawed because if they were sound they would also be impossible to prove? Or could you just assume they must be right ...
Adam's user avatar
  • 51
1 vote
1 answer
123 views

Correct Way of Handling A Corollary of A Corollary?

I have a conclusion S that is moderately interesting. While the corollary of S is more interesting, the corollary of the corollary of S is extremely interesting. Should I just label them corollary 1 ...
Jesse S.'s user avatar
1 vote
3 answers
213 views

Proofs in math and physics

Suppose we have the case of a proof in math or physics and we want to compare the status of the derived information. I know that in math mostly all derived information or deduced details are a priori. ...
Rico1990's user avatar
  • 155
3 votes
4 answers
804 views

Symbolic Logic - Negation Introduction

I am working on a problem for an online class that I'm struggling to figure out. I'm given these premises: 1. (H > (A > B)) (The > sign here represents conditional) 2. (~K & ~B) 3. (~A > K) The ...
ephemeron's user avatar
2 votes
3 answers
807 views

Prove ¬∃x ∀y (E(x, y) ↔ ¬E(y, y)) given no premises

The only way I could think of to do this problem is reductio, but since the two biconditional terms are not contradictory, I am pretty stuck.
William Palmer's user avatar
2 votes
3 answers
479 views

Natural deduction proof help!

I've gone through about 40 natural deduction proofs in the past couple days, and mostly they are no problem. For some reason, I've been stuck on 1 tedious problem for an entire day. I just can't seem ...
vundabar's user avatar
4 votes
5 answers
462 views

Is there a way to prove the existence of choice and free will

It is practically impossible to "make" more than one decision at a point in time. Even if you "change" your mind later, it is at a later point. How do we know that those are decisions that sentient ...
dtech's user avatar
  • 230
3 votes
5 answers
321 views

Can any correct logical reasoning in natural language sentences be translated into a formal mathematical proof?

Since natural languages (e.g. English) are prone to ambiguities and misunderstandings due to their constant evolving nature and lack of rigorous formalization, and given an arbitrary philosopher X who ...
xwb's user avatar
  • 689
1 vote
2 answers
98 views

What's the name of this kind of fallacious proof to refute an idea?

In an argumentation where speaker A suggests an idea, we sometimes encounter this kind of fallacious proof from speaker B that speaker A's idea is bad (a very common form is known as passive-agressive ...
Basj's user avatar
  • 111
2 votes
3 answers
2k views

Deriving "(p.q) v (p.r) from "p.(q v r)"?

I am new to logic. and here are my tryouts for deriving deriving "(p.q) v (p.r) from "p.(q v r)", and further I want to show that ”p.(q V r)” is equivalent to ”(p.q) V (p.r)”, by using natural ...
agBerg's user avatar
  • 33
0 votes
1 answer
298 views

How to prove the tautology ¬(P↔¬P) using Fitch?

Just as the question proposes, I'm having trouble with proving this tautology. I know one should use proof by contradiction however I am currently stuck.
Charlie's user avatar
  • 11
1 vote
2 answers
670 views

Sentential logic derivation: ~(A ≡ B) ├ (~A ≡ B)

I am doing some practice sentential derivation proofs for an upcoming test and have attempt the following proof many, many times without success. ~(A ≡ B) ├ (~A ≡ B) The logic system I am using is ...
wonggr's user avatar
  • 111
1 vote
2 answers
100 views

How to prove using higher abstractions instead of diving into axioms or a little bit deeper?

Sorry for the bad formulated question, feel free to edit it. I will explain my question here. I try to reflect on my abilities of proving theorems to become better at this. That is why after reading ...
Turkhan Badalov's user avatar
1 vote
1 answer
74 views

Doubt in Searle's Mind: A Brief Introduction

I have been reading Searle's Mind: A Brief Introduction, Oxford UP (2004). In it I came across the passage in Chapter 2: if we believe that p and if we believe that if p then q we will believe ...
arrhhh's user avatar
  • 13
3 votes
2 answers
207 views

Does anyone know of a philosophy which rectifies or considers the following question?

Let's imagine that I began to doubt the validity of one of my arguments, which leads me to question my ability to make rational arguments. And so begin to distrust my intuitive ideas about logic, then ...
Akradantous's user avatar
2 votes
4 answers
513 views

In fitch, S → (R ∨ P), P → (¬R → Q) ∴ S → (Q ∨ R)

Construct a proof for the argument: S → (R ∨ P), P → (¬R → Q) ∴ S → (Q ∨ R) I have gotten to the point in the illustration, but I am unable to figure out where to go from here. I get tricked up on ...
user29979's user avatar
4 votes
2 answers
249 views

Do α and β entail each other?

Show whether the following is true or false: α |= β or β |= α, for any two formulas α and β I'm assuming here that α and β are formulas, not a set of formulas. My thought is that I can prove that ...
Amous's user avatar
  • 171
1 vote
2 answers
478 views

Predicate logic proofs - how to split a disjunction bound by two quantifiers

I need to complete the following proof using only primitive rules (the introduction and elimination rules for each connective and quantifier). (∃x)(∀y)(Py ∨ Qx) ⊢ (∀y)Py ∨ (∃x)Qx I've only been able ...
connoraw's user avatar
2 votes
2 answers
2k views

Prove whether statement is true or false

Consider the following: If a |= c or b |= c, then a ∨ b |= c. Prove whether this statement is true or false. My gut instinct is to compare truth tables, but I don't think a truth table is possible ...
Amous's user avatar
  • 171
0 votes
1 answer
123 views

Has any philosopher ever argued succesfully that anything at all does not exist?

Is it possible to prove that something does not exist? I'm asking because I find it very difficult to think of any such idea.
da boss's user avatar
  • 139
1 vote
2 answers
85 views

Which group is bigger, the one of things we can write about, or that we can feel?

Which group is bigger, the one of things we can write about (in any language (including programing)), or the one of the things we can feel through our senses (including those things that machines help ...
tcllst's user avatar
  • 11
2 votes
1 answer
215 views

Quine - Two dogmas of empiricism - status of mathematics [duplicate]

If we do away with the analytic-synthetic distinction as per Quine, does that mean that mathematics is no more certain than empirical science? And how does mathematical proof proceed if we don't use ...
Ameet Sharma's user avatar
  • 2,961
2 votes
3 answers
262 views

Logic question regarding a logical truth

Is the following logically true? ∃x[Cube(x) →∀yCube(y)] I think that it is logically true. When translated into truth functional form we have: A→B. A truth table shows that it is not a tautology but ...
P.Solo's user avatar
  • 61
1 vote
4 answers
497 views

Language Logic Proof Question: ¬∃x∀y[E(x,y) ↔ ¬E(y,y)]

I am wondering if I have completed this proof properly. I don't think I have it right. It's tricky! Conclusion: ¬∃x∀y[E(x,y) ↔ ¬E(y,y)] ¬¬∃x∀y[E(x,y) ↔ ¬E(y,y)] ∃x∀y[E(x,y) ↔ ¬E(y,y)] ¬E,1 ...
P.Solo's user avatar
  • 61
3 votes
2 answers
143 views

How does one prove a generalised conditional statement?

I'm trying to prove a statement of the form ∀x: P(x) → Q(x). Apparently the way to do it is to prove that Q(x) for some x such that P(x), assuming that x is arbitrarily chosen, and hence ...
Sonechka's user avatar
5 votes
4 answers
1k views

What is the nature of proof in mathematics?

Preamble: I think we have this sort of questions, where we are required to find a solution for them. For example, what is the area of a circle?. I think the way to solve these problems is to try to ...
Mathnewbie's user avatar
0 votes
6 answers
397 views

How can you prove I'm not a dog? [closed]

This is a general question that proves you have no way of knowing anything. How can you prove, that if you see me (assume I look like you exactly, because you don't have a picture of me), I am not a ...
TigerGold's user avatar
  • 117

1 2 3
4
5
7