A Function Elimination Method for Checking Satisfiability of Arithmetical Logics

Abstract

We study function elimination for Arithmetical Logics. We propose a method allowing substitution of functions appearing in a given formula with functions with less arity. We prove the correctness of the method and we use it to show the decidability of the satisfiability problem for two classes of formulae allowing linear and polynomial terms.