Question

What is this ambiguous computational existence in the positive integers?

score 72 · Answer 1 · 2013-07-26 06:59:55

72

Views

What is this ambiguous computational existence in the positive integers?

Published on 26 Jul 2013 - 6:59

score 754 · Answer 2 · 2013-07-28 07:18:07

754

Views

How complex are natural deduction proofs compared to sequent calculus proofs without cut?

Published on 28 Jul 2013 - 7:18

score 137 · Answer 3 · 2013-07-29 06:16:48

137

Views

Why base analysis on the natural numbers rather than on sets?

Published on 29 Jul 2013 - 6:16

score 318 · Answer 4 · 2013-08-12 07:47:04

318

Views

How are sets "trees with no symmetries"

Published on 12 Aug 2013 - 7:47

score 571 · Answer 5 · 2013-08-14 00:58:06

571

Views

Do the axiom of choice and its negation have contradictory consequences for arithmetic?

Published on 14 Aug 2013 - 0:58

score 157 · Answer 6 · 2026-03-25 22:11:07

157

Views

From a foundational point of view, what's a good specification language for formal systems?

Published on 25 Mar 2026 - 22:11

score 655 · Answer 7 · 2026-03-30 17:41:51

655

Views

Is it possible to formalize (higher) category theory as a one-sorted theory, just like we did with set theory?

Published on 30 Mar 2026 - 17:41

score 213 · Answer 8 · 2013-08-23 04:06:11

213

Views

Is there a simple formalism in which self-referential definitions can be made safely?

Published on 23 Aug 2013 - 4:06

score 895 · Answer 9 · 2013-08-28 13:42:52

895

Views

Foundation of category theory

Published on 28 Aug 2013 - 13:42

score 345 · Answer 10 · 2013-08-28 17:34:33

345

Views

Are there theorems of mathematics involving category theory that cannot be developed using a Grothendieck paraphrase?

Published on 28 Aug 2013 - 17:34

score 378 · Answer 11 · 2026-03-30 00:05:37

378

Views

Is it possible to formalize a "universe" of categories as a one-sorted first-order theory with one binary relation and no functions?

Published on 30 Mar 2026 - 0:05

score 202 · Answer 12 · 2013-09-03 14:47:27

202

Views

The principle of equivalence and skeletal categories

Published on 03 Sep 2013 - 14:47

score 813 · Answer 13 · 2026-03-26 06:07:07

813

Views

What are the advantages of proof-relevant mathematics?

Published on 26 Mar 2026 - 6:07

score 2k · Answer 14 · 2026-03-28 05:00:48

2k

Views

Can we prove that odd and even numbers alternate without using induction?

Published on 28 Mar 2026 - 5:00

score 304 · Answer 15 · 2026-03-27 21:16:49

304

Views

differentiate the terms deductive system, model/structure, formal system, first-order logic

Published on 27 Mar 2026 - 21:16

List Question

What is this ambiguous computational existence in the positive integers?

How complex are natural deduction proofs compared to sequent calculus proofs without cut?

Why base analysis on the natural numbers rather than on sets?

How are sets "trees with no symmetries"

Do the axiom of choice and its negation have contradictory consequences for arithmetic?

From a foundational point of view, what's a good specification language for formal systems?

Is it possible to formalize (higher) category theory as a one-sorted theory, just like we did with set theory?

Is there a simple formalism in which self-referential definitions can be made safely?

Foundation of category theory

Are there theorems of mathematics involving category theory that cannot be developed using a Grothendieck paraphrase?

Is it possible to formalize a "universe" of categories as a one-sorted first-order theory with one binary relation and no functions?

The principle of equivalence and skeletal categories

What are the advantages of proof-relevant mathematics?

Can we prove that odd and even numbers alternate without using induction?

differentiate the terms deductive system, model/structure, formal system, first-order logic

Trending Questions

Popular # Hahtags

Popular Questions