Is there a physical problem that is undecidable in Zermelo-Fraenkel-Choice set theory? Something related with free abelian groups and Whitehead problem perhaps?
2026-05-05 16:40:17.1777999217
Physics undecidable problem in ZFC.
954 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in SET-THEORY
- Theorems in MK would imply theorems in ZFC
- What formula proved in MK or Godel Incompleteness theorem
- Proving the schema of separation from replacement
- Understanding the Axiom of Replacement
- Ordinals and cardinals in ETCS set axiomatic
- Minimal model over forcing iteration
- How can I prove that the collection of all (class-)function from a proper class A to a class B is empty?
- max of limit cardinals smaller than a successor cardinal bigger than $\aleph_\omega$
- Canonical choice of many elements not contained in a set
- Non-standard axioms + ZF and rest of math
Related Questions in PHYSICS
- Why is the derivative of a vector in polar form the cross product?
- What is meant by input and output bases?
- Does Planck length contradict math?
- Computing relative error with ideal gas law.
- Planetary orbits in a $4$-dimensional universe
- Applied Maths: Equations of Motion
- Return probability random walk
- What will be the velocity of a photon ejected from the surface of cesium by a photon with a frequency of 6.12E14 s^-1?
- What mathematical principal allows this rearrangement during simplifying
- Time when velocity of object is zero and position at that point in time
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?
There are numerous questions about the nature of the solutions to specific differential equations that are computationally undecidable, and which therefore admit numerous specific instances whose solution has a nature independent of ZFC or of any other fixed consistent theory.
For example, in the paper Boundedness of the domain of definition is undecidable for polynomial ODEs, the authors Graca, Buescu and Campagnolo prove that the question of whether the differential equation $\frac{dx}{dt}=p(t,x)$ with initial conditiion $x(t_0)=x_0$, where $p$ is a vector of polynomials, has a solution with unbounded domain or not, is computationally undecidable.
My point is that whenever a problem like this is computationally undecidable, then it follows that infinitely many specific instances of it are also provably undecidable in any fixed consistent true theory, such as PA or ZFC (or ZFC + large cardinals). The reason is that if a consistent true theory were able to settle all but finitely many instances of the question, then the original problem would be decidable by the algorithm that simply searched for proofs. One can write down a very specific polynomial ODE, such that one cannot prove or refute in ZFC whether it has an unbounded solution or not.
I think there are many other similar examples. I recall hearing in my graduate student days about similar examples, such as the question of whether a given dynamical system is chaotic or not, is also undecidable in general. Therefore these other questions also admit numerous instances of ZFC independence.