Steps Toward a Computational Metaphysics
- First Online:
- Cite this article as:
- Fitelson, B. & Zalta, E.N. J Philos Logic (2007) 36: 227. doi:10.1007/s10992-006-9038-7
- 71 Downloads
In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this paper, we describe what we have discovered when the theory of abstract objects is implemented in prover9 (a first-order automated reasoning system which is the successor to otter). After reviewing the second-order, axiomatic theory of abstract objects, we show (1) how to represent a fragment of that theory in prover9’s first-order syntax, and (2) how prover9 then finds proofs of interesting theorems of metaphysics, such as that every possible world is maximal. We conclude the paper by discussing some issues for further research.