On non-eliminative structuralism. Unlabeled graphs as a case study. I.

DOI10.1093/PHILMAT/NKAA001MaRDI QIDQ5149970zbMATH OpenOpenAlexFDO

Authors Hannes Leitgeb

Publication date 9 February 2021

Published in Philosophia Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/philmat/nkaa001

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Foundations of classical theories (including reverse mathematics) (03B30)

Recommendations

• On Non-Eliminative Structuralism. Unlabeled Graphs as a Case Study, Part B†
• Mathematical structuralism and the Identity of Indiscernibles
• The structuralist thesis reconsidered
• Non-ontological structuralism
• Categories without structures

Cited in

(6)

• Structural relativity and informal rigour
• Ontological dependence and grounding for a weak mathematical structuralism
• On some putative graph-theoretic counterexamples to the principle of the identity of indiscernibles
• On Non-Eliminative Structuralism. Unlabeled Graphs as a Case Study, Part B†
• Structuralism and informal provability
• Iteration and dependence again

This page was built for publication: On non-eliminative structuralism. Unlabeled graphs as a case study. I.

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