scientific article; zbMATH DE number 65743
From MaRDI portal
Publication:4010354
zbMATH Open0754.03018MaRDI QIDQ4010354FDOQ4010354
Authors: Solomon Feferman
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Recommendations
type theorypolymorphismPeano ArithmeticPrimitive Recursive ArithmeticRamified Analysistype formation rules
Logic in computer science (03B70) First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35)
Cited In (16)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Explicit mathematics: power types and overloading
- Proto-semantics for positive free logic
- A feasible theory of truth over combinatory algebra
- Levy and set theory
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
- 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
- Unitary Theories, Unitary Categories
- Formalizing non-termination of recursive programs
- Proof-theoretic notions for software maintenance
- Theories with self-application and computational complexity.
- 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)