The provably total functions of basic arithmetic and its extensions

DOI10.1007/S00153-024-00939-0MaRDI QIDQ7026085zbMATH OpenFDO

Authors Mohammad Ardeshir, Erfan Khaniki, Mohsen Shahriari

Publication date 18 February 2025

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00153-024-00939-0

zbMATH Keywords

basic arithmeticbasic logicconstructive mathematicsHeyting arithmeticMatiyasevich theoremprimitive recursive functionprovably total function

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Metamathematics of constructive systems (03F50)

Cites work

• A counterexample to polynomially bounded realizability of basic arithmetic
• An Introduction to Basic Arithmetic
• Basic predicate calculus
• Classical and intuitionistic models of arithmetic
• Diophantine induction
• Fragments of HA based on \(\Sigma_ 1\)-induction
• Handbook of Spatial Logics
• scientific article; zbMATH DE number 3784875 (Why is no real title available?)
• scientific article; zbMATH DE number 30929 (Why is no real title available?)
• scientific article; zbMATH DE number 51556 (Why is no real title available?)
• scientific article; zbMATH DE number 1215493 (Why is no real title available?)
• scientific article; zbMATH DE number 1144041 (Why is no real title available?)
• Intuitionistic validity in \(T\)-normal Kripke structures
• Polynomially bounded recursive realizability
• Proof theory. 2nd ed
• Provably total functions of Basic Arithmetic

This page was built for publication: The provably total functions of basic arithmetic and its extensions

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