Publication:3757915
From MaRDI portal
zbMath0621.03040MaRDI QIDQ3757915
Publication date: 1986
constructive type theory; Peano Arithmetic; Turing Machine; computer programming; construtive mathematics; type-free logical systems
68Q60: Specification and verification (program logics, model checking, etc.)
03F35: Second- and higher-order arithmetic and fragments
Related Items
Explicit mathematics: power types and overloading, A proof-theoretic characterization of the basic feasible functionals, Partial Horn logic and Cartesian categories, Full operational set theory with unbounded existential quantification and power set, Realizability interpretation of generalized inductive definitions, Theories with self-application and computational complexity., Towards a computation system based on set theory, On Feferman's operational set theory \textsf{OST}