The undecidability of proof search when equality is a logical connective - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Annals of Mathematics and Artificial Intelligence Year : 2021

The undecidability of proof search when equality is a logical connective

Abstract

One proof-theoretic approach to equality in quantificational logic treats equality as a logical connective: in particular, term equality can be given both left and right introduction rules in a sequent calculus proof system. We present a particular example of this approach to equality in a first-order logic setting in which there are no predicate symbols (apart from equality). After we illustrate some interesting applications of this logic, we show that provability in this logic is undecidable.
Fichier principal
Vignette du fichier
ps-equality.pdf (303.8 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03457312 , version 1 (09-09-2022)

Identifiers

Cite

Dale Miller, Alexandre Viel. The undecidability of proof search when equality is a logical connective. Annals of Mathematics and Artificial Intelligence, 2021, ⟨10.1007/s10472-021-09764-0⟩. ⟨hal-03457312⟩
74 View
89 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More