The Axiomatic Structure of Empirical Content

In this paper, we provide a formal framework for studying the empirical content of a given theory. We define the falsifiable closure of a theory to be the least weakening of the theory that makes only falsifiable claims. The falsifiable closure is our notion of empirical content. We prove that the empirical content of a theory can be exactly captured by a certain kind of axiomatization, one that uses axioms which are universal negations of conjunctions of atomic formulas. The falsifiable closure operator has the structure of a topological closure, which has implications, for example, for the behavior of joint vis a vis single hypotheses. The ideas here are useful for understanding theories whose empirical content is well-understood (for example, we apply our framework to revealed preference theory, and Afriat's theorem), but they can also be applied to theories with no known axiomatization. We present an application to the theory of multiple selves, with a fixed finite set of selves and where selves are aggregated according to a neutral rule satisfying independence of irrelevant alternatives. We show that multiple selves theories are fully falsifiable, in the sense that they are equivalent to their empirical content

Cognitive constraints, contraction consistency, and the satisficing criterion

© 2007, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4.0

Weak Pseudo-Rationalizability

This paper generalizes rationalizability of a choice function by a single acyclic binary relation to rationalizability by a set of such relations. Rather than selecting those options in a menu that are maximal with respect to a single binary relation, a weakly pseudo-rationalizable choice function selects those options that are maximal with respect to at least one binary relation in a given set. I characterize the class of weakly pseudo-rationalizable choice functions in terms of simple functional properties. This result also generalizes Aizerman and Malishevski's characterization of pseudo-rationalizable choice functions, that is, choice functions rationalizable by a set of total orders