Kaveh

less info
meta site favicon meta user | stack exchange network profile network profile
1,929 reputation
921
bio website
location Toronto, Canada
age
visits member for 2 years, 10 months
seen May 17 at 20:32
stats profile views 376

PhD student at University of Toronto, Department of Computer Science, Theory Group.

Moderator on cstheory.


77 Answers

newest activity votes
14
How to prove the mathematical induction is true?
6
Definition of time-constructible function
6
First-Order Logic vs. Second-Order Logic
6
Is there a connection between length of sentence and length of proof?
5
Why accept the axiom of infinity?
5
Why do statements which appear elementary have complicated proofs?
5
Tips for constructing basic loop invariants?
5
Which one result in maths has surprised you the most?
4
Arithmetical hierarchy and skolemization
4
Learning how to prove that a function can't proved total?
4
Why is integer factorization considered to be in NP if a quantum computer can compute a factorization in polynomial time?
4
Does DTIME(O(n)) = REGULAR?
4
Are proofs by induction inferior to other proofs?
3
Are PA and ZFC examples of logical systems?
3
Ultrafinitism and the denial of existence of $\lfloor e^{e^{e^{79}}} \rfloor$
3
Solving P vs NP with computer
3
The number of equivalence classes of finite symmetric difference relation
3
Consistency of Peano axioms (Hilbert's second problem)?
3
A few questions about intuitionistic mathematics
3
Definition of “non-constructive proof”
3
Difference between undecidable statements in set-theory and number theory?
3
Are there any strongly axiomatizable logics that are not compact?
2
For arbitrary theories T and S, is it meaningful to say “T proves the consistency of S”?
2
Why Savitch's theorem doesn't prove that NL = L?
2
What are the reasons for not supporting constructive mathematics
2
Can the principle of explosion be removed from constructive logic?
2
If $T$ proves $\operatorname{Con}(ZFC)$, is $T$ at least as strong as set theory?
2
Proving Recursive Functions are Representable in R
2
What are the prerequisites in order to pursue the P vs. NP problem?
2
What makes higher/second-order logic incompatible with completeness theorem?
1 2 3