Automated Economic Reasoning with Quantifier Elimination
Many theorems in economics can be proven (and hypotheses shown to be false) with “quantifier elimination.” Results from real algebraic geometry such as Tarski’s quantifier elimination theorem and Collins’ cylindrical algebraic decomposition algorithm are applicable because the economic hypotheses, especially those that leave functional forms unspecified, can be represented as systems of multivariate polynomial (sic) equalities and inequalities. The symbolic proof or refutation of economic hypotheses can therefore be achieved with an automated technique that involves no approximation and requires no problem-specific information beyond the statement of the hypothesis itself. This paper also discusses the computational complexity of this kind of automated economic reasoning, its implementation with Mathematica and REDLOG software, and offers several examples familiar from economic theory.
Document Object Identifier (DOI): 10.3386/w22922
Users who downloaded this paper also downloaded* these: