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 111429
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.
0
votes
1
answer
473
views
The smallest initial ordinal which is not defined using first-order formulas with parameters...
Let $\theta_\alpha$ be the smallest ordinal such that there is no first-order formula $\phi$ such that:
$$\exists\beta_0,\beta_1...\beta_n\in\alpha\forall x(\phi(x,\theta_{\beta_0},\theta_{\beta_1}.. …
- 675
3
votes
0
answers
413
views
Consistency of Nontrivial Elementary Embedding from $\omega_1$ to itself?
I was wondering about a way to make really large countable ordinals. It turns out that in certain models of ZFC (for example pointwise definable ones) every ordinal is definable with no parameters, wh …
- 675
2
votes
What are some reasonable-sounding statements that are independent of ZFC?
I really think the following one is just intuitive. However, not only is it consistent to be false in ZFC, it is actually not known to be consistent in ZFC (its consistency follows from the existence …