A Spectrum of Applications of Automated Reasoning

The likelihood of an automated reasoning program being of substantial assistance for a wide spectrum of applications rests with the nature of the options and parameters it offers on which to base needed strategies and methodologies. This article focuses on such a spectrum, featuring W. McCune's program OTTER, discussing widely varied successes in answering open questions, and touching on some of the strategies and methodologies that played a key role. The applications include finding a first proof, discovering single axioms, locating improved axiom systems, and simplifying existing proofs. The last application is directly pertinent to the recently found (by R. Thiele) Hilbert's twenty-fourth problem--which is extremely amenable to attack with the appropriate automated reasoning program--a problem concerned with proof simplification. The methodologies include those for seeking shorter proofs and for finding proofs that avoid unwanted lemmas or classes of term, a specific option for seeking proofs with smaller equational or formula complexity, and a different option to address the variable richness of a proof. The type of proof one obtains with the use of OTTER is Hilbert-style axiomatic, including details that permit one sometimes to gain new insights. We include questions still open and challenges that merit consideration.Comment: 13 page

Implications of Foundational Crisis in Mathematics: A Case Study in Interdisciplinary Legal Research

As a result of a sequence of so-called foundational crises, mathematicians have come to realize that foundational inquiries are difficult and perhaps never ending. Accounts of the last of these crises have appeared with increasing frequency in the legal literature, and one piece of this Article examines these invocations with a critical eye. The other piece introduces a framework for thinking about law as a discipline. On the one hand, the disciplinary framework helps explain how esoteric mathematical topics made their way into the legal literature. On the other hand, the mathematics can be used to examine some aspects of interdisciplinary legal research

A Simple Theory of Every 'Thing'

One of the criteria to a strong principle in natural sciences is simplicity. This paper claims that the Free Energy Principle (FEP), by virtue of unifying particles with mind, is the simplest. Motivated by Hilbert’s 24th problem of simplicity, the argument is made that the FEP takes a seemingly mathematical complex domain and reduces it to something simple. More specifically, it is attempted to show that every ‘thing’, from particles to mind, can be partitioned into systemic states by virtue of self-organising symmetry break, i.e. self-entropy in terms of the balance between risk and ambiguity to achieve epistemic gain. By virtue of its explanatory reach, the FEP becomes the simplest principle under quantum, statistical and classical mechanics conditions

An Augustinian Perspective on the Philosophy of Mathematics

Enlightenment thinkers saw the universe as mechanistic and mathematics as the language in which the universe is written. They viewed mathematics as eternal, as transcending human minds, and as comprehensible by human beings. Thus mathematics, from their perspective, is our best tool for understanding the secrets of nature. This outlook was nicely summarized by Morris Kline: (Kline, 1953) In brief the whole world is the totality of mathematically expressible motions of objects in space and time, and the entire universe is a great, harmonious, and mathematically designed machine. From a Christian perspective, however, the Enlightenment outlook is flawed. It privileges mathematics and science and dismisses other sources of knowledge such as intuition and divine revelation. It identifies reason with mathematical thinking and empiricism, thus devaluing reflections on ethics, values, justice, and origins. Although Descartes professed religious belief, subsequent Enlightenment thinkers tended to view human intellectual capabilities as sufficient for ordering society and providing for peace and prosperity. Thus these thinkers privatized religion and viewed it as an inappropriate topic of discussion in the public sphere. In short, Enlightenment thought replaced God with a particular form of human reason - mathematics and science

The Arithmetic of Fields

[no abstract available

A synthetic axiomatization of Map Theory

Includes TOC détaillée, index et appendicesInternational audienceThis paper presents a subtantially simplified axiomatization of Map Theory and proves the consistency of this axiomatization in ZFC under the assumption that there exists an inaccessible ordinal. Map Theory axiomatizes lambda calculus plus Hilbert's epsilon operator. All theorems of ZFC set theory including the axiom of foundation are provable in Map Theory, and if one omits Hilbert's epsilon operator from Map Theory then one is left with a computer programming language. Map Theory fulfills Church's original aim of introducing lambda calculus. Map Theory is suited for reasoning about classical mathematics as well ascomputer programs. Furthermore, Map Theory is suited for eliminating thebarrier between classical mathematics and computer science rather than just supporting the two fields side by side. Map Theory axiomatizes a universe of "maps", some of which are "wellfounded". The class of wellfounded maps in Map Theory corresponds to the universe of sets in ZFC. The first version MT0 of Map Theory had axioms which populated the class of wellfounded maps, much like the power set axiom et.al. populates the universe of ZFC. The new axiomatization MT of Map Theory is "synthetic" in the sense that the class of wellfounded maps is defined inside MapTheory rather than being introduced through axioms. In the paper we define the notion of kappa- and kappasigma-expansions and prove that if sigma is the smallest strongly inaccessible cardinal then canonical kappasigma expansions are models of MT (which proves the consistency). Furthermore, in the appendix, we prove that canonical omega-expansions are fully abstract models of the computational part of Map Theory