nLab simplicial type theory

Contents

Context

Type theory

natural deduction metalanguage, practical foundations

judgement
hypothetical judgement, sequent
- antecedents $\vdash$ consequent, succedents

type theory (dependent, intensional, observational type theory, homotopy type theory)

calculus of constructions

syntax object language

theory, axiom
proposition/type (propositions as types)
definition/proof/program (proofs as programs)
theorem

computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory

logic	category theory	type theory
true	terminal object/(-2)-truncated object	h-level 0-type/unit type
false	initial object	empty type
proposition	(-1)-truncated object	h-proposition, mere proposition
proof	generalized element	program
cut rule	composition of classifying morphisms / pullback of display maps	substitution
cut elimination for implication	counit for hom-tensor adjunction	beta reduction
introduction rule for implication	unit for hom-tensor adjunction	eta conversion
logical conjunction	product	product type
disjunction	coproduct ((-1)-truncation of)	sum type (bracket type of)
implication	internal hom	function type
negation	internal hom into initial object	function type into empty type
universal quantification	dependent product	dependent product type
existential quantification	dependent sum ((-1)-truncation of)	dependent sum type (bracket type of)
equivalence	path space object	identity type/path type
equivalence class	quotient	quotient type
induction	colimit	inductive type, W-type, M-type
higher induction	higher colimit	higher inductive type
-	0-truncated higher colimit	quotient inductive type
coinduction	limit	coinductive type
preset		type without identity types
completely presented set	discrete object/0-truncated object	h-level 2-type/set/h-set
set	internal 0-groupoid	Bishop set/setoid
universe	object classifier	type of types
modality	closure operator, (idempotent) monad	modal type theory, monad (in computer science)
linear logic	(symmetric, closed) monoidal category	linear type theory/quantum computation
proof net	string diagram	quantum circuit
(absence of) contraction rule	(absence of) diagonal	no-cloning theorem
	synthetic mathematics	domain specific embedded programming language

homotopy levels

semantics

Edit this sidebar

Idea
See also
References

Idea

Simplicial type theory (Riehl & Shulman 2017, §3) is a homotopy type theory which introduces additional non-fibrant layers on top of Martin-Löf type theory to provide a logical calculus for a directed interval type and with it for geometric shapes, consisting of cube judgments, tope judgments, inequality topes, extension types, Segal space-types, Rezk complete-types, and covariant fibrations.

References

Emily Riehl, Michael Shulman, A type theory for synthetic $\infty$ -categories $[$ arXiv:1705.07442 $]$
Jonathan Weinberger, A Synthetic Perspective on $(\infty,1)$ -Category Theory: Fibrational and Semantic Aspects $[$ arXiv:2202.13132 $]$
Jonathan Weinberger, Strict stability of extension types $[$ arXiv:2203.07194 $]$

A proof assistant implementing simplicial type theory:
rzk

Last revised on June 21, 2022 at 01:30:47. See the history of this page for a list of all contributions to it.