Pages that link to "Item:Q4032456"

The following pages link to ∑ n Definable Sets without ∑ n Induction (Q4032456):

Displaying 8 items.

• \(\Delta_{2}\) degrees without \(\Sigma_{1}\) induction (Q466117) (← links)
• Computational processes, observers and Turing incompleteness (Q616506) (← links)
• The minimal e-degree problem in fragments of Peano arithmetic (Q705537) (← links)
• The degree of a \(\Sigma_ n\) cut (Q749530) (← links)
• \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator (Q1368581) (← links)
• Definable incompleteness and Friedberg splittings (Q3149989) (← links)
• On Σ‐definability without equality over the real numbers (Q3528148) (← links)
• \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture (Q5937666) (← links)