Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

3
  • 1
    $\begingroup$ Herman Geuvers has also proven (here) that no possible encoding of the natural numbers can work. $\endgroup$ Commented Jan 16, 2017 at 20:20
  • $\begingroup$ @cody Geuvers' result is for second-order dependent types. Is it obvious that it generalises to higher-order dependent types? $\endgroup$ Commented Jan 17, 2017 at 12:58
  • 1
    $\begingroup$ It's not obvious, no. I do think the model construction outlined in the paper generalizes though, as it's based on a model originally developed for the full calculus. $\endgroup$ Commented Jan 17, 2017 at 15:28