Quantifier Elimination for Deduction in Econometrics

41 Pages Posted: 14 May 2018 Last revised: 20 Sep 2024

See all articles by Casey B. Mulligan

Casey B. Mulligan

University of Chicago; National Bureau of Economic Research (NBER)

Date Written: May 2018

Abstract

When combined with the logical notion of partially interpreted functions, many nonparametric results in econometrics and statistics can be understood as statements about semi-algebraic sets. Tarski’s quantifier elimination (QE) theorem therefore guarantees that a universal algorithm exists for deducing such results from their assumptions. This paper presents the general framework and then applies QE algorithms to Jensen’s inequality, omitted variable bias, partial identification of the classical measurement error model, point identification in discrete choice models, and comparative statics in the nonparametric Roy model. This paper also discusses the computational complexity of real QE and its implementation in software used for program verification, logic, and computer algebra. I expect that automation will become as routine for abstract econometric reasoning as it already is for numerical matrix inversion.

Suggested Citation

Mulligan, Casey B., Quantifier Elimination for Deduction in Econometrics (May 2018). NBER Working Paper No. w24601, Available at SSRN: https://ssrn.com/abstract=3177958

Casey B. Mulligan (Contact Author)

University of Chicago ( email )

1126 East 59th Street
Chicago, IL 60637
United States
773-702-9017 (Phone)
773-702-8490 (Fax)

National Bureau of Economic Research (NBER)

1050 Massachusetts Avenue
Cambridge, MA 02138
United States

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
21
Abstract Views
273
PlumX Metrics