Interactive theorem provers might seem particularly impractical in the history of philosophy. Journal articles in this discipline are generally not formalized. Interactive theorem provers involve a learning curve for which the payoffs might seem minimal. In this article I argue that interactive theorem provers have already demonstrated their potential as a useful tool for historians of philosophy; I do this by highlighting examples of work where this has already been done. Further, I argue that interactive theorem provers can continue to (...) be useful tools for historians of philosophy in the future; this claim is defended through a more conceptual analysis of what historians of philosophy do that identifies argument reconstruction as a core activity of such practitioners. It is then shown that interactive theorem provers can assist in this core practice by a description of what interactive theorem provers are and can do. If this is right, then computer verification for historians of philosophy is in the offing. (shrink)

How might philosophy of religion be impacted by developments in computational modeling and social simulation? After briefly describing some of the content and context biases that have shaped traditional philosophy of religion, this article provides examples of computational models that illustrate the explanatory power of conceptually clear and empirically validated causal architectures informed by the bio-cultural sciences. It also outlines some of the material implications of these developments for broader metaphysical and metaethical discussions in philosophy. Computer modeling and simulation can (...) contribute to the reformation of the philosophy of religion in at least three ways: by facilitating conceptual clarity about the role of biases in the emergence and maintenance of phenomena commonly deemed “religious,” by supplying tools that enhance our capacity to link philosophical analysis and synthesis to empirical data in the psychological and social sciences, and by providing material insights for metaphysical hypotheses and metaethical proposals that rely solely on immanent resources. (shrink)

Computational philosophy is the use of mechanized computational techniques to instantiate, extend, and amplify philosophical research. Computational philosophy is not philosophy of computers or computational techniques; it is rather philosophy using computers and computational techniques. The idea is simply to apply advances in computer technology and techniques to advance discovery, exploration and argument within any philosophical area. -/- After touching on historical precursors, this article discusses contemporary computational philosophy across a variety of fields: epistemology, metaphysics, philosophy of science, ethics and (...) social philosophy, philosophy of language and philosophy of mind, often with examples of operating software. Far short of any attempt at an exhaustive treatment, the intention is to introduce the spirit of each application by using some representative examples. (shrink)

Three variants of Kurt Gödel's ontological argument, proposed by Dana Scott, C. Anthony Anderson and Melvin Fitting, are encoded and rigorously assessed on the computer. In contrast to Scott's version of Gödel's argument the two variants contributed by Anderson and Fitting avoid modal collapse. Although they appear quite different on a cursory reading they are in fact closely related. This has been revealed in the computer-supported formal analysis presented in this article. Key to our formal analysis is the utilization of (...) suitably adapted notions of ultrafilters, and a careful distinction between extensions and intensions of positive properties. (shrink)

In this article, I develop three conceptual innovations within the area of formal metatheory, and present a computer program, called Reconstructor, that implements those developments. The first development consists in a methodology for testing formal reconstructions of scientific theories, which involves checking both whether translations of paradigmatically successful applications into models satisfy the formalisation of the laws, and also whether unsuccessful applications do not. I show how Reconstructor can help carry this out, since it allows the end-user to specify a (...) formal language, input axioms and models formulated in that language, and then ask if the models satisfy the axioms. The second innovation is the introduction of incomplete models (for which the denotation of some terms is missing) into scientific metatheory, in order to represent cases of missing information. I specify the paracomplete semantics built into Reconstructor to deal with sentences where denotation failures occur. The third development consists in a new way of explicating the structuralist notion of a determination method, by equating them with algorithms. This allows determination methods to be loaded into Reconstructor and then executed within a model to find out the value of a previously non-denoting term (i.e. it allows the formal reconstruction to make predictions). This, in turn, can help test the reconstruction in a different way. Finally, I conclude with some suggestions about additional uses the program may have. (shrink)