Let $\Phi = \left \{ \alpha, \beta, \gamma \right \}$ be a set of three well-formed formulas. To show $\Phi$ is inconsistent, should I use deduction to show that $\Phi \vdash \phi$ for all $\phi \in \Phi$? If so, how would that look? Do I have to use all elements in $\Phi$ to deduce every $\phi \in \Phi$? If so, do I use axioms that include all three formulas or what? I apologize for my elementary understanding!
2026-03-25 09:22:59.1774430579
Showing a Set is Inconsistent In Logic
723 Views Asked by user482939 https://math.techqa.club/user/user482939/detail At
1
There are 1 best solutions below
Related Questions in LOGIC
- Theorems in MK would imply theorems in ZFC
- What is (mathematically) minimal computer architecture to run any software
- What formula proved in MK or Godel Incompleteness theorem
- Determine the truth value and validity of the propositions given
- Is this a commonly known paradox?
- Help with Propositional Logic Proof
- Symbol for assignment of a truth-value?
- Find the truth value of... empty set?
- Do I need the axiom of choice to prove this statement?
- Prove that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnf
Related Questions in PROPOSITIONAL-CALCULUS
- Help with Propositional Logic Proof
- Can we use the principle of Explosion to justify the definition of implication being True when the antecedent is False?
- Simplify $(P \wedge Q \wedge R)\vee(\neg P\wedge Q\wedge\neg R)\vee(\neg P\wedge\neg Q\wedge R)\vee(\neg P \wedge\neg Q\wedge\neg R)$
- Alternative theories regarding the differences between the material conditional and the indicative conditionals used in natural language?
- Translations into logical notation
- Is the negation of $(a\wedge\neg b) \to c = a \wedge\neg b \wedge\neg c$?
- I am kind of lost in what do I do from here in Propositional Logic Identities. Please help
- Boolean Functional completeness of 5 operator set in propositional logic
- Variables, Quantifiers, and Logic
- Comparison Propositional Logic
Related Questions in NATURAL-DEDUCTION
- Predicate logic: Natural deduction: Introducing universal quantifier
- Deduce formula from set of formulas
- Prove the undecidability of a formula
- Natural deduction proof for $(P\to\lnot Q)\to(\lnot P \lor\lnot Q)$
- How do I build a proof in natural deduction?
- Deductive Logic Proof
- Can the natural deduction system prove $P \iff ¬P$ to show that it's a contradiction?
- Exercises and solutions for natural deduction proofs in Robinson and Peano arithmetic
- How would I show that X is equivalent to ((¬X ↔ X ) ∨ X )?
- Equivalence proof by using identities and ‘n series of substitutions: (P ⋁ Q) → (P ⋀ Q) ≡ (P → Q) ⋀ (Q → P).
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Actual answer
First of all, no, there's no obligation to use everything in $\Phi$. The set $\Phi$ is the set of sentences you're allowed to use in a proof. Adding stuff to $\Phi$ only makes it easier to prove things.
You're also mixing up $\Phi$ and the set of all sentences in the language. Obviously $\Phi$ proves every sentence in $\Phi$. What you want to talk about is the sentences in general which $\Phi$ proves.
Now, on to the issue of inconsistency. There are two notions of inconsistency of a set of sentences $\Phi$:
$\Phi$ proves everything.
For some $p$, $\Phi$ proves both $p$ and $\neg p$.
Conveniently, in classical propositional logic these are equivalent: clearly if $\Phi$ is inconsistent in the first sense, it's inconsistent in the second sense, and conversely if $\Phi$ proves both $p$ and $\neg p$ we can use proof by contradiction to prove whatever we want from $\Phi$: "Suppose $\neg q$. Then ... we conclude $p$ and $\neg p$. So since we got a contradiction from $\neg q$, we have $q$."
So all you need to do is find a single sentence such that $\Phi$ proves both the sentence and its negation.
Irrelevant but interesting note
Now note that I said "classical logic" above. There are other logics out there, and in some of them it is not the case that proving a contradiction means proving everything. For such logics we do need to distinguish between the notions of inconsistency given above: generally, the second (weaker) one is called "inconsistent" while the first is called "trivial." In these logics, and unlike classical logic, inconsistent theories may be interesting; see e.g. here.