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 |
the mathematical discipline that applies mathematical methods to the study of mathematical theories themselves.
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.
6
votes
1
answer
216
views
Is the statement that every convex complete metric space has midpoints equivalent to the axi...
We say that a point $m$ is between points $p$ and $q$ of a metric space $(M, d)$ if $d(p, q) = d(p, m) + d(m, q)$ and $p ≠ m ≠ q$. Furthermore, if the equality $d(p, m) = d(m, q)$ holds for $m$, we sa …
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) $ …