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 reference-request
Search options not deleted
user 23648
This tag is used if a reference is needed in a paper or textbook on a specific result.
6
votes
Reference for a "recursive" fragment of infinitary logic?
Yes, these are called computable infinitary formulas. I recommend the following references (as a matter of taste I prefer them to Barwise...don't remember why...possibly just it's more canonical in m …
- 3,029
2
votes
Notion of independence of Turing degrees
I think we can work out the basic properties of this notion right here. Let $\mathbf{d_0}$ and $\mathbf{d_1}$ be our degrees.
In the following situation $\mathbf{d_0}$ and $\mathbf{d_1}$ are not in …
- 3,029
3
votes
On independence and large cardinal strength of physical statements
In my opinion one of the best examples of a physical statement depending on a mathematically independent statement is provided by Malament-Hogarth machines (You can find a bunch of other links just by …
- 3,029
3
votes
On Applications of Forcing in Domain Theory
Note that forcing techniques are frequently used in computability theory, e.g., to establish the existence of degrees with certain properties. I refer the reader to Odifreddi's Handbook of Computabil …
- 3,029