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 answers only
not deleted
user 129878
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.
1
vote
Accepted
Can this theory interpret Peano arithmetic?
Yes we can interpret Peano Arithmetic, but only by restricting to a subclass. As I noted in a comment, there's a model of your axioms where the assertion $\forall n, \neg(n<n)$ fails, so we cannot sim …
- 446
4
votes
Global Choice bi-interpretable with Global Wellorder?
This is an answer to the second question, proving Global Choice is bi-interpretable with a rank-respecting Global Wellorder. This is intuitively the same as finding a definable bijection between the t …
- 446