Constructive proofs for the standard translation of many-sorted to unsorted predicate logic

TL;DR

This paper provides constructive, elementary proofs for translating many-sorted logic into unsorted first-order logic, including cases with equality, and offers applications to second-order logic and Herbrand's claim.

Contribution

It introduces an effective, elementary proof method for the translation, addressing gaps in previous proofs involving equality and providing new syntactic justifications.

Findings

Constructive proof closes gaps in translation with equality.

Provides a syntactic justification for van Dalen's translation.

Offers a new proof of Herbrand's claim in the equality-free case.

Abstract

It is well known that many-sorted logic can be reduced to unsorted first-order logic by adding predicates for each sort, relativizing quantifiers to these predicates, and adding appropriate axioms governing their behavior. Existing constructive proofs for the correctness of this translation break down when the many-sorted language includes equality and the unsorted target calculus includes the usual rules/axioms for equality. We give an elementary proof in the form of an effective procedure that closes this gap. As an application, we give a fully syntactic justification of van Dalen's translation of second-order logic into unsorted first-order logic. We also give a new proof for a claim made by Herbrand in his 1930 dissertation that, in the equality-free case, a sentence is derivable in many-sorted logic iff it is derivable in unsorted logic. Our proof avoids the heavy machinery of later proofs by Schmidt and Wang.