This article investigates Krivine’s realizability interpretation of classical second-order arithmetic and its recent extension handling countable choice. We will start by presenting a two-step interpretation which first eliminates classical logic via a negative translation and then applies standard realizability interpretation. We then argue that a slight variant of Krivine’s interpretation cor...

An (n)completely separating system C ((n)CSS) is a collection of blocks of [n] = {1, . . . , n} such that for all distinct a, b ∈ [n] there are blocks A,B ∈ C with a ∈ A \B and b ∈ B \A. An (n)CSS is minimal if it contains the minimum possible number of blocks for a CSS on [n]. The number of non-isomorphic minimal (n)CSSs is determined for 11 ≤ n ≤ 35. This also provides an enumeration of a nat...

In this poster, we generalize the problem of secure location verification to that of path verification and propose a scheme to securely verify the claims of a mobile node that moves along a path. Although the secure verification of location claims has been studied extensively in the literature, current solutions require very strict time synchronization of the verifiers, or extra communication a...

The symbolic representation of the physical structure of living organisms needs an ontologically well-founded and logically sound approach so that formal reasoning can adequately be supported. We describe a set of canonical relations and attributes necessary for the description of biological structures. Based on these epistemological primitives, we sketch how a broad range of organisms can be r...

Standardization of data collection in severely injured trauma patients in order to find the best performance and practice has been an issue for more than 20 years. The incidence of trauma has decreased and outcomes have improved over the past decades. Trauma still remains an important public health problem, however, and is listed by the World Health Organization as a leading cause of death and ...