Is there an agreed-upon semantic success condition for the definition of semi-simplicial types?
On Wed, Sep 21, 2016 at 2:48 PM, Dimitris Tsementzis <dtse...@princeton.edu> wrote:What I am asking for ideally is a formula P(x) of set theory that expresses “x is a successful definition of semi-simplicial types in T’’.
I think having such a formula counts as success.