David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Philosophical Logic 36 (2):227-247 (2007)
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
|Keywords||automated reasoning axiomatic metaphysics computational metaphysics|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Erkan Tin & Varol Akman (1994). Computational Situation Theory. ACM SIGART Bulletin 5 (4):4-17.
Edward N. Zalta (1997). The Modal Object Calculus and its Interpretation. In M. de Rijke (ed.), Advances in Intensional Logic. Kluwer 249--279.
Shimon Edelman (2011). The Metaphysics of Embodiment. International Journal of Machine Consciousness 3 (02):321-.
Stuart S. Glennan (1995). Computationalism and the Problem of Other Minds. Philosophical Psychology 8 (4):375-88.
Branden Fitelson & Larry Wos (2001). Finding Missing Proofs with Automated Reasoning. Studia Logica 68 (3):329-356.
Louis C. Charland (1995). Feeling and Representing: Computational Theory and the Modularity of Affect. Synthese 105 (3):273-301.
Gert-Jan Lokhorst (2011). Computational Meta-Ethics. Minds and Machines 21 (2):261-274.
Paul Oppenheimer & Edward N. Zalta (2011). A Computationally-Discovered Simplification of the Ontological Argument. Australasian Journal of Philosophy 89 (2):333 - 349.
Edward N. Zalta (2000). Neo-Logicism? An Ontological Reduction of Mathematics to Metaphysics. Erkenntnis 53 (1-2):219-265.
Added to index2009-01-28
Total downloads35 ( #77,835 of 1,699,831 )
Recent downloads (6 months)9 ( #69,042 of 1,699,831 )
How can I increase my downloads?