Paper Info
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.
Year
DOI
Venue
2018
10.1007/978-3-319-72056-2_3
Lecture Notes in Computer Science
Keywords
Field
DocType
Formalized mathematics,Computational theories,Computational universes,Rudimentary set theory
Discrete mathematics,Applicable mathematics,Computational physics,Computer science,Digital physics,Theoretical computer science,Logical framework,Computational resource,Theory of computation,Computation
Conference
Volume
ISSN
Citations 
10703
0302-9743
0
PageRank 
References 
Authors
0.34
7
2
Name
Order
Citations
PageRank
Arnon Avron11292147.65
Liron Cohen23611.24