Regaining cut admissibility in deduction modulo using abstract completion (Q2266989)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5675357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Regaining cut admissibility in deduction modulo using abstract completion |
scientific article; zbMATH DE number 5675357 |
Statements
Regaining cut admissibility in deduction modulo using abstract completion (English)
0 references
26 February 2010
0 references
automated deduction
0 references
rewriting
0 references
Knuth-Bendix completion
0 references
critical proofs
0 references
cut admissibility
0 references
deduction modulo
0 references
proof ordering
0 references
abstract canonical system
0 references
computational proof
0 references
0.910638153553009
0 references
0.8575240969657898
0 references
0.8537236452102661
0 references
0.8018199801445007
0 references
0.7850980162620544
0 references
