Skip to main content
8 of 8
http -> https (the question was bumped anyway)
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+", in "Set Theory and Its Applications", Contemporary Mathematics, vol. 533, Amer. Math. Soc., Providence, RI, 2011, pp. 227–258.

user30304
  • 281
  • 3
  • 12