natural deduction metalanguage, practical foundations
type theory (dependent, intensional, observational type theory, homotopy type theory)
computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory
Let be the set of natural numbers, and let be an arbitrary set. Then sequence extensionality states that for every sequence and , if and only if for all natural numbers .
Sequence extensionality in an arithmetic pretopos states that for every morphism and , if and only if for all morphisms .
This definition makes sense in any finitely complete category with a parameterized natural numbers object.
In dependent type theory, sequence extensionality states that given two sequences and there is an equivalence of types between the identity type and the dependent sequence type :
There is also a version of sequence extensionality for dependent sequence types called dependent sequence extensionality, which states that given two dependent sequences and there is an equivalence of types between the identity type and the dependent sequence type :
While function extensionality implies sequence extensionality, sequence extensionality is weaker than function extensionality. However, sequence extensionality is usually more relevant in dependent type theories which are strongly predicative, which usually have dependent sequence types but do not have general dependent function types.
Created on January 9, 2023 at 22:56:55. See the history of this page for a list of all contributions to it.