Although it appeared in a Newsletter, this brief article contains counter-examples to the refutational completeness of inference systems for first-order logic with equality, that were presented and claimed to be refutationally complete in an article appeared in the Journal of the Association for Computing Machinery, possibly the most prestigeous journal in Computer Science.
Incompleteness of the RUE/NRF inference systems
BONACINA, Maria Paola
;
1992-01-01
Abstract
Although it appeared in a Newsletter, this brief article contains counter-examples to the refutational completeness of inference systems for first-order logic with equality, that were presented and claimed to be refutationally complete in an article appeared in the Journal of the Association for Computing Machinery, possibly the most prestigeous journal in Computer Science.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
AAR1992rue.pdf
accesso aperto
Descrizione: Articolo
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
57.73 kB
Formato
Adobe PDF
|
57.73 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
