Computational metaphysics (nonfiction): Difference between revisions
(Created page with "'''Computational metaphysics''' is a formal, axiomatic metaphysics (i.e., the study of metaphysics using formally represented axioms and premises to derive conclusions) in an...") |
|||
| (6 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
'''Computational metaphysics''' is a formal, axiomatic metaphysics (i.e., the study of metaphysics using formally represented axioms and premises to derive conclusions) in an automated reasoning environment. It is | '''Computational metaphysics''' is a formal, axiomatic metaphysics (i.e., the study of metaphysics using formally represented axioms and premises to derive conclusions) in an automated reasoning environment. It is based on the axiomatic theory of abstract objects developed at the Metaphysics Research Lab at Stanford University. | ||
Computational Metaphysics is also the name of the academic team which is developing this formal, axiomatic metaphysics. | |||
The | The team's web site states: | ||
<blockquote>The basic idea is to represent the axioms and definitions of abstract object theory in the syntax of an automated reasoning system. Once this is done, arbitrary propositions in the language of object theory can either be proved or shown to be independent of the basic axioms and definitions. In the past, we have used PROVER9 (and its accompanying model-finding program, MACE4), as our automated reasoning system. (PROVER9 is the successor to OTTER.) This meant representing things in the syntax of PROVER9.</blockquote> | <blockquote>The basic idea is to represent the axioms and definitions of abstract object theory in the syntax of an automated reasoning system. Once this is done, arbitrary propositions in the language of object theory can either be proved or shown to be independent of the basic axioms and definitions. In the past, we have used PROVER9 (and its accompanying model-finding program, MACE4), as our automated reasoning system. (PROVER9 is the successor to OTTER.) This meant representing things in the syntax of PROVER9.</blockquote> | ||
| Line 9: | Line 9: | ||
More recently, we have moved to a more generic framework, namely, TPTP syntax, which can be parsed by all current theorem provers and model-finders. | More recently, we have moved to a more generic framework, namely, TPTP syntax, which can be parsed by all current theorem provers and model-finders. | ||
</blockquote> | </blockquote> | ||
[[Gottfried Wilhelm Leibniz (nonfiction)|Leibniz]] wrote: | |||
<blockquote>If we had it [a ''characteristica universalis''], we should be able to reason in metaphysics and morals in much the same way as in [[Geometry (nonfiction)|geometry]] and [[Mathematical analysis (nonfiction)|analysis]].</blockquote> | |||
[[Gottfried Wilhelm Leibniz (nonfiction)|Leibniz]] again: | |||
<blockquote>If controversies were to arise, there would be no more need of disputation between two philosophers than between two accountants (''Computistas''). For it would suffice to take their pencils in their hands, to sit down to their slates (''abacos''), and to say to each other … : Let us calculate (''Calculemus'').</blockquote> | |||
== In the News == | == In the News == | ||
<gallery> | <gallery> | ||
File:Gottfried Wilhelm Leibniz.jpg|link=Gottfried Wilhelm Leibniz (nonfiction)|1705: Mathematician, philosopher, and crime-fighter [[Gottfried Wilhelm Leibniz (nonfiction)|Gottfried Wilhelm Leibniz]] publishes new class of [[Gnomon algorithm functions]] which compute the emergence of Computational metaphysics at Stanford in the early twenty-first century. | |||
</gallery> | </gallery> | ||
| Line 24: | Line 33: | ||
* [[Computation (nonfiction)]] | * [[Computation (nonfiction)]] | ||
* [[Gottfried Wilhelm Leibniz (nonfiction)]] | |||
* [[Metaphysics (nonfiction)]] | |||
External links: | External links: | ||
Latest revision as of 18:23, 17 January 2018
Computational metaphysics is a formal, axiomatic metaphysics (i.e., the study of metaphysics using formally represented axioms and premises to derive conclusions) in an automated reasoning environment. It is based on the axiomatic theory of abstract objects developed at the Metaphysics Research Lab at Stanford University.
Computational Metaphysics is also the name of the academic team which is developing this formal, axiomatic metaphysics.
The team's web site states:
The basic idea is to represent the axioms and definitions of abstract object theory in the syntax of an automated reasoning system. Once this is done, arbitrary propositions in the language of object theory can either be proved or shown to be independent of the basic axioms and definitions. In the past, we have used PROVER9 (and its accompanying model-finding program, MACE4), as our automated reasoning system. (PROVER9 is the successor to OTTER.) This meant representing things in the syntax of PROVER9.
More recently, we have moved to a more generic framework, namely, TPTP syntax, which can be parsed by all current theorem provers and model-finders.
Leibniz wrote:
If we had it [a characteristica universalis], we should be able to reason in metaphysics and morals in much the same way as in geometry and analysis.
Leibniz again:
If controversies were to arise, there would be no more need of disputation between two philosophers than between two accountants (Computistas). For it would suffice to take their pencils in their hands, to sit down to their slates (abacos), and to say to each other … : Let us calculate (Calculemus).
In the News
1705: Mathematician, philosopher, and crime-fighter Gottfried Wilhelm Leibniz publishes new class of Gnomon algorithm functions which compute the emergence of Computational metaphysics at Stanford in the early twenty-first century.
Fiction cross-reference
Nonfiction cross-reference
External links:
- Computational Metaphysics - project home page @ stanford.edu