Tour
About Us
Meta
Loading…
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Log in
Stack Exchange
All Sites
Top Users
Digests
Mark Reitblatt
Cornell University
http://www.cs.cornell.edu/~reitblatt
CS PhD Student at Cornell.
top
accounts
reputation
activity
subscriptions
Top Questions
24
votes
Where is the proof that Coq + Excluded Middle is consistent
reference-request
lo.logic
coq
asked Feb 14, 2011 at 4:03
cstheory.stackexchange.com
10
votes
Uniform hierarchy of problems that span complexity and computational hierarchies
cc.complexity-theory
computability
asked Nov 10, 2010 at 4:03
cstheory.stackexchange.com
Top Answers
35
Applications of topology to computer science
cstheory.stackexchange.com
31
Powerful Algorithms too complex to implement
cstheory.stackexchange.com
13
Are there any counterintuitive results in theoretical computer science?
cstheory.stackexchange.com
12
What happens if we try to extract a witness but it actually does not exist from a term of existential type?
cstheory.stackexchange.com
11
"Natural" decidable problems known not to be in NP.
cstheory.stackexchange.com
10
Curriculum: Logical/Formal Methods in Security
cstheory.stackexchange.com
9
Trace Equivalence vs LTL Equivalence
cstheory.stackexchange.com
9
What do we know about restricted versions of the halting problem
cstheory.stackexchange.com
8
About the correspondence of left introduction and elimination of implication in Sequent Calculus and in Natural Deduction resp.
cstheory.stackexchange.com
8
Translating HORNSAT to SAT, revisited
cstheory.stackexchange.com
7
Algorithms from the Book
cstheory.stackexchange.com
5
formal rules for avoiding bound/unbound variable problems in lambda calculus
math.stackexchange.com
5
Languages and their operations: determining equivalence
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com
math.stackexchange.com