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 proof-theory
Search options not deleted
user 29697
For question in Proof Theory, where "proofs" themselves are the object of mathematical investigation. It is not to be used to request a proof of some result.
1
vote
Are there non-diagonal proofs for Cantor's continuum and Godel's incompletness theorems?
Some rough thoughts (not a complete or formal answer!).
I don't think I've seen this written down anywhere in as many words, but as someone who studies algorithms, let me propose an answer to questio …
- 4,539
1
vote
What would $\mathcal{P} \neq \mathcal{NP}$ tell us about some non-constructive proofs?
I think the important distinction that may illuminate your question is between a proof that a particular instance $(W,L)$ belongs to the language TSP, and a proof that a particular algorithm for TSP i …
- 4,539
7
votes
Computational complexity theoretic incompleteness: is that a thing?
This might be more of an analogy, but major complexity conjectures like P=NP could be considered related.
Background: a common "complete" problem for a specified time limit is: given a Turing machine, …
- 4,539