**constructive mathematics**, **realizability**, **computability**

propositions as types, proofs as programs, computational trinitarianism

*Synthetic computability theory* is the study of computability theory synthetically axiomatized by structures present in the effective topos or other toposes of computable structures, rather than by analytic construction such as Turing machines or lambda calculus.

- Andrej Bauer,
*First steps in synthetic computability theory*, ENTCS, Vol 155, 2006, doi:10.1016/j.entcs.2005.11.049

Last revised on May 19, 2022 at 09:56:10. See the history of this page for a list of all contributions to it.