scientific article

zbMath0754.03018MaRDI QIDQ4010354

Solomon Feferman

Publication date: 27 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polymorphismPeano Arithmetictype theoryPrimitive Recursive ArithmeticRamified Analysistype formation rules

Mathematics Subject Classification ID

Logic in computer science (03B70) First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35)

Related Items (11)

Unitary Theories, Unitary Categories ⋮ Formalizing non-termination of recursive programs ⋮ A feasible theory of truth over combinatory algebra ⋮ Systems of explicit mathematics with non-constructive \(\mu\)-operator. II ⋮ Theories with self-application and computational complexity. ⋮ Proof-theoretic notions for software maintenance ⋮ Explicit mathematics: power types and overloading ⋮ Axioms for strict and lazy functional programs ⋮ Levy and set theory ⋮ Proto-semantics for positive free logic ⋮ Systems of explicit mathematics with non-constructive \(\mu\)-operator. I

This page was built for publication: