From mboxrd@z Thu Jan 1 00:00:00 1970 Date: Sun, 15 Oct 2017 22:30:30 -0700 (PDT) From: Andrew Polonsky To: Homotopy Type Theory Message-Id: <102b8bf4-440b-40b2-8cec-4f7bf3653518@googlegroups.com> In-Reply-To: <20171015092617.GA684@mathematik.tu-darmstadt.de> References: <7ACEB87C-CF6E-4ACC-A803-2E44D7D0374A@gmail.com> <489BE14C-B343-49D1-AB51-19CD54B04761@gmail.com> <20171015074530.GA29437@mathematik.tu-darmstadt.de> <61005fc37ae1495bb2038467222db2e7@cse.gu.se> <20171015092617.GA684@mathematik.tu-darmstadt.de> Subject: Re: [HoTT] A small observation on cumulativity and the failure of initiality MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="----=_Part_20353_779352808.1508131830484" ------=_Part_20353_779352808.1508131830484 Content-Type: multipart/alternative; boundary="----=_Part_20354_1906146049.1508131830484" ------=_Part_20354_1906146049.1508131830484 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 7bit In the set-thoretic model -- which is the simplest, most "standard" model one can think of -- the universes are indeed cumulative, and "coherence" is just the observation that conversion (definitional equality) of raw terms is preserved by the interpretation function. In categorical models, strict equality between interpreted objects is perhaps a more subtle concept. Still, it would seem to be a natural requirement of *ANY* class or flavor of semantics, that expressions which are definitionally equal in the object language, are evaluated to entities which are again (judgmentally) equal on the meta-level. This really amounts to nothing more than asking that the semantics in question actually validate the conversion rule -- one of the structural rules of the theory. Best, Andrew On Sunday, October 15, 2017 at 11:26:22 AM UTC+2, Thomas Streicher wrote: > > > A quite detailed interpretation of type theory in set theory is > presented > > > > in the paper of Peter Aczel "On Relating Type Theories and Set > Theories". > > > > On can define directly the interpretation of lambda terms (provided that > abstraction is > > > > typed), and using set theoretic coding, one can use a global application > operation > > > > (so that the interpretation is total). One can then checked by induction > on derivations > > > > that all judgements are valid for this interpretation. > > Thanks, Thierry, for pointing this out. But Peter's method does not > extend to arbitrary split models of dependent type theory. What Peter > uses here intrinsically is that everything is a set since otherwise he > couldn't interpret type theoretic quantification. > My interpretation got partial on pseudoexpressions since pseudoterms > can't be understood as pseudo-type-expressions. > > I don't see how Peter's method extends to interpretation of > realizability or (pre)sheaf models of dependent type theories not to > speak of arbitrary contextual cats or other split categorical models > of dependent type theories. > > Thomas > ------=_Part_20354_1906146049.1508131830484 Content-Type: text/html; charset=utf-8 Content-Transfer-Encoding: quoted-printable
In the set-thoretic model -- which is the simplest, most &= quot;standard" model one can think of -- the universes are indeed cumu= lative, and "coherence" is just the observation that conversion (= definitional equality) of raw terms is preserved by the interpretation func= tion.

In categorical models, strict equality between int= erpreted objects is perhaps a more subtle concept.

Still, it would seem to be a natural requirement of *ANY* class or flavor = of semantics, that expressions which are definitionally equal in the object= language, are evaluated to entities which are again (judgmentally) equal o= n the meta-level.

This really amounts to nothing m= ore than asking that the semantics in question actually validate the conver= sion rule -- one of the structural rules of the theory.

Best,
Andrew


On Sunday, October 15, 2017 = at 11:26:22 AM UTC+2, Thomas Streicher wrote:
> =C2=A0A quite detailed interpretation of type theory in= set theory is presented
>=20
> in the paper of Peter Aczel "On Relating Type Theories and Se= t Theories".
>=20
> On can define directly the interpretation of lambda terms (provide= d that abstraction is
>=20
> typed), and using set theoretic coding, one can use a global appli= cation operation
>=20
> (so that the interpretation is total). One can then checked by ind= uction on derivations
>=20
> that all judgements are valid for this interpretation.

Thanks, Thierry, for pointing this out. But Peter's method does not
extend to arbitrary split models of dependent type theory. What Peter
uses here intrinsically is that everything is a set since otherwise he
couldn't interpret type theoretic quantification.
My interpretation got partial on pseudoexpressions since pseudoterms
can't be understood as pseudo-type-expressions.

I don't see how Peter's method extends to interpretation of
realizability or (pre)sheaf models of dependent type theories not to
speak of arbitrary contextual cats or other split categorical models
of dependent type theories.

Thomas
------=_Part_20354_1906146049.1508131830484-- ------=_Part_20353_779352808.1508131830484--