On Non-Eliminative Structuralism. Unlabeled Graphs as a Case Study, Part B†

DOI10.1093/PHILMAT/NKAA009MaRDI QIDQ5067704zbMATH OpenOpenAlexFDO

Authors Hannes Leitgeb

Publication date 4 April 2022

Published in Philosophia Mathematica (Search for Journal in Brave)

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

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. I.
• On the structure of random unlabelled acyclic graphs.
• Succinct representation of general unlabeled graphs
• How to deal with unlabeled random graphs
• On the Structure of Graphs with Non-Surjective L(2,1)-Labelings
• scientific article; zbMATH DE number 1029246
• The random selection of unlabeled graphs
• On anti-stochastic properties of unlabeled graphs
• Existential Graphs as a Basis for Structural Reasoning
• scientific article; zbMATH DE number 5291590

Cited in

(6)

• On some putative graph-theoretic counterexamples to the principle of the identity of indiscernibles
• On non-eliminative structuralism. Unlabeled graphs as a case study. I.
• The structuralist thesis reconsidered
• RAMSIFICATION AND SEMANTIC INDETERMINACY
• Non-eliminative structuralism, Fregean abstraction, and non-rigid structures
• Iteration and dependence again

This page was built for publication: On Non-Eliminative Structuralism. Unlabeled Graphs as a Case Study, Part B†

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