We propose to strengthen Popper's notion of falsifiability by adding the requirement that when an observation is inconsistent with a theory, there must be a "short proof" of this inconsistency. We model the concept of a short proof using tools from computational complexity, and provide some examples of economic theories that are falsifiable in the usual sense but not with this additional requirement. We consider several variants of the de nition of "short proof" and several assumptions about the difficulty of computation, and study their different implications on the falsifiability of theories. JEL Classification: B400
|Date of creation:||11 Apr 2013|
|Contact details of provider:|| Postal: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014|
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC
|Order Information:|| Email: |
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Thomas DEMUYNCK, 2010. "The computational complexity of boundedly rational choice behavior," Working Papers Department of Economics ces10.23, KU Leuven, Faculty of Economics and Business, Department of Economics.
- Thomas Demuynck, 2014.
"The computational complexity of rationalizing Pareto optimal choice behavior,"
Social Choice and Welfare,
Springer;The Society for Social Choice and Welfare, vol. 42(3), pages 529-549, March.
- Thomas DEMUYNCK, 2011. "The computational complexity of rationalizing Pareto optimal choice behavior," Working Papers Department of Economics ces11.13, KU Leuven, Faculty of Economics and Business, Department of Economics.
- Thomas Demuynck, 2014. "The computational complexity of rationalizing Pareto optimal choice behavior," ULB Institutional Repository 2013/251999, ULB -- Universite Libre de Bruxelles.
- Gil Kalai & Ariel Rubinstein & Ran Spiegler, 2002. "Rationalizing Choice Functions By Multiple Rationales," Econometrica, Econometric Society, vol. 70(6), pages 2481-2488, November.
- Gil Kalai & Ariel Rubenstein & Ran Spiegler, 2001. "Rationalizing Choice Functions by Multiple Rationales," Economics Working Papers 0010, Institute for Advanced Study, School of Social Science.
- Gil Kalai & Ariel Rubinstein & Ran Spiegler, 2001. "Rationalizing Choice Functions by Multiple Rationales," Discussion Paper Series dp278, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Christopher P. Chambers & Federico Echenique & Eran Shmaya, 2014. "The Axiomatic Structure of Empirical Content," American Economic Review, American Economic Association, vol. 104(8), pages 2303-2319, August.
- Apesteguia, Jose & Ballester, Miguel A., 2010. "The Computational Complexity of Rationalizing Behavior," Journal of Mathematical Economics, Elsevier, vol. 46(3), pages 356-363, May.
- Lance Fortnow & Rakesh V. Vohra, 2009. "The Complexity of Forecast Testing," Econometrica, Econometric Society, vol. 77(1), pages 93-105, January.
- repec:cup:cbooks:9781107087804 is not listed on IDEAS Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:1564. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Fran Walker)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.