scientific article
From MaRDI portal
Publication:3757915
zbMath0621.03040MaRDI QIDQ3757915
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
constructive type theoryPeano ArithmeticTuring Machinecomputer programmingconstrutive mathematicstype-free logical systems
Specification and verification (program logics, model checking, etc.) (68Q60) Second- and higher-order arithmetic and fragments (03F35)
Related Items (12)
Realizability interpretation of generalized inductive definitions ⋮ Partial Horn logic and Cartesian categories ⋮ Operational closure and stability ⋮ The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories ⋮ The provably terminating operations of the subsystem PETJ of explicit mathematics ⋮ Theories with self-application and computational complexity. ⋮ On Feferman's operational set theory \textsf{OST} ⋮ A proof-theoretic characterization of the basic feasible functionals ⋮ Explicit mathematics: power types and overloading ⋮ Full operational set theory with unbounded existential quantification and power set ⋮ Towards a computation system based on set theory ⋮ Applicative theories for logarithmic complexity classes
This page was built for publication:
