Fragments of arithmetic and pairing functions

DOI10.1016/S0764-4442(01)02151-6MaRDI QIDQ2765865zbMATH OpenFDO

Authors Yerzhan Baisalov

Publication date 22 July 2002

Published in Comptes Rendus de l'Académie des Sciences. Série I. Mathématique (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0764-4442(01)02151-6

zbMATH Keywords

decidabilityfragments of arithmeticpairing function

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Models of arithmetic and set theory (03C62) First-order arithmetic and fragments (03F30)

Recommendations

• Decidability of the theory of the natural integers with the Cantor pairing function and the successor
• Majorizing provably recursive functions in fragments of PA
• Minimum-complexity pairing functions
• scientific article; zbMATH DE number 440479
• scientific article; zbMATH DE number 5292707

Cited in

(4)

• Minimum-complexity pairing functions
• scientific article; zbMATH DE number 1512848 (Why is no real title available?)
• Decidability of the theory of the natural integers with the Cantor pairing function and the successor
• Fragments of arithmetic

This page was built for publication: Fragments of arithmetic and pairing functions

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