Finitism, imperative programs and primitive recursion

DOI10.1093/LOGCOM/EXAA076MaRDI QIDQ5028315zbMATH OpenOpenAlexFDO

Authors Daniel M. Leivant

Publication date 8 February 2022

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exaa076

zbMATH Keywords

finite partial functionsfinitismimperative programmingloop variantParsons' theoremprimitive recursive arithmeticprimitive recursive functions

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Recursive functions and relations, subrecursive hierarchies (03D20) First-order arithmetic and fragments (03F30)

Recommendations

• Finitism, imperative programs and primitive recursion
• scientific article; zbMATH DE number 5054077
• scientific article; zbMATH DE number 1870429
• Primitive recursive arithmetic and its role in the foundations of arithmetic: historical and philosophical reflections
• scientific article; zbMATH DE number 1254487

Cited in

(5)

• Finitism, imperative programs and primitive recursion
• Two (or three) notions of finitism
• scientific article; zbMATH DE number 1254487 (Why is no real title available?)
• Strict finitism and feasibility
• Computably and punctually universal spaces

This page was built for publication: Finitism, imperative programs and primitive recursion

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