Recursive number theory. A development of recursive arithmetic in a logic-free equation calculus
From MaRDI portal
(Redirected from Publication:768371)
Cited in
(23)- Equational calculus for primitive recursive rational-valued functions
- Primitive recursive arithmetic and its role in the foundations of arithmetic: historical and philosophical reflections
- The Imandra Automated Reasoning System (System Description)
- The primitive recursive analysis of ordinary differential equations and the complexity of their solutions
- On some generalizations of the primitive recursive arithmetic
- Cartesian categories with natural numbers object
- A version of the ∑1-reflection principle for CFA provable in PRA
- On the complexity of cutting-plane proofs
- Equational calculi for Grzegorczyk's classes \(\mathcal E^n\)
- Studies in constructive mathematics and mathematical logic. Part IX
- On a finitary version of mathematical analysis
- Unary primitive recursive functions
- Eta-rules in Martin-Löf type theory
- Two (or three) notions of finitism
- Canonical recursive functions and operations
- Modal functions for concise definition of state machines and products
- Georg Cantor as the author of constructions playing fundamental roles in constructive mathematics
- The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)
- R. L. Goodstein and mathematical logic
- Dual realizability in symmetric logic
- Kurt Gödel on logical, theological, and physical antinomies
- Aspects of categorical recursion theory
- Eine Art von Gleichwertigkeit Zahlentheoretischer und Mengentheoretischer Axiomensysteme
This page was built for publication: Recursive number theory. A development of recursive arithmetic in a logic-free equation calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q768371)
