Jeffrey A. Barrett

Jeffrey A. Barrett

Ph.D., Columbia, 1992
SST 765 | 949-824-6491

Professor, Logic and Philosophy of Science
UC Irvine Chancellor's Fellow
Senior Fellow, University of Konstanz (2011-12)
Editor-in-Chief, Philosophy of Science

Research Interests

I am interested in attempts to resolve the measurement problem in quantum mechanics. The measurement problem arises from the fact that the standard theory's two dynamical laws are incompatible: one is linear and the other nonlinear. Since they constitute contradictory descriptions of the time-evolution of physical states, they threaten to render the standard theory logically inconsistent if one is unable to specify strictly disjoint conditions for when each applies. The theory tells us that the linear dynamics is to be used in all situations except when a measurement is made in which case the nonlinear collapse dynamics is to be used; but since it does not tell us what constitutes a measurement, we do not know when to apply the linear dynamics and when to apply the collapse dynamics. I am particularly interested in solutions to the measurement problem that drop the collapse dynamics altogether.

Recently, I have been working with Peter Byrne to organize the newly discovered Hugh Everett III manuscripts concerning his relative-state (or, less accurately, many-worlds) formulation of quantum mechanics. Many of these manuscripts can now be found at the UCIspace Everett Archive at http://ucispace.lib.uci.edu/handle/10575/1060. The companion volume of papers and commentary is forthcoming with Princeton University Press this Winter.

I am currently using evolutionary game theory to model inquiry. In particular, I have been modeling the coevolution of descriptive language and predictive theory in the context of Skyrms-Lewis sender-receiver games. Such models show how it is possible for agents with very simple prior dispositions, and no conceptual resources, to evolve from random, meaningless signaling and inaccurate predictive dispositions to a meaningful descriptive language and reliable predictive theory.

For something completely different, Wayne Aitken and I have developed an algorithmic logic for statements of the form "Algorithm A outputs X when given input Z". It is a feature of the logic that logical connectives and quantifiers are algorithmically defined. This has led to our research on the structure of the Curry Paradox and the limits of modus ponens as a valid rule of inference. Studying models for such logics led to the paper on the physical possibility of transfinite cardinal computation.

Select Publications


Find Us On: Social Sciences Facebook Social Sciences Google+ Social Sciences Twitter Social Sciences Youtube