You are not logged in. Your edit will be placed in a queue until it is peer reviewed.
We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.
Required fields*
-
$\begingroup$ It appears I wasn't very clear in my question. Even this method of describing the integers inside the rationals has its pluses and minuses. For example, universal quantifiers do not lend themselves very easily to algorithmic checking. [We know that the primes are characterized as roots to a polynomial, but we wouldn't want to check primality that way.] I was simply asking for other characterizations we might add to my list of three options, and gave Poonen's paper as context for why this question might be interesting (because he transfered one such characterization into another context). $\endgroup$Pace Nielsen– Pace Nielsen2010-03-30 16:57:49 +00:00Commented Mar 30, 2010 at 16:57
-
3$\begingroup$ Yes, the complexity of the definition of Z in Q affects certain decidability questions (although not the undecidability of the theory, as I explained in my answer), and this is the topic of the paper to which I linked. Your methods A, B, C, D are not first order definitions at all, and I do not take them as definitions of Z in Q, but rather, as definitions of Z in some other more elaborate structure in which the integers are already present. For example, in A, the rationals are given to you in some kind of fractional form, so you have in effect defined Z in ZxZ, which is trivial. $\endgroup$Joel David Hamkins– Joel David Hamkins2010-03-30 17:08:24 +00:00Commented Mar 30, 2010 at 17:08
-
$\begingroup$ True. Option A seems trivial. Option B seems even more unnecessary--we not only assume we know about the integers, but about ALL the primes! But it is ultimately the one which Poonen used to describe the best level of undecidability [to date] for the first order theory on the rationals. Who is to say which description is the right one? I'm interested in them all (trivial and non-trivial). $\endgroup$Pace Nielsen– Pace Nielsen2010-03-30 17:56:40 +00:00Commented Mar 30, 2010 at 17:56
-
8$\begingroup$ I think the definability of integers in rationals is due to Julia Robinson and the formula is given in Marker's Model Theory book. $\endgroup$Kaveh– Kaveh2010-11-25 17:27:04 +00:00Commented Nov 25, 2010 at 17:27
Add a comment
|
How to Edit
- Correct minor typos or mistakes
- Clarify meaning without changing it
- Add related resources or links
- Always respect the author’s intent
- Don’t use edits to reply to the author
How to Format
-
create code fences with backticks ` or tildes ~
```
like so
``` -
add language identifier to highlight code
```python
def function(foo):
print(foo)
``` - put returns between paragraphs
- for linebreak add 2 spaces at end
- _italic_ or **bold**
- quote by placing > at start of line
- to make links (use https whenever possible)
<https://example.com>[example](https://example.com)<a href="https://example.com">example</a>
- MathJax equations
$\sin^2 \theta$
How to Tag
A tag is a keyword or label that categorizes your question with other, similar questions. Choose one or more (up to 5) tags that will help answerers to find and interpret your question.
- complete the sentence: my question is about...
- use tags that describe things or concepts that are essential, not incidental to your question
- favor using existing popular tags
- read the descriptions that appear below the tag
If your question is primarily about a topic for which you can't find a tag:
- combine multiple words into single-words with hyphens (e.g. ag.algebraic-geometry), up to a maximum of 35 characters
- creating new tags is a privilege; if you can't yet create a tag you need, then post this question without it, then ask the community to create it for you