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 32389
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.
9
votes
Accepted
Harrington's unpublished note "The constructible reals can be anything"
It seems the Harrington's preprint is here http://logic-library.berkeley.edu/catalog/detail/2135 but to access it requires CalNet login. Maybe Harrington himself could help if you write to him: http:/ …
- 16.5k
5
votes
Elements of the method of forcing in some papers of N. N. Luzin
Maybe the following papers will be helpful:
http://iopscience.iop.org/0036-0279/29/5/A04/ (The ideas of N. N. Luzin in descriptive set theory, by L. V. Keldysh)
http://iopscience.iop.org/0036-0279/4 …
- 16.5k