Jeffrey Barrett

There is significant interest in type-free systems that allow flexible self-application. Such systems are of interest in property theory, natural language semantics, the theory of truth, theoretical computer science, the theory of classes, and category theory. While there are a variety of proposed type-free systems, there is a particularly natural type-free system that we believe is prototypical: the logic of recursive algorithms. Algorithmic logic is the study of basic statements concerning algorithms and the algorithmic rules of inference between such statements. As shown in [1], the threat of paradoxes, such as the Curry paradox, requires care in implementing rules of inference in this context. As in any type-free logic, some traditional rules will fail. The first part of the paper develops a rich collection of inference rules that do not lead to paradox. The second part identifies traditional rules of logic that are paradoxical in algorithmic logic, and so should be viewed with suspicion in type-free logic generally.

A resolution of the quantum measurement problem would require one to explain how it is that we end up with determinate records at the end of our measurements. Metaphysical commitments typically do real work in such an explanation. Indeed, one should not be satisfied with one's metaphysical commitments unless one can provide some account of determinate measurement records. I will explain some of the problems in getting determinate records in relativistic quantum field theory and pay particular attention to the relationship between the measurement problem and a generalized version of Malament's theorem.

Insofar as empirical inquiry involves the coevolution of descriptive language and theoretical commitments, a satisfactory model of empirical knowledge should describe the coordinated evolution of both language and theory. But since we do not know what conceptual resources we might need to express our future theories or to provide our best future faithful descriptions of the world, we do not now know even what the space of future descriptive options might be. One strategy for addressing this shifting-resource problem is to track the predictive and linguistic dispositions of inquirers rather than to track their theories and conceptual resources directly. Sender-predictor games, a variant of Skyrms–Lewis sender-receiver games, provide very simple models for the coordinated coevolution of predictive and linguistic dispositions. Such models explain how it is possible for predictive and descriptive dispositions of inquirers to coevolve, term-wise incommensurable, but nevertheless descriptively faithful languages, to sequentially evolve, and a sort of underdetermination to occur where inquirers might satisfy their descriptive and predictive aims by revising their linguistic dispositions, their theoretical dispositions, or both. Such models also provide an elementary characterization of what it might mean for descriptions of the world to be faithful and hence for empirical inquiry to be successful. In doing so they provide a relatively weak, but perfectly clear, endogenous account of epistemic norms.

We consider how cue-reading, sensory-manipulation, and signaling games may initially evolve from ritualized decisions and how more complex games may evolve from simpler games by polymerization, template transfer, and modular composition. Modular composition is a process that combines simpler games into more complex games. Template transfer, a process by which a game is appropriated to a context other than the one in which it initially evolved, is one mechanism for modular composition. And polymerization is a particularly salient example of modular composition where simpler games evolve to form more complex chains. We also consider how the evolution of new capacities by modular composition may be more efficient than evolving those capacities from basic decisions.