Skip to main content
http -> https (the question was bumped anyway)
Source Link
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40

Previous MO questions:

M.SE:

TCS.SE:

  • "… one of the most amazing facts about logic is that consistency strength boils down to the question "what is the fastest-growing function you can prove total in this logic?" As a result, the consistency of many classes of logics can be linearly ordered! If you have an ordinal notation capable of describing the fastest growing functions your two logics can show total, then you know by trichotomy that either one can prove the consistency of the other, or they are equiconsistent." Answer by Neel Krishnaswami to Axioms necessary for theoretical computer science

A frequently cited paper: Caicedo and Ketchersid, "A trichotomy theorem in natural models of AD+A trichotomy theorem in natural models of AD+", in "Set Theory and Its Applications", Contemporary Mathematics, vol. 533, Amer. Math. Soc., Providence, RI, 2011, pp. 227–258.

Previous MO questions:

M.SE:

TCS.SE:

  • "… one of the most amazing facts about logic is that consistency strength boils down to the question "what is the fastest-growing function you can prove total in this logic?" As a result, the consistency of many classes of logics can be linearly ordered! If you have an ordinal notation capable of describing the fastest growing functions your two logics can show total, then you know by trichotomy that either one can prove the consistency of the other, or they are equiconsistent." Answer by Neel Krishnaswami to Axioms necessary for theoretical computer science

A frequently cited paper: Caicedo and Ketchersid, "A trichotomy theorem in natural models of AD+", in "Set Theory and Its Applications", Contemporary Mathematics, vol. 533, Amer. Math. Soc., Providence, RI, 2011, pp. 227–258.

Previous MO questions:

M.SE:

TCS.SE:

  • "… one of the most amazing facts about logic is that consistency strength boils down to the question "what is the fastest-growing function you can prove total in this logic?" As a result, the consistency of many classes of logics can be linearly ordered! If you have an ordinal notation capable of describing the fastest growing functions your two logics can show total, then you know by trichotomy that either one can prove the consistency of the other, or they are equiconsistent." Answer by Neel Krishnaswami to Axioms necessary for theoretical computer science

A frequently cited paper: Caicedo and Ketchersid, "A trichotomy theorem in natural models of AD+", in "Set Theory and Its Applications", Contemporary Mathematics, vol. 533, Amer. Math. Soc., Providence, RI, 2011, pp. 227–258.

Links, while this is on the front page
Source Link
LSpice
  • 12.9k
  • 4
  • 45
  • 69
A frequently cited paper: "A trichotomy theorem in natural models of AD+", in "Set Theory and Its Applications", Contemporary Mathematics, vol. 533, Amer. Math. Soc., Providence, RI, 2011, pp. 227-258.

A frequently cited paper: Caicedo and Ketchersid, "A trichotomy theorem in natural models of AD+", in "Set Theory and Its Applications", Contemporary Mathematics, vol. 533, Amer. Math. Soc., Providence, RI, 2011, pp. 227–258.

  • "one of the most amazing facts about logic is that consistency strength boils down to the question "what is the fastest-growing function you can prove total in this logic?" As a result, the consistency of many classes of logics can be linearly ordered! If you have an ordinal notation capable of describing the fastest growing functions your two logics can show total, then you know by trichotomy that either one can prove the consistency of the other, or they are equiconsistent." https://cstheory.stackexchange.com/questions/4816/axioms-necessary-for-theoretical-computer-science/4821
A frequently cited paper: "A trichotomy theorem in natural models of AD+", in "Set Theory and Its Applications", Contemporary Mathematics, vol. 533, Amer. Math. Soc., Providence, RI, 2011, pp. 227-258.
  • "… one of the most amazing facts about logic is that consistency strength boils down to the question "what is the fastest-growing function you can prove total in this logic?" As a result, the consistency of many classes of logics can be linearly ordered! If you have an ordinal notation capable of describing the fastest growing functions your two logics can show total, then you know by trichotomy that either one can prove the consistency of the other, or they are equiconsistent." Answer by Neel Krishnaswami to Axioms necessary for theoretical computer science

A frequently cited paper: Caicedo and Ketchersid, "A trichotomy theorem in natural models of AD+", in "Set Theory and Its Applications", Contemporary Mathematics, vol. 533, Amer. Math. Soc., Providence, RI, 2011, pp. 227–258.

replaced http://mathoverflow.net/ with https://mathoverflow.net/
Source Link
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
Source Link
Loading
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
Source Link
Loading
added a bullet point
Source Link
Daniel Moskovich
  • 22.1k
  • 15
  • 139
  • 216
Loading
added 1128 characters in body
Source Link
user30304
  • 281
  • 3
  • 12
Loading
Post Made Community Wiki
Source Link
user30304
  • 281
  • 3
  • 12
Loading