Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo (Q3003304)
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: Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo |
scientific article; zbMATH DE number 5900057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo |
scientific article; zbMATH DE number 5900057 |
Statements
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo (English)
0 references
26 May 2011
0 references
proof complexity
0 references
arithmetic
0 references
deduction modulo
0 references
higher-order logic
0 references
proof-length speed-ups
0 references
term rewriting
0 references
0.86115134
0 references
0.8545438
0 references
0.85348165
0 references
0.84971154
0 references
0.84851986
0 references
0.84289765
0 references
0.83651793
0 references
