On the Equivalence Between Logic-Free and Logic-Bearing Systems of Primitive Recursive Arithmetic

DOI10.1002/MALQ.19870330308MaRDI QIDQ3754615zbMATH OpenOpenAlexFDO

Authors Daniel G. Schwartz

Publication date 1987

Published in Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19870330308

zbMATH Keywords

primitive recursive arithmeticequation calculifree-variable theory

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Recommendations

• A Free-Variable Theory of Primitive Recursive Arithmetic
• On some generalizations of the primitive recursive arithmetic
• scientific article; zbMATH DE number 52595
• scientific article; zbMATH DE number 3902640
• scientific article; zbMATH DE number 3557765

Cited in

(3)

• A Free-Variable Theory of Primitive Recursive Arithmetic
• scientific article; zbMATH DE number 1916517 (Why is no real title available?)
• The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)

This page was built for publication: On the Equivalence Between Logic-Free and Logic-Bearing Systems of Primitive Recursive Arithmetic

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