A set theoretic view of the ISA hierarchy

The ISA (is-a) hierarchies are widely used in the classification and the representation of related objects. In terms of assessing similarity between two nodes, current distance approaches suffer from its nature that only parent-child relationships among nodes are captured in the hierarchy. This paper presents an idea of treating a hierarchy as a set rather than as a tree in the traditional view. The established set theory is applied to provide the foundation where the relations between nodes can be mathematically specified and results in a more powerful and logical assessment of similarity between nodes

A new way of linking information theory with cognitive science

The relationship between the notion of *information* in information theory, and the notion of *information processing* in cognitive science, has long been controversial. But as the present paper shows, part of the disagreement arises from conflating different formulations of measurement. Clarifying distinctions reveals it is the context-free nature of Shannon's information average that is particular problematic from the cognitive point of view. Context-sensitive evaluation is then shown to be a way of addressing the problems that arise

Adversarial Risk Análysis for Counterterrorism Modelling

Recent large scale terrorist attacks have raised interest in models for resource allocation against terrorist threats. The unifying theme in this area is the need to develop methods for the analysis of allocation decisions when risks stem from the intentional actions of intelligent adversaries. Most approaches to these problems have a game theoretic flavor although there are also several interesting decision analytic based proposals. One of them is the recently introduced framework for adversarial risk analysis, which deals with decision making problems that involve intelligent opponents and uncertain outcomes. We explore how adversarial risk analysis addresses some standard counterterrorism models: simultaneous defend-attack models, sequential defend-attack-defend models and sequential defend-attack models with private information. For each model, we first assess critically what would be a typical game theoretic approach and then provide the corresponding solution proposed by the adversarial risk analysis framework, emphasizing how to coherently assess a predictive probability model of the adversary’s actions, in a context in which we aim at supporting decisions of a defender versus an attacker. This illustrates the application of adversarial risk analysis to basic counterterrorism models that may be used as basic building blocks for more complex risk analysis of counterterrorism problems

Overgeneration in the Higher Infinite

The Overgeneration Argument is a prominent objection against the model-theoretic account of logical consequence for second-order languages. In previous work we have offered a reconstruction of this argument which locates its source in the conflict between the neutrality of second-order logic and its alleged entanglement with mathematics. Some cases of this conflict concern small large cardinals. In this article, we show that in these cases the conflict can be resolved by moving from a set-theoretic implementation of the model-theoretic account to one which uses higher-order resources

Semantic subtyping for objects and classes

In this paper we propose an integration of structural subtyping with boolean connectives and semantic subtyping to define a Java-like programming language that exploits the benefits of both techniques. Semantic subtyping is an approach for defining subtyping relation based on set-theoretic models, rather than syntactic rules. On the one hand, this approach involves some non trivial mathematical machinery in the background. On the other hand, final users of the language need not know this machinery and the resulting subtyping relation is very powerful and intuitive. While semantic subtyping is naturally linked to the structural one, we show how our framework can also accommodate the nominal subtyping. Several examples show the expressivity and the practical advantages of our proposal

Dependent choice, properness, and generic absoluteness

We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to -preserving symmetric submodels of forcing extensions. Hence, not only provides the right framework for developing classical analysis, but is also the right base theory over which to safeguard truth in analysis from the independence phenomenon in the presence of large cardinals. We also investigate some basic consequences of the Proper Forcing Axiom in, and formulate a natural question about the generic absoluteness of the Proper Forcing Axiom in and. Our results confirm as a natural foundation for a significant portion of classical mathematics and provide support to the idea of this theory being also a natural foundation for a large part of set theory

Everything, and then some

On its intended interpretation, logical, mathematical and metaphysical discourse sometimes seems to involve absolutely unrestricted quantification. Yet our standard semantic theories do not allow for interpretations of a language as expressing absolute generality. A prominent strategy for defending absolute generality, influentially proposed by Timothy Williamson in his paper ‘Everything’ (2003), avails itself of a hierarchy of quantifiers of ever increasing orders to develop non-standard semantic theories that do provide for such interpretations. However, as emphasized by Øystein Linnebo and Agustín Rayo (2012), there is pressure on this view to extend the quantificational hierarchy beyond the finite level, and, relatedly, to allow for a cumulative conception of the hierarchy. In his recent book, Modal Logic as Metaphysics (2013), Williamson yields to that pressure. I show that the emerging cumulative higher-orderist theory has implications of a strongly generality-relativist flavour, and consequently undermines much of the spirit of generality absolutism that Williamson set out to defend

The Chang-Los-Suszko Theorem in a Topological Setting

The Chang-Łoś-Suszko theorem of first-order model theory characterizes universal-existential classes of models as just those elementary classes that are closed under unions of chains. This theorem can then be used to equate two model-theoretic closure conditions for elementary classes; namely unions of chains and existential substructures. In the present paper we prove a topological analogue and indicate some applications