The HERA collider has recently been upgraded to produce a factor of approximately 5 more luminosity. In parallel, upgrades to the H1 detector and trigger have been necessary. One of the projects was the design of an improved Fast Track Trigger (FTT) which should replace the old track trigger and is based on the central drift chambers of the H1 experiment. This work describes the design and expe...

Given a countable o-minimal theory T , we characterize the Borel complexity of isomorphism for countable models of T up to two model-theoretic invariants. If T admits a nonsimple type, then it is shown to be Borel complete by embedding the isomorphism problem for linear orders into the isomorphism problem for models of T . This is done by constructing models with specific linear orders in the t...

In historical discussions of twentieth-century logic, it is typically assumed that model theory emerged within the tradition that adopted first-order logic as the standard framework. Work within the type-theoretic tradition, in the style of Principia Mathematica, tends to be downplayed or ignored in this connection. Indeed, the shift from type theory to first-order logic is sometimes seen as in...

Abstract Improving health outcomes for concussed athletes and others requires self‐reporting symptoms; not reporting risks second‐impact syndrome death. However, concussions in adolescents young adults are often underreported. We treat as a risky decision, extending predictions of fuzzy‐trace theory (FTT). hypothesize that low SES indirectly interferes with the development cognitive skills redu...

Most current research on automated theorem proving is concerned with proving theorems of first-order logic. We discuss two examples which illustrate the advantages of using higher-order logic in certain contexts. For some purposes type theory is a much more convenient vehicle for formalizing mathematics than axiomatic set theory. Even theorems of first-order logic can sometimes be proven more e...

Given a class of linear order types C, we identify and study several different classes of trees, naturally associated with C in terms of how the paths in those trees are related to the order types belonging to C. We investigate and completely determine the set-theoretic relationships between these classes of trees and between their corresponding first-order theories. We then obtain some general...

We connect and solve two longstanding open problems in quite different areas: the model-theoretic question of whether SOP2 is maximal in Keisler’s order, and the question from general topology/set theory of whether p = t, the oldest problem on cardinal invariants of the continuum. We do so by showing these problems can be translated into instances of a more fundamental problem which we state an...