A Free-Variable Theory of Primitive Recursive Arithmetic
From MaRDI portal
Recommendations
- Semantic Completeness of Free-Variable Theories
- On the Equivalence Between Logic-Free and Logic-Bearing Systems of Primitive Recursive Arithmetic
- On some generalizations of the primitive recursive arithmetic
- scientific article; zbMATH DE number 3902640
- Undecidable complexity statements in -arithmetic
Cited in
(13)- On some generalizations of the primitive recursive arithmetic
- The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)
- Undecidable complexity statements in -arithmetic
- scientific article; zbMATH DE number 3902640 (Why is no real title available?)
- On the Equivalence Between Logic-Free and Logic-Bearing Systems of Primitive Recursive Arithmetic
- Semantic Completeness of Free-Variable Theories
- scientific article; zbMATH DE number 4035827 (Why is no real title available?)
- scientific article; zbMATH DE number 4072948 (Why is no real title available?)
- scientific article; zbMATH DE number 14544 (Why is no real title available?)
- A Free Variable Version of the First-Order Predicate Calculus
- scientific article; zbMATH DE number 1916517 (Why is no real title available?)
- First-order reasoning and primitive recursive natural number notations
- Finitary consistency of a free arithmetic
This page was built for publication: A Free-Variable Theory of Primitive Recursive Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3762310)
