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 503801
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
Essential reads in the philosophy of mathematics and set theory
The book Philosophy of Mathematics by Øystein Linnebo, is a nice, systematic and accessible introduction to the philosophy of mathematics by a leading scholar in the field.
Plato's Problem: An Introdu …
11
votes
3
answers
755
views
Is every recursively axiomatizable and consistent theory interpretable in the true arithmeti...
I am looking for a scholarly text that discusses this issue in detail.
- 307
4
votes
0
answers
153
views
Are the relations of being homeomorphic or being homotopy equivalent on the compact polyhedr...
Let $ K(\mathbb{N}) $ denote the set of all finite simplicial complexes with vertices in $\mathbb{N}$.
Let $ f\colon \mathbb{N} \to K(\mathbb{N}) $ be a computable bijection.
Let $ R $ = { $ (m, n) $ …
- 307