Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with nt.number-theory
Search options not deleted
user 7206
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
5
votes
Prime numbers and limit ordinals
You can encode using recursive functions fairly large ordinals. But you are trying a bit too hard, I think, to encode $\omega^2$. Perhaps a simpler method would be as follows:
Let $\pi$ be a bijectio …
- 39.8k
12
votes
Accepted
The partial preorder on $\mathbb N$ generated by the finite axioms of choice
In Jech's "The Axiom of Choice", at the end of Chapter 7, he formulates the following condition on two natural numbers $n>m$:
(S) There is no decomposition of $n$ into $p_1+\ldots+p_s=n$ such that …
- 39.8k