PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Medium Entry average rating: No information on entry rating
[parent] arithmetical hierarchy is a proper hierarchy (Result)

By definition, we have $\Delta_n=\Pi_n\cap \Sigma_n$ . In addition, $\Sigma_n\cup\Pi_n\subseteq \Delta_{n+1}$ .

This is proved by vacuous quantification. If $R$ is equivalent to $\phi(\vec{n})$ then $R$ is equivalent to $\forall x\phi(\vec{n})$ and $\exists x\phi(\vec{n})$ , where $x$ is some variable that does not occur free in $\phi$ .

More significant is the proof that all containments are proper. First, let $n\geq 1$ and $U$ be universal for $2$ -ary $\Sigma_n$ relations. Then $D(x)\leftrightarrow U(x,x)$ is obviously $\Sigma_n$ . But suppose $D\in \Delta_n$ . Then $D\in Pi_n$ , so $\neg D\in\Sigma_n$ . Since $U$ is universal, ther is some $e$ such that $\neg D(x)\leftrightarrow U(e,x)$ , and therefore $\neg D(e)\leftrightarrow U(e,e)\leftrightarrow \neg U(e,e)$ . This is clearly a contradiction, so $D\in\Sigma_n\setminus\Delta_n$ and $\neg D\in\Pi_n\setminus\Delta_n$ .

In addition the recursive join of $D$ and $\neg D$ , defined by $$D\oplus\neg D(x)\leftrightarrow (\exists y<x[x=2\cdot y]\wedge D(x)) \vee (\neg\exists y<x[x=2\cdot y]\wedge \neg D(x))$$

Clearly both $D$ and $\neg D$ can be recovered from $D\oplus\neg D$ , so it is contained in neither $\Sigma_n$ nor $\Pi_n$ . However the definition above has only unbounded quantifiers except for those in $D$ and $\neg D$ , so $D\oplus\neg D(x)\in \Delta_{n+1}\setminus\Sigma_n\cup\Pi_n$




"arithmetical hierarchy is a proper hierarchy" is owned by Henry.
(view preamble | get metadata)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: quantifiers, unbounded, NOR, contained, join, recursive, contradiction, relations, universal, proof, variable, vacuous quantification

This is version 3 of arithmetical hierarchy is a proper hierarchy, born on 2002-08-06, modified 2002-08-24.
Object id is 3273, canonical name is ArithmeticalHierarchyIsAHierarchy.
Accessed 2135 times total.

Classification:
AMS MSC03B10 (Mathematical logic and foundations :: General logic :: Classical first-order logic)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)