Abstract
Abstract This is Part A of an article that defends non-eliminative structuralism about mathematics by means of a concrete case study: a theory of unlabeled graphs. Part A summarizes the general attractions of non-eliminative structuralism. Afterwards, it motivates an understanding of unlabeled graphs as structures sui generis and develops a corresponding axiomatic theory of unlabeled graphs. As the theory demonstrates, graph theory can be developed consistently without eliminating unlabeled graphs in favour of sets; and the usual structuralist criterion of identity can be applied successfully in graph-theoretic proofs. Part B will turn to the philosophical interpretation and assessment of the theory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
