Computability, finiteness and the standard model of arithmetic

DOI10.1007/978-3-319-31644-4_16MaRDI QIDQ3295828zbMATH OpenOpenAlexFDO

Authors Massimiliano Carrara, Matteo Plebani, Enrico Martino

Publication date 13 July 2020

Published in Boston Studies in the Philosophy and History of Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2318/1730727

zbMATH Keywords

computational structuralismfinitenessstandard model of arithmetic

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05)

Recommendations

• Vom Zählen zu den Zahlen: on the relation between computation and arithmetical structuralism
• Models and computability
• scientific article; zbMATH DE number 1254480
• Computational Structuralism†
• Formalization, syntax and the standard model of arithmetic

Cites work

• Computational Structuralism†
• scientific article; zbMATH DE number 3291106 (Why is no real title available?)
• Kreisel, the continuum hypothesis and second order set theory
• Models and computability
• Models and reality
• The philosophical significance of Tennenbaum's theorem
• The structuralist view of mathematical objects
• Truth and the absence of fact
• Vom Zählen zu den Zahlen: on the relation between computation and arithmetical structuralism

Cited in

(8)

• Arithmetic Sinn and Effectiveness
• Models and computability
• On live and dead signs in mathematics
• scientific article; zbMATH DE number 1531922 (Why is no real title available?)
• Vom Zählen zu den Zahlen: on the relation between computation and arithmetical structuralism
• Finiteness and computation in toposes
• Computational Structuralism†
• Formalization, syntax and the standard model of arithmetic

This page was built for publication: Computability, finiteness and the standard model of arithmetic

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