Naturalness in Mathematics
From MaRDI portal
Publication:5213636
DOI10.1007/978-3-319-10434-8_14zbMATH Open1429.00012OpenAlexW937214363MaRDI QIDQ5213636FDOQ5213636
Luca San Mauro, Giorgio Venturi
Publication date: 4 February 2020
Published in: Boston Studies in the Philosophy and History of Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-10434-8_14
Cites Work
- Computability and Randomness
- Numerosities of labelled sets: A new way of counting
- Visualization, explanation and reasoning styles in mathematics. Based on the meeting on mathematics as rational activity, Roskilde, Denmark, November 1--3, 2001
- Recursively enumerable sets of positive integers and their decision problems
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- An Aristotelian notion of size
- The upper semi-lattice of degrees of recursive unsolvability
- On Kruskal's uniqueness condition for the Candecomp/Parafac decomposition
- Bounded forcing axioms as principles of generic absoluteness
- Naturality and Definability, I
- Proof Style and Understanding in Mathematics I: Visualization, Unification and Axiom Choice
- Why numbers are sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Naturalness in Mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5213636)
