Normative political theory over recent decades has focused mainly on what ought to be done as far as migration policies are concerned. It faces a basic challenge, which stems from two competing, yet equally fundamental, ideals underpinning liberal democratic societies: a commitment to moral universalism and the exclusionary requirement of democracy. The objective of this special issue, ‘New Challenges in Immigration Theory’, is to provide a conceptual overview of (some) immigration theories and to highlight the challenges new streams of immigration (...) pose for normative (political) theory and liberal democratic practice. The issue will consider how to reconcile state-based exclusion with a commitment to equal moral concern for all persons, by focusing on the non-standard immigration questions that have so far been ‘neglected’ by normative political theory. In line with this objective, the issue will discuss some of the inadequacies of the dominant political theories of immigration and show how such theories can be expanded to take account of new migration challenges such as brain drain, climate migration, detention of irregular migrants and asylum seekers, rights of labour migrants, transnational networks of movement, and so on. (shrink)

In this thesis, I examine what makes a migration policy “just” by focussing on the following question: Is a policy of open borders the only morally defensible option or are there legitimate reasons for excluding would-be immigrants from entering? I reason that absent a global constitutional framework to determine and secure the relevant rights and duties at stake, potential immigrants lack a legitimate general right to immigrate since states bear no corresponding general duty to let them in. In the same (...) breath, because would-be immigrants do not owe states a general duty not to immigrate, states lack a legitimate general right to exclude. Does it mean then that states cannot exclude potential immigrants, at all? I posit that a state may prevent a would-be immigrant from entering if there is evidence to show that such an individual poses a threat to the life and property of residents of the receiving state. My justification is that since residents delegate their individual right to self-help to the state, a state owes its residents a jurisdictional duty to secure the necessary condition for pursuing compatible conceptions of the good life. And given that a state exercises the delegated right to self-help internally by restricting the movement of persons that offend or threaten law and order, it would be unjust if the state fails to arrest threats from without. Finally, I propose what I call “temporary citizenship” as a fair system of migration predicated upon a jurisdiction-based citizenship acquisition. According to this proposal, all residents should be citizens irrespective of the duration of their stay. In view of the normative ideal requiring reflexivity between subjection to the law and authorship of the law, I conclude that the exercise of governmental power over non-citizen residents amounts to tyranny and therefore an illegitimate exercise of authority over them; therefore, immigrants should be admitted as citizens. The implication is that while protecting the life and property of all residents, the government can also exact from all residents the corresponding duties without distinction. (shrink)

As far as immigration theory is concerned, the attempt to reconcile concern for all persons with the reality of state boundaries and exclusionary policies has proved difficult within the limits of normative liberal political philosophy. However, the realpolitik of migration in today's environment forces a major paradigm shift. We must move beyond standard debates between those who argue for more open borders and those who argue for more closed borders. This book aims to show that a realistic utopia of political (...) theory of immigration is possible, but argues that to do so we must focus on expanding the boundaries of what are familiar normative positions in political theory. Theorists must better inform themselves of the concrete challenges facing migration policies: statelessness, brain drain, migrant rights, asylum policies, migrant detention practices, climate refugees, etc. We must ask: what is the best we can and ought to wish for in the face of these difficult migration challenges. Blake, Carens, and Cole offer pieces that outline the major normative questions in the political theory of immigration. The positions these scholars outline are challenged by the pieces contributed by Lister, Ottonelli, Torresi, Sager, and Silverman. These latter pieces force the reformulation of the central positions in normative political theory of immigration. This book was originally published as a special issue of New Challenges in Immigration Theory. (shrink)

Embracing an inter-disciplinary approach grounded on Gärdenfors’ theory of conceptual spaces, we introduce a formal framework to analyse and compare selected theories about technical artefacts present in the literature. Our focus is on design-oriented approaches where both designing and manufacturing activities play a crucial role. Intentional theories, like Kroes’ dual nature thesis, are able to solve disparate problems concerning artefacts but they face both the philosophical challenge of clarifying the ontological nature of intentional properties, and the empirical challenge of testing (...) the attribution of such intentional properties to artefacts. To avoid these issues, we propose an approach that, by identifying different modalities to characterise artefact types, does not commit to intentional qualities and is able to empirically ground compliance tests. (shrink)

There is wide support in logic, philosophy, and psychology for the hypothesis that the probability of the indicative conditional of natural language, P(if A then B), is the conditional probability of B given A, P(B|A). We identify a conditional which is such that P(if A then B)=P(B|A) with de Finetti's conditional event, B|A. An objection to making this identification in the past was that it appeared unclear how to form compounds and iterations of conditional events. In this paper, we illustrate (...) how to overcome this objection with a probabilistic analysis, based on coherence, of these compounds and iterations. We interpret the compounds and iterations as conditional random quantities which, given some logical dependencies, may reduce to conditional events. We show how the inference to B|A from A and B can be extended to compounds and iterations of both conditional events and biconditional events. Moreover, we determine the respective uncertainty propagation rules. Finally, we make some comments on extending our analysis to counterfactuals. (shrink)

We analyze selected iterated conditionals in the framework of conditional random quantities. We point out that it is instructive to examine Lewis's triviality result, which shows the conditions a conditional must satisfy for its probability to be the conditional probability. In our approach, however, we avoid triviality because the import-export principle is invalid. We then analyze an example of reasoning under partial knowledge where, given a conditional if A then Cas information, the probability of A should intuitively increase. We explain (...) this intuition by making some implicit background information explicit. We consider several iterated conditionals, which allow us to formalize different kinds of latent information. We verify that for these iterated conditionals the prevision is greater than or equal to the probability of A. We also investigate the lower and upper bounds of the Affirmation of the Consequent inference. We conclude our study with some remarks on the supposed "independence" of two conditionals, and we interpret this property as uncorrelation between two random quantities. 2020 Elsevier Inc. All rights reserved. (shrink)

Modus ponens (from A and “if A then C” infer C) is one of the most basic inference rules. The probabilistic modus ponens allows for managing uncertainty by transmitting assigned uncertainties from the premises to the conclusion (i.e., from P(A) and P(C|A) infer P(C)). In this paper, we generalize the probabilistic modus ponens by replacing A by the conditional event A|H. The resulting inference rule involves iterated conditionals (formalized by conditional random quantities) and propagates previsions from the premises to the (...) conclusion. Interestingly, the propagation rules for the lower and the upper bounds on the conclusion of the generalized probabilistic modus ponens coincide with the respective bounds on the conclusion for the (non-nested) probabilistic modus ponens. (shrink)

Alternative cleavage and polyadenylation (APA) can diversify coding and non‐coding regions, but has particular impact on increasing 3′ UTR diversity. Through the gain or loss of regulatory elements such as RNA binding protein and microRNA sites, APA can influence transcript stability, localization, and translational efficiency. Strikingly, the central nervous systems of invertebrate and vertebrate species express a broad range of transcript isoforms bearing extended 3′ UTRs. The molecular mechanism that permits proximal 3′ end bypass in neurons is mysterious, and only (...) beginning to be elucidated. This landscape of neural 3′ UTR extensions, many reaching unprecedented lengths, may help service the unique post‐transcriptional regulatory needs of neurons. A combination of approaches, including transcriptome‐wide profiling, genetic screening to identify APA factors, biochemical dissection of alternative 3′ end formation, and manipulation of individual neural APA targets, will be necessary to gain fuller perspectives on the mechanism and biology of neural‐specific 3′ UTR lengthening. (shrink)

Seekers know that they will search all their lives not only for what they have lost, but above all for what they do not yet know and that they are not even sure exists. Augusto Cavadi, to whom this book is dedicated on his 70th birthday, is an indomitable seeker. For this reason a group of friends and colleagues wrote these collected testimonies, reflections, ideas and suggestions inspired by his writings and his life as an anti-academic philosopher without a tie--Translated (...) from back cover. (shrink)

Information entities are used in ontologies to represent engineering technical specifications, health records, pictures or librarian data about, e.g., narrative fictions, among others. The literature in applied ontology lacks a comparison of the state of the art, and foundational questions on the nature of information entities remain open for research. The purpose of the paper is twofold. First, to compare existing ontologies with both each other and theories proposed in philosophy, semiotics, librarianship, and literary studies in order to understand how (...) the ontologies conceive and model information entities. Second, to discuss some open research challenges that can lead to principled approaches for the treatment of information entities, possibly by getting into account the variety of information entity types found in the literature. (shrink)

In this paper we consider conditional random quantities (c.r.q.’s) in the setting of coherence. Based on betting scheme, a c.r.q. X|H is not looked at as a restriction but, in a more extended way, as \({XH + \mathbb{P}(X|H)H^c}\) ; in particular (the indicator of) a conditional event E|H is looked at as EH + P(E|H)H c . This extended notion of c.r.q. allows algebraic developments among c.r.q.’s even if the conditioning events are different; then, for instance, we can give a (...) meaning to the sum X|H + Y|K and we can define the iterated c.r.q. (X|H)|K. We analyze the conjunction of two conditional events, introduced by the authors in a recent work, in the setting of coherence. We show that the conjoined conditional is a conditional random quantity, which may be a conditional event when there are logical dependencies. Moreover, we introduce the negation of the conjunction and by applying De Morgan’s Law we obtain the disjoined conditional. Finally, we give the lower and upper bounds for the conjunction and disjunction of two conditional events, by showing that the usual probabilistic properties continue to hold. (shrink)

We present a preliminary high-level formal theory, grounded on knowledge representation techniques and foundational ontologies, for the uniform and integrated representation of the different kinds of (quali- tative and quantitative) knowledge involved in the designing process. We discuss the conceptual nature of engineering design by individuating and analyzing the involved notions. These notions are then formally charac- terized by extending the DOLCE foundational ontology. Our ultimate purpose is twofold: (i) to contribute to foundational issues of design; and (ii) to support (...) the development of advanced modelling systems for (qualitative and quantitative) representation of design knowledge. (shrink)

We study probabilistically informative (weak) versions of transitivity by using suitable definitions of defaults and negated defaults in the setting of coherence and imprecise probabilities. We represent p-consistent sequences of defaults and/or negated defaults by g-coherent imprecise probability assessments on the respective sequences of conditional events. Moreover, we prove the coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases. Finally, we apply our results to study selected probabilistic (...) versions of classical categorical syllogisms and construct a new version of the square of opposition in terms of defaults and negated defaults. (shrink)

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular (...) we examine the Fréchet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction Cn+1 of n + 1 conditional events to the family {Cn,En+1|Hn+1}. We consider the relation with the notion of quasi-conjunction and we examine in detail the coherence of the prevision assessments related with the conjunction of three conditional events. Based on conjunction, we also give a characterization of p-consistency and of p-entailment, with applications to several inference rules in probabilistic nonmonotonic reasoning. Finally, we examine some non p-valid inference rules; then, we illustrate by an example two methods which allow to suitably modify non p-valid inference rules in order to get inferences which are p-valid. (shrink)

Product structures are represented in engineering models by depicting and linking components, features and assemblies. Their understanding requires knowledge of both design and manufacturing practices, and yet further contextual reasoning is needed to read them correctly. Since these representations are essen- tial to the engineering activities, the lack of a clear and explicit semantics of these models hampers the use of information systems for their assessment and exploita- tion. We study this problem by identifying different interpretations of structure rep- resentations, (...) and then discuss the formal properties that a suitable language needs for representing components, features and combinations of these. We show that the representation of components and features require a non-standard mereology. (shrink)

dolce, the first top-level ontology to be axiomatized, has remained stable for twenty years and today is broadly used in a variety of domains. dolce is inspired by cognitive and linguistic considerations and aims to model a commonsense view of reality, like the one human beings exploit in everyday life in areas as diverse as socio-technical systems, manufacturing, financial transactions and cultural heritage. dolce clearly lists the ontological choices it is based upon, relies on philosophical principles, is richly formalized, and (...) is built according to well-established ontological methodologies, e.g. OntoClean. Because of these features, it has inspired most of the existing top-level ontologies and has been used to develop or improve standards and public domain resources. Being a foundational ontology, dolce is not directly concerned with domain knowledge. Its purpose is to provide the general categories and relations needed to give a coherent view of reality, to integrate domain knowledge, and to mediate across domains. In these 20 years dolce has shown that applied ontologies can be stable and that interoperability across reference and domain ontologies is a reality. This paper briefly introduces the ontology and shows how to use it on a few modeling cases. (shrink)

We present two approaches to investigate the validity of connexive principles and related formulas and properties within coherence-based probability logic. Connexive logic emerged from the intuition that conditionals of the form if not-A, thenA, should not hold, since the conditional’s antecedent not-A contradicts its consequent A. Our approaches cover this intuition by observing that the only coherent probability assessment on the conditional event $${A| \overline{A}}$$ A | A ¯ is $${p(A| \overline{A})=0}$$ p ( A | A ¯ ) = 0. (...) In the first approach we investigate connexive principles within coherence-based probabilistic default reasoning, by interpreting defaults and negated defaults in terms of suitable probabilistic constraints on conditional events. In the second approach we study connexivity within the coherence framework of compound conditionals, by interpreting connexive principles in terms of suitable conditional random quantities. After developing notions of validity in each approach, we analyze the following connexive principles: Aristotle’s theses, Aristotle’s Second Thesis, Abelard’s First Principle, and Boethius’ theses. We also deepen and generalize some principles and investigate further properties related to connexive logic (like non-symmetry). Both approaches satisfy minimal requirements for a connexive logic. Finally, we compare both approaches conceptually. (shrink)

Starting from a recent paper by S. Kaufmann, we introduce a notion of conjunction of two conditional events and then we analyze it in the setting of coherence. We give a representation of the conjoined conditional and we show that this new object is a conditional random quantity, whose set of possible values normally contains the probabilities assessed for the two conditional events. We examine some cases of logical dependencies, where the conjunction is a conditional event; moreover, we give the (...) lower and upper bounds on the conjunction. We also examine an apparent paradox concerning stochastic independence which can actually be explained in terms of uncorrelation. We briefly introduce the notions of disjunction and iterated conditioning and we show that the usual probabilistic properties still hold. (shrink)

There is wide support in logic, philosophy, and psychology for the hypothesis that the probability of the indicative conditional of natural language, P(if A then B), is the conditional probability of B given A, P(B|A). We identify a conditional which is such that P(if A then B)=P(B|A) with de Finetti’s conditional event, B | A. An objection to making this identification in the past was that it appeared unclear how to form compounds and iterations of conditional events. In this paper, (...) we illustrate how to overcome this objection with a probabilistic analysis, based on coherence, of these compounds and iterations. We interpret the compounds and iterations as conditional random quantities, which sometimes reduce to conditional events, given logical dependencies. We also show, for the first time, how to extend the inference of centering for conditional events, inferring B|A from the conjunction A ^ B, to compounds and iterations of both conditional events and biconditional events, B || A, and generalize it to n-conditional events. (shrink)

Standards and ontologies for manufacturing understand resources differently. Because of this heterogeneity, misunderstandings arise concerning the basic features that characterize them. The purpose of the paper is to investigate how to ontologically model resources with the goal of facilitating the development of knowledge representation models for manufacturing. By reviewing the literature, we discuss and compare three approaches for the representation of resources depending on whether they are conceived in connection to either processes, plans or goals. By addressing the advantages and (...) shortcomings of each view, we present a unifying perspective to enable the modeling of resources in an integrated manner. In this way, the intended meanings of the used notions are harmonized and, as a result, one can facilitate multiple experts to interact e.g., via data sharing and/or data integration procedures. Differently, by keeping three separated views, there is no guarantee that data coming from different parties will share common meanings even if the same terms are used. By the end of the paper, we present a case study to show the application of our approach and to compare it with an existing ontology for manufacturing. (shrink)

À toutes les époques, les descriptions que font d’une ville les récits de voyage empruntent bien souvent leurs « clichés » à d’autres formes de littérature, voire, pour la période actuelle, au cinéma. Nous partirons de cette hypothèse pour explorer un corpus de narrations relatives à Marseille, ville portuaire et d’immigration avec laquelle l’Italie a tissé de nombreux liens familiers. Notre point de départ pourrait être le constat selon lequel les récits contemporains de voyage comme les rom...

Various semantics for studying the square of opposition and the hexagon of opposition have been proposed recently. We interpret sentences by imprecise (set-valued) probability assessments on a finite sequence of conditional events. We introduce the acceptability of a sentence within coherence-based probability theory. We analyze the relations of the square and of the hexagon in terms of acceptability. Then, we show how to construct probabilistic versions of the square and of the hexagon of opposition by forming suitable tripartitions of the (...) set of all coherent assessments. Finally, as an application, we present new versions of the square and of the hexagon involving generalized quantifiers. (shrink)

We deepen the study of conjoined and disjoined conditional events in the setting of coherence. These objects, differently from other approaches, are defined in the framework of conditional random quantities. We show that some well known properties, valid in the case of unconditional events, still hold in our approach to logical operations among conditional events. In particular we prove a decomposition formula and a related additive property. Then, we introduce the set of conditional constituents generated by $n$ conditional events and (...) we show that they satisfy the basic properties valid in the case of unconditional events. We obtain a generalized inclusion-exclusion formula, which can be interpreted by introducing a suitable distributive property. Moreover, under logical independence of basic unconditional events, we give two necessary and sufficient coherence conditions. The first condition gives a geometrical characterization for the coherence of prevision assessments on a family F constituted by n conditional events and all possible conjunctions among them. The second condition characterizes the coherence of prevision assessments defined on $F\cup K$, where $K$ is the set of conditional constituents associated with the conditional events in $F$. Then, we give some further theoretical results and we examine some examples and counterexamples. Finally, we make a comparison with other approaches and we illustrate some theoretical aspects and applications. (shrink)

We study probabilistically informative (weak) versions of transitivity by using suitable definitions of defaults and negated defaults in the setting of coherence and imprecise probabilities. We represent p-consistent sequences of defaults and/or negated defaults by g-coherent imprecise probability assessments on the respective sequences of conditional events. Finally, we present the coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases.

We present probabilistic approaches to check the validity of selected connexive principles within the setting of coherence. Connexive logics emerged from the intuition that conditionals of the form If ∼A, then A, should not hold, since the conditional’s antecedent ∼A contradicts its consequent A. Our approach covers this intuition by observing that for an event A the only coherent probability assessment on the conditional event A|~A is p(A|~A)=0 . Moreover, connexive logics aim to capture the intuition that conditionals should express (...) some “connection” between the antecedent and the consequent or, in terms of inferences, validity should require some connection between the premise set and the conclusion. This intuition is covered by a number of principles, a selection of which we analyze in our contribution. We present two approaches to connexivity within coherence-based probability logic. Specifically, we analyze connections between antecedents and consequents firstly, in terms of probabilistic constraints on conditional events (in the sense of defaults, or negated defaults) and secondly, in terms of constraints on compounds of conditionals and iterated conditionals. After developing different notions of negations and notions of validity, we analyze the following connexive principles within both approaches: Aristotle’s Theses, Aristotle’s Second Thesis, Abelard’s First Principle and selected versions of Boethius’ Theses. We conclude by remarking that coherence-based probability logic offers a rich language to investigate the validity of various connexive principles. (shrink)

In this paper we exploit the notions of conjoined and iterated conditionals, which are defined in the setting of coherence by means of suitable conditional random quantities with values in the interval [0,1]. We examine the iterated conditional (B|K)|(A|H), by showing that A|H p-entails B|K if and only if (B|K)|(A|H) = 1. Then, we show that a p-consistent family F={E1|H1, E2|H2} p-entails a conditional event E3|H3 if and only if E3|H3= 1, or (E3|H3)|QC(S) = 1 for some nonempty subset S (...) of F, where QC(S) is the quasi conjunction of the conditional events in S. Then, we examine the inference rules And, Cut, Cautious Monotonicity, and Or of System P and other well known inference rules (Modus Ponens, Modus Tollens, Bayes). We also show that QC(F)|C(F) = 1, where C(F) is the conjunction of the conditional events in F. We characterize p-entailment by showing that F p-entails E3|H3 if and only if (E3|H3)|C(F) = 1. Finally, we examine Denial of the antecedent and Affirmation of the consequent, where the p-entailment of (E3|H3) from F does not hold, by showing that (E3|H3)|C(F) is not equal to 1. (shrink)

Various semantics for studying the square of opposition have been proposed recently. So far, only [14] studied a probabilistic version of the square where the sentences were interpreted by (negated) defaults. We extend this work by interpreting sentences by imprecise (set-valued) probability assessments on a sequence of conditional events. We introduce the acceptability of a sentence within coherence-based probability theory. We analyze the relations of the square in terms of acceptability and show how to construct probabilistic versions of the square (...) of opposition by forming suitable tripartitions. Finally, as an application, we present a new square involving generalized quantifiers. (shrink)

We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model- theoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of default reasoning in System (...) . That is, we provide a new probabilistic semantics for System , which neither uses infinitesimal probabilities nor atomic bound (or big-stepped) probabilities. These results also provide new algorithms for probabilistic reasoning under coherence and for default reasoning in System , and they give new insight into default reasoning with conditional objects. (shrink)

We present a coherence-based probability semantics for (categorical) Aristotelian syllogisms. For framing the Aristotelian syllogisms as probabilistic inferences, we interpret basic syllogistic sentence types A, E, I, O by suitable precise and imprecise conditional probability assessments. Then, we define validity of probabilistic inferences and probabilistic notions of the existential import which is required, for the validity of the syllogisms. Based on a generalization of de Finetti's fundamental theorem to conditional probability, we investigate the coherent probability propagation rules of argument forms (...) of the syllogistic Figures I, II, and III, respectively. These results allow to show, for all three Figures, that each traditionally valid syllogism is also valid in our coherence-based probability semantics. Moreover, we interpret the basic syllogistic sentence types by suitable defaults and negated defaults. Thereby, we build a knowledge bridge from our probability semantics of Aristotelian syllogisms to nonmonotonic reasoning. Finally, we show how the proposed semantics can be used to analyze syllogisms involving generalized quantifiers. (shrink)

A coherence-based probability semantics for categorical syllogisms of Figure I, which have transitive structures, has been proposed recently (Gilio, Pfeifer, & Sanfilippo [15]). We extend this work by studying Figure II under coherence. Camestres is an example of a Figure II syllogism: from Every P is M and No S is M infer No S is P. We interpret these sentences by suitable conditional probability assessments. Since the probabilistic inference of ~????|???? from the premise set {????|????, ~????|????} is not (...) informative, we add ????(????|(????∨????))>0 as a probabilistic constraint (i.e., an “existential import assumption”) to obtain probabilistic informativeness. We show how to propagate the assigned (precise or interval-valued) probabilities to the sequence of conditional events (????|????,~????|????,????|(????∨????)) to the conclusion ~????|???? . Thereby, we give a probabilistic meaning to the other syllogisms of Figure II. Moreover, our semantics also allows for generalizing the traditional syllogisms to new ones involving generalized quantifiers (like Most S are P) and syllogisms in terms of defaults and negated defaults. (shrink)

This work analyzes the conceptual metaphors of depression in a corpus of 23 blogs written in Catalan by people suffering major depressive disorder. Its main aim was comparative, in order to check w...

En el siglo xi, la literatura dialógica nacida en el seno del cristianismo latino ha incluido en su repertorio de interlocutores a uno que resulta en todos los casos ficcional: el gentil. De allí que quepa preguntarse cuál es el propósito de dialogar con una otredad imaginaria. Se examinan las construcciones identitarias de los dos primeros personajes gentiles de los que hasta ahora se tiene noticia: el de la Disputatio christiani cum gentili de Gilberto Crispino y el de la (...) Disputatio inter christianum et gentilem del Pseudo-Anselmo. A partir de estas construcciones, se discutirá la función que cada gentil desempeña en su respectivo diálogo, con el objetivo de establecer qué relación mantienen estas identidades dialogantes con la intentio operis. (shrink)