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 lo.logic
Search options not deleted
user 68448
first-order and higher-order logic, model theory, set theory, proof theory, computability theory, formal languages, definability, interplay of syntax and semantics, constructive logic, intuitionism, philosophical logic, modal logic, completeness, Gödel incompleteness, decidability, undecidability, theories of truth, truth revision, consistency.
13
votes
Accepted
Antirandom reals
Let A be a c.e. set with the property that there are infinitely many stages $s$ such that $A_s\upharpoonright s = A\upharpoonright s$. Call such a stage "strongly true". Noncomputable $A$ with infinit …
- 303
6
votes
Accepted
2-REA PA degrees
Theorem 5.1 in Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion states that Arslanov's completeness criterion holds for $n$-REA sets. The paper is …
- 303