A Decidable Fragment of Recursive Arithmetic

DOI10.1002/MALQ.19630091203zbMATH Open0114.24801OpenAlexW2001704454MaRDI QIDQ5722258

Reuben Goodstein

Publication date: 1963

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

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

zbMATH Keywords

mathematical logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items (3)

Title not available (Why is that?) ⋮ Decidability properties for fragments of CHR ⋮ Tractable fragments of Presburger arithmetic

This page was built for publication: A Decidable Fragment of Recursive Arithmetic

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