User Adam

33 votes

What programming languages do mathematicians use?

answered Jan 8, 2010 at 2:39

21 votes

In set theories where Continuum Hypothesis is false, what are the new sets?

answered Dec 31, 2009 at 6:32

13 votes

Difference between turnstile and implication

answered Oct 31, 2010 at 23:02

12 votes

Categorical foundations without set theory

answered Dec 31, 2009 at 21:04

12 votes

Accepted

Russell and Whitehead's types: ramified and unramified

answered Jun 11, 2010 at 22:50

12 votes

Accepted

What are κappa-categories?

answered Aug 30, 2010 at 17:33

10 votes

What are your favorite instructional counterexamples?

answered Mar 6, 2010 at 14:10

7 votes

Logical problems in category theory

answered Jan 2, 2010 at 21:58

6 votes

What is the manner of inconsistency of Girard's paradox in Martin Lof type theory

answered Mar 13, 2010 at 21:40

6 votes

Models of ZFC Set Theory - Getting Started

answered Feb 8, 2010 at 8:55

6 votes

How would one even begin to try to prove that a simple number-theoretic statement is undecidable?

answered Jun 12, 2010 at 18:05

6 votes

Consequences of technically proving anything in Coq (on at least Linux) exploiting a bug?

answered May 3, 2011 at 20:15

5 votes

Machine model for primitive recursion?

answered Aug 17, 2011 at 17:31

5 votes

Accepted

'Closure' of CFLs under complementation and intersection

answered Jan 10, 2011 at 18:20

5 votes

What category without initial object do you care about?

answered Aug 27, 2010 at 22:02

5 votes

How do they verify a verifier of formalized proofs?

answered Mar 16, 2010 at 23:43

4 votes

What are interesting families of subsets of a given set?

answered Dec 31, 2009 at 7:03

4 votes

Accepted

Theory mainly concerned with $\lambda$-calculus?

answered Jan 15, 2010 at 16:02

3 votes

Is functional programming a branch of mathematics?

answered Jan 18, 2010 at 23:19

3 votes

Context free grammar + functions = ?

answered Feb 27, 2010 at 21:49

3 votes

Provable(P) ⇒ provable(provable(P))?

answered Dec 21, 2010 at 1:22

2 votes

Computer science for mathematicians

answered Jan 6, 2011 at 19:12

2 votes

What do I call type theory without Curry-Howard?

answered Nov 3, 2010 at 21:07

2 votes

Proper classes and their consequences

answered Dec 4, 2010 at 21:57

2 votes

How to think like a set (or a model) theorist.

answered Jun 20, 2010 at 20:29

1 vote

Can dependent sums be encoded as dependent products?

answered Feb 28, 2010 at 1:41

1 vote

Generalizations of PA and its standard and non-standard models

answered Aug 18, 2011 at 20:07

0 votes

How much of the current logic is about syntax?

answered Jan 18, 2010 at 23:24

Stack Exchange Network

28 Answers

What programming languages do mathematicians use?

In set theories where Continuum Hypothesis is false, what are the new sets?

Difference between turnstile and implication

Categorical foundations without set theory

Russell and Whitehead's types: ramified and unramified

What are κappa-categories?

What are your favorite instructional counterexamples?

Logical problems in category theory

What is the manner of inconsistency of Girard's paradox in Martin Lof type theory

Models of ZFC Set Theory - Getting Started

How would one even begin to try to prove that a simple number-theoretic statement is undecidable?

Consequences of technically proving anything in Coq (on at least Linux) exploiting a bug?

Machine model for primitive recursion?

'Closure' of CFLs under complementation and intersection

What category without initial object do you care about?

How do they verify a verifier of formalized proofs?

What are interesting families of subsets of a given set?

Theory mainly concerned with $\lambda$-calculus?

Is functional programming a branch of mathematics?

Context free grammar + functions = ?

Provable(P) ⇒ provable(provable(P))?

Computer science for mathematicians

What do I call type theory without Curry-Howard?

Proper classes and their consequences

How to think like a set (or a model) theorist.

Can dependent sums be encoded as dependent products?

Generalizations of PA and its standard and non-standard models

How much of the current logic is about syntax?