The Equivalence of Equational and Sentential General Recursive Arithmetics

DOI10.1112/JLMS/S2-14.3.463MaRDI QIDQ4120573zbMATH OpenOpenAlexFDO

Authors W. J. Ryan

Publication date 1976

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-14.3.463

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Goldbach-type theorems; other additive questions involving primes (11P32) Applications of computability and recursion theory (03D80) Proof theory and constructive mathematics (03F99) Connections of number theory and logic (11U99)

This page was built for publication: The Equivalence of Equational and Sentential General Recursive Arithmetics

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