scientific article; zbMATH DE number 65743

zbMATH Open0754.03018MaRDI QIDQ4010354FDOQ4010354

Authors Solomon Feferman

Publication date 27 September 1992

zbMATH Keywords

type theorypolymorphismPeano ArithmeticPrimitive 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)

Recommendations

• scientific article; zbMATH DE number 432705
• Publication:3478384
• Typed Lambda Calculi and Applications
• Weak theories of operations and types
• scientific article; zbMATH DE number 47007

Cited in

(17)

• Levy and set theory
• Axioms for strict and lazy functional programs
• Termination analysis for functional programs
• Tiered arithmetics
• Systems of explicit mathematics with non-constructive \(\mu\)-operator. II
• Proof-theoretic notions for software maintenance
• Explicit mathematics: power types and overloading
• Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
• Theories with self-application and computational complexity.
• Automatic Termination Verification for Higher-Order Functional Programs
• A feasible theory of truth over combinatory algebra
• scientific article; zbMATH DE number 432705 (Why is no real title available?)
• scientific article; zbMATH DE number 1870414 (Why is no real title available?)
• Unitary theories, unitary categories
• Formalizing non-termination of recursive programs
• Proto-semantics for positive free logic
• Classical predicative logic-enriched type theories

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4010354)