Can anyone give an example of a theorem in Boolean Algebra that isn't immediately obvious to someone with a computer that can construct a truth table? Clearly no propisition that can be proved using only a truth table can be formally undecidable.
2026-03-25 17:31:03.1774459863
Boolean Algebra and Godel
220 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in BOOLEAN-ALGEBRA
- What is (mathematically) minimal computer architecture to run any software
- Put $f(A,B,C) = A+B'C$ in $Σ$ $\pi$ notation
- Definition of Boolean subalgebra
- Steps to simplify this boolean expression
- When a lattice is a lattice of open sets of some topological space?
- Boolean Algebra with decomposition property
- 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)$
- $B$ countable boolean algebra then St(B) separable.
- Who is the truth teller (logic puzzle)
- How to prove this Boolean expression?
Related Questions in INCOMPLETENESS
- Primitive recursive functions of bounded sum
- Difference between provability and truth of Goodstein's theorem
- Decidability and "truth value"
- What axioms Gödel is using, if any?
- A tricky proof of a Diophantine equation is valid?
- Can all unprovable statements in a given mathematical theory be determined with the addition of a finite number of new axioms?
- Incompleteness Theorem gives a contradiction?
- Is it possible to construct a formal system such that all interesting statements from ZFC can be proven within the system?
- How simple it can be?
- What is finitistic reasoning?
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?
It is more complicated than computing truth tables, but the first-order theory of Boolean algebras is decidable. This is an old result of Tarski, proved by quantifier elimination. There have been extensions by Rabin, Weese, and others.