David Corfield
n-theory

From Mike Shulman’s nn-theory account. Some slides here.

Rather than see his account as providing a classification system, as with animal species, note that the 3-theories he discusses are arranged in terms of greater expressivity. Perhaps better to see this in terms of restrictions.

Leaving aside multiple consequents for the moment (for classical theories), modal DTT as a 3-theory can be restricted by

  1. Only allow one mode, so no modality. (DTT)
  2. Only allow one level of dependency
  3. Allow no dependency (Simple)
  4. Only allow one premise (Unary)
  5. Force dependent types to be propositions (Typed FOL)
  6. Force all types to be propositions (Propositional logic)
  7. Only allow one non-dependent type (FOL)

Some of these (the first 4) are specifications for a 3-theory, some for a 2-theory.

So it’s not that ordinary FOL is untyped. It’s unimoded, one non-dependent typed forced to be set, and dependent types are forced to be propositions.

Propositional logic is unimoded, no dependency, all types are propositions.

Restrictions then dictate what it is possible to express within the 2-theories.

Can’t I have one layer of dependency, no restriction to propositions in dependent types? Can I force types to be sets?

Why not take modal DTT as primary? What are the type formation rules? Do those for other logics just arise through restriction.

FOL as a 2-theory

The unique non-dependent type is not mentioned, but there are variables of that type available. No need to mention elements of a power of the domain, since these are tuples.

Don’t explicitly mention function types between powers. As for elements, if codomain is D nD^n, use nn-tuples. For elements of types [D n,D][D^n, D] use function (n>0)(n \gt 0), and constant symbols (n=0)(n=0).

Don’t mention PropProp as a type. Dependent propositions are relations (n>1)(n \gt 1), predicates (n=1)(n =1), propositions (n=0)(n = 0). Since propositions, sub-singletons, don’t mention their elements. Their appearance indicates truth. Don’t mention the propositions, 00 and 11.

Product, function, sum, identity type are reflected to propositions in FOL as conjunction, implication, disjunction, equality.

Dependent product as universal quantification. Dependent sum as comprehension. Inhabited dependent sum as existential quantifier.

For single non-dependent type of FOL which is a set, x=yx=y is a prop. No need for equality within its dependent props since sub-singletons.

What of univalent universe, HITs? Don’t usually have type PropProp, but it explains relations as D nPropD^n \to Prop. HOL requires such a universe.

The unspecified type of everything, DD, encourages us not to ask what it is to be a member, whereas in a type theory we have the types that are generated by the system and then add in extra ones with rules. See univocal-equivocal.

This leads to a wish to exceed DD as in free logic.

Propositional logic as a 2-theory

A simple type theory, so no dependency, where types are restricted to being propositions, 00-ary relations.

Has as models the (1,2)-category of Boolean algebras.

A propositional 1-theory specifies types (propositions) and axioms. Has as models a (0,1)-category or (poset), lines of the truth table ordered by <\bottom \lt \top.

Last revised on May 2, 2021 at 03:20:41. See the history of this page for a list of all contributions to it.