The undecidability of proof search when equality is a logical connective (Q2134939)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The undecidability of proof search when equality is a logical connective |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The undecidability of proof search when equality is a logical connective |
scientific article |
Statements
The undecidability of proof search when equality is a logical connective (English)
0 references
4 May 2022
0 references
equality
0 references
unification
0 references
undecidability
0 references
sequent calculus
0 references
0 references
