Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
From MaRDI portal
Publication:3003304
DOI10.2168/LMCS-7(1:3)2011zbMath1218.03007MaRDI QIDQ3003304
Publication date: 26 May 2011
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42) Second- and higher-order arithmetic and fragments (03F35) Complexity of proofs (03F20)
Related Items (2)
First-order automated reasoning with theories: when deduction modulo theory meets practice ⋮ Experimenting with Deduction Modulo
This page was built for publication: Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo