# Vanquishing the XCB Question: The Methodology Discovery of the Last Shortest Single Axiom for the Equivalential Calculus

With the inclusion of an effective methodology, this article answers in detail a question that, for a quarter of a century, remained open despite intense study by various researchers. Is the formula XCB = e(x,e(e(e(x,y),e(z,y)),z)) a single axiom for the classical equivalential calculus when the rules of inference consist of detachment (modus ponens) and substitution? Where the function e represents equivalence, this calculus can be axiomatized quite naturally with the formulas e(x,x), e(e(x,y),e(y,x)), and e(e(x,y),e(e(y,z),e(x,z))), which correspond to reflexivity, symmetry, and transitivity, respectively. (We note that e(x,x) is dependent on the other two axioms.) Heretofore, thirteen shortest single axioms for classical equivalence of length eleven had been discovered, and XCB was the only remaining formula of that length whose status was undetermined. To show that XCB is indeed such a single axiom, we focus on the rule of condensed detachment, a rule that captures detachment together with an appropriately general, but restricted, form of substitution. The proof we present in this paper consists of twenty-five applications of condensed detachment, completing with the deduction of transitivity followed by a deduction of symmetry. We also discuss some factors that may explain in part why XCB resisted relinquishing its treasure for so long. Our approach relied on diverse strategies applied by the automated reasoning program OTTER. Thus ends the search for shortest single axioms for the equivalential calculus.

• 4 publications
• 2 publications
• 2 publications
research
11/13/2002

### XCB, the Last of the Shortest Single Axioms for the Classical Equivalential Calculus

It has long been an open question whether the formula XCB = EpEEEpqErqr ...
research
03/26/2022

### Algorithmic correspondence and analytic rules

We introduce the algorithm MASSA which takes classical modal formulas in...
research
02/21/2019

### Schematic Refutations of Formula Schemata

Proof schemata are infinite sequences of proofs which are defined induct...
research
04/04/2018

### Short Proofs for Some Symmetric Quantified Boolean Formulas

We exploit symmetries to give short proofs for two prominent formula fam...
research
09/17/2021

### On the size of disjunctive formulas in the μ-calculus

A key result in the theory of the modal mu-calculus is the disjunctive n...
research
02/09/2023

### Calculus of functional centrality

In this document, we present another perspective for the calculus of opt...
research
04/22/2021

### On sequentiality and well-bracketing in the π-calculus

The π -calculus is used as a model for programminglanguages. Its context...

Please sign up or login with your details

Forgot password? Click here to reset