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 mathematical-philosophy
Search options answers only
not deleted
user 5442
Philosophical aspects of logic and set theory; truth status of mathematical axioms; Philosophy of Mathematics; philosophical aspects of mathematics in general; relation of mathematics to philosophy; etc. Consider also posting at http://philosophy.stackexchange.com/, where philosophy-of-mathematics is one of the most popular tags.
14
votes
Accepted
Notion of Truth and Axioms
The proof of the incompleteness theorem can already be done syntactically, ignoring truth, if we remove the conclusion that the Gödel sentence is true and leave only that it is neither provable nor di …
- 9,683
33
votes
Interesting meta-meta-mathematical theorems?
In Reverse Mathematics, we can study what happens if we use weak systems of second-arithmetic as metatheories. For example, we can study the strength of the completeness theorem and prove results such …
- 9,683
6
votes
Interpretation of the Second Incompleteness Theorem
The fact that the second incompleteness theorem refers to consistency is important for several applications, both philosophical and mathematical.
Philosophically, the second incompleteness theorem i …
- 9,683
23
votes
Accepted
Clarification of Gödel's second incompleteness theorem
The key idea Feferman is exploiting is that there can be two different enumerations of the axioms of a theory, so that the theory does not prove that the two enumerations give the same theory.
Here i …
- 9,683
7
votes
Abstract thought vs calculation
In computability theory, it is often necessary to prove some particular function is a "computable function". Until the 1960s, this was most commonly done by actually demonstrating a formal algorithm f …
7
votes
Intended interpretations of set theories
I have a few comments that I hope are useful even if they don't clarify things completely. As Michael Blackmon says, different people have different ways of resolving things to their own satisfaction. …
- 9,683
22
votes
Why are proofs so valuable, although we do not know that our axiom system is consistent?
Gödel's theorems do not say that we can never know our axiom systems are consistent. Not at all. What they say is that we can never prove that certain systems are consistent within those systems thems …
20
votes
Proving Independence of Axioms by Exhibiting Models Which Don't Satisfy Our Intuition
You have run into one of the main themes of contemporary logic: the difference between "truth in the standard model" and "provability". This is an extremely deep issue, so I'm sure other people will a …