@inproceedings{15f6db49d40943bab90c96e7418adb5c,
title = "A minimal computational theory of a minimal computational universe",
abstract = "In [3] a general logical framework for formalizing set theories of different strength was suggested. We here employ that framework, focusing on the exploration of computational theories. That is, theories whose set of closed terms suffices for denoting every concrete set (including infinite ones) that might be needed in applications, as well as for computations with sets. We demonstrate that already the minimal computational level of the framework, in which only a minimal computational theory and a minimal computational universe are employed, suffices for developing large portions of scientifically applicable mathematics.",
keywords = "Computational theories, Computational universes, Formalized mathematics, Rudimentary set theory",
author = "Arnon Avron and Liron Cohen",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2018.; International Symposium on Logical Foundations of Computer Science, LFCS 2018 ; Conference date: 08-01-2018 Through 11-01-2018",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-319-72056-2_3",
language = "الإنجليزيّة",
isbn = "9783319720555",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "37--54",
editor = "Anil Nerode and Sergei Artemov",
booktitle = "Logical Foundations of Computer Science - International Symposium, LFCS 2018, Proceedings",
address = "ألمانيا",
}