Suppose I want to show that $A$ is $\Sigma_8$-complete. By definition, this requires to prove, in particular, that $A$ is itself a $\Sigma_8$ set. But I don't really understand if I need to prove as well that $\Sigma_8$ is the "best" one could get? (I.e., that $A$ is not $\Sigma_i$ or $\Pi_i$ for $i=1,2,3,4,5,6,7$.) Some $\Sigma_8$ sets may be as well $\Sigma_1$, but they still qualify for being $\Sigma_8$...
2026-04-06 09:21:31.1775467291
A basic question about the definition of $\Sigma_n$ completeness
81 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/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 DEFINITION
- How are these definitions of continuous relations equivalent?
- If a set is open, does it mean that every point is an interior point?
- What does $a^b$ mean in the definition of a cartesian closed category?
- $\lim_{n\to \infty}\sum_{j=0}^{[n/2]} \frac{1}{n} f\left( \frac{j}{n}\right)$
- Definition of "Normal topological space"
- How to verify $(a,b) = (c,d) \implies a = c \wedge b = d$ naively
- Why wolfram alpha assumed $ x>0$ as a domain of definition for $x^x $?
- Showing $x = x' \implies f(x) = f(x')$
- Inferior limit when t decreases to 0
- Is Hilbert space a Normed Space or a Inner Product Space? Or it have to be both at the same time?
Related Questions in RECURSION
- Solving discrete recursion equations with min in the equation
- Recognizing recursion relation of series that is solutions of $y'' + y' + x^2 y = 0$ around $x_0 = 0$.
- Ackermann Function for $(2,n)$
- Primitive recursive functions of bounded sum
- Ackermann Function for $f(2,n)$ as compared to $f(5,1)$
- Determinant of Block Tridiagonal Matrix
- In how many ways can the basketball be passed between four people so that the ball comes back to $A$ after seven passes? (Use recursion)
- Finding a recursive relation from a differential equation.
- A recursive divisor function
- Are these numbers different from each other?
Related Questions in COMPUTABILITY
- Are all infinite sets of indices of computable functions extensional?
- Simple applications of forcing in recursion theory?
- Proof of "Extension" for Rice's Theorem
- How to interpret Matiyasevich–Robinson–Davis–Putnam in term of algebraic geometry or geometry?
- Does there exist a weakly increasing cofinal function $\kappa \to \kappa$ strictly below the diagonal?
- Why isn't the idea of "an oracle for the halting problem" considered self-contradictory?
- is there any set membership of which is not decidable in polynomial time but semidecidable in P?
- The elementary theory of finite commutative rings
- Is there any universal algorithm converting grammar to Turing Machine?
- Is the sign of a real number decidable?
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 three different notions here:
Being $\Sigma_8$.
Being properly $\Sigma_8$, which is to say being $\Sigma_8$ but not $\Sigma_n$ for any $n<8$ (or $\Pi_k$ either for that matter for any $k\le 8$).
Being $\Sigma_8$-complete.
If we want to show that something is $\Sigma_8$-complete, it is - as you say - not enough to simply show that it is $\Sigma_8$. But it is also not enough to show that it is properly $\Sigma_8$! $\Sigma_8$-completeness is a very strong property: we have to show that any other $\Sigma_8$ set is many-one reducible to the given set, and that doesn't follow from proper-$\Sigma_8$-ness alone. In order to prove that a set $A$ is $\Sigma_8$ complete, we have to prove two things:
$A$ is $\Sigma_8$.
Every $\Sigma_8$ set $B$ can be many-one reduced to $A$.
That's it - we never need to refer to proper-$\Sigma_8$-ness, and we don't get any benefit from doing so either.
(That said, as a matter of practice basically every naturally-occurring properly-$\Sigma_n$ set is $\Sigma_n$-complete. So you can always take a proof of proper-$\Sigma_n$-ness as really good evidence for $\Sigma_n$-completeness. But this isn't a theorem or anything, it's just a fact about the sorts of sets we run into in mathematical practice ... at least, so far.)
Note, incidentally, that it is not immediately obvious that $\Sigma_8$-completeness implies properly-$\Sigma_8$-ness! To get that you need to use the fact that the arithmetical hierarchy doesn't collapse, which takes a proof. Of course that's not hard, but it is worth noting - and it's worth keeping in mind that there are hierarchies out there which do, or may as far as we know, collapse.