scientific article; zbMATH DE number 65743

MaRDI QIDQ4010354zbMATH OpenFDO

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)

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

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)