DeepAI AI Chat
Log In Sign Up

A modest proposal: explicit support for foundational pluralism

by   Martin Berger, et al.

Whilst mathematicians assume classical reasoning principles by default they often context switch when working, restricting themselves to various forms of subclassical reasoning. This pattern is especially common amongst logicians and set theorists, but workaday mathematicians also commonly do this too, witnessed by narrative notes accompanying a proof – "the following proof is constructive", or "the following proof does not use choice", for example. Yet, current proof assistants provide poor support for capturing these narrative notes formally, an observation that is especially true of systems based on Gordon's HOL, a classical higher-order logic. Consequently, HOL and its many implementations seem ironically more committed to classical reasoning than mainstream mathematicians are themselves, limiting the mathematical content that one may easily formalise. To facilitate these context switches, we propose that mathematicians mentally employ a simple tainting system when temporarily working subclassically – an idea not currently explored in proof assistants. We introduce a series of modest but far-reaching changes to HOL, extending the standard two-place Natural Deduction relation to incorporate a taint-label, taken from a particular lattice, and which describes or limits the "amount" of classical reasoning used within a proof. Taint can be seen either as a simple typing system on HOL proofs, or as a form of static analysis on proof trees, and partitions our logic into various fragments of differing expressivity, sitting side-by-side. Results may pass from a "less classical" fragment into a "more classical" fragment of the logic without modification, but not vice versa, with the flow of results between worlds controlled by an inference rule akin to a subtyping or subsumption rule.


page 1

page 2

page 3

page 4


A system of inference based on proof search: an extended abstract

Gentzen designed his natural deduction proof system to “come as close as...

Working with first-order proofs and provers

Verifying software correctness has always been an important and complica...

Sequent-Type Proof Systems for Three-Valued Default Logic

Sequent-type proof systems constitute an important and widely-used class...

Universal Reasoning, Rational Argumentation and Human-Machine Interaction

Classical higher-order logic, when utilized as a meta-logic in which var...

Introduction to Pylog

PyLog is a minimal experimental proof assistant based on linearised natu...

Constructive Galois Connections

Galois connections are a foundational tool for structuring abstraction i...

Axiomatizing Category Theory in Free Logic

Starting from a generalization of the standard axioms for a monoid we pr...