(in category theory/type theory/computer science)
of all homotopy types
of (-1)-truncated types/h-propositions
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
topology (point-set topology, point-free topology)
see also differential topology, algebraic topology, functional analysis and topological homotopy theory
Basic concepts
fiber space, space attachment
Extra stuff, structure, properties
Kolmogorov space, Hausdorff space, regular space, normal space
sequentially compact, countably compact, locally compact, sigma-compact, paracompact, countably paracompact, strongly compact
Examples
Basic statements
closed subspaces of compact Hausdorff spaces are equivalently compact subspaces
open subspaces of compact Hausdorff spaces are locally compact
compact spaces equivalently have converging subnet of every net
continuous metric space valued function on compact metric space is uniformly continuous
paracompact Hausdorff spaces equivalently admit subordinate partitions of unity
injective proper maps to locally compact spaces are equivalently the closed embeddings
locally compact and second-countable spaces are sigma-compact
Theorems
Analysis Theorems
analysis (differential/integral calculus, functional analysis, topology)
metric space, normed vector space
open ball, open subset, neighbourhood
convergence, limit of a sequence
compactness, sequential compactness
continuous metric space valued function on compact metric space is uniformly continuous
…
…
constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
A -frame of propositions is a -subframe of the frame of truth values .
However, in dependent type theory, many times we do not have access to the frame of truth values - which is the type of all propositions in dependent type theory - because, for example, we want to have canonicity in the dependent type theory, which propositional resizing violates.
Thus, it is beneficial to be able to define a -frame of propositions without the need for a type of all propositions , because it will allow us to define lower, upper, and two-sided -Dedekind cuts as well as -admissible Archimedean ordered fields, key concepts in predicative constructive real analysis.
A -frame of propositions consists of
a type
a type family satisfying the univalence axiom such that each is a subsingleton or h-proposition,
an element such that is an singleton or contractible type
a function such that for all and ,
an element such that
a function such that for all and ,
a function such that for all sequences ,
The type of all propositions, if it exists, is the terminal -frame of propositions.
Assuming the limited principle of omniscience, the boolean domain is a -frame of propositions.
Created on December 20, 2024 at 03:43:58. See the history of this page for a list of all contributions to it.