A logical approach to Bell's Inequalities of quantum mechanics has been introduced by Abramsky and Hardy [2]. We point out that the logical Bell's Inequalities of [2] are provable in the probability logic of Fagin, Halpern and Megiddo [4]. Since it is now considered empirically established that quantum mechanics violates Bell's Inequalities, we introduce a modified probability logic, that we call quantum team logic, in which Bell's Inequalities are not provable, and prove a Completeness Theorem for (...) this logic. For this end we generalise the team semantics of dependence logic [7] first to probabilistic team semantics, and then to what we call quantum team semantics. (shrink)

In this article we study linear temporal logics with team semantics that are novel logics for defining hyperproperties. We define Kamp-type translations of these logics into fragments of first-order team logic and second-order logic. We also characterize the expressive power and the complexity of model-checking and satisfiability of team logic and second-order logic by relating them to second- and third-order arithmetic. Our results set in a larger context the recent results of Lück showing (...) that the extension of TeamLTL by the Boolean negation is highly undecidable under the so-called synchronous semantics. We also study stutter-invariant fragments of extensions of TeamLTL. (shrink)

Abstract Orthodox decision theory presupposes that agency is invested in individuals. An opposing literature allows team agency to be invested in teams whose members use distinctive modes of team reasoning. This paper offers a new conceptual framework, inspired by David Lewis's analysis of common reasons for belief, within which team reasoning can be represented. It shows how individuals can independently endorse a principle of team reasoning which prescribes acting as a team member conditional on assurance (...) that others have endorsed the same principle. It argues that there can be such assurance even when no individual has an obligation to act on team reasoning. *This paper originated in a lecture that I gave at a Colloquium on Collective Intentions at Erasmus University Rotterdam. I thank participants, and particularly Govert den Hartogh, for comments. The analysis presented in this paper is an offshoot of a larger project, which uses David Lewis's work as the starting point for a reconstruction of the foundations of game theory. That project is joint work with Robin Cubitt. The specific idea of using this approach to analyse team reasoning grew out of a discussion with Michael Bratman. My work was supported by the Leverhulme Trust. (shrink)

In this paper, we introduce a logic based on team semantics, called $\mathbf {FOT} $, whose expressive power is elementary, i.e., coincides with first-order logic both on the level of sentences and (possibly open) formulas, and we also show that a sublogic of $\mathbf {FOT} $, called $\mathbf {FOT}^{\downarrow } $, captures exactly downward closed elementary (or first-order) team properties. We axiomatize completely the logic $\mathbf {FOT} $, and also extend the known partial axiomatization of (...) dependence logic to dependence logic enriched with the logical constants in $\mathbf {FOT}^{\downarrow } $. (shrink)

We use sets of assignments, a.k.a. teams, and measures on them to define probabilities of first-order formulas in given data. We then axiomatise first-order properties of such probabilities and prove a completeness theorem for our axiomatisation. We use the Hardy–Weinberg Principle of biology and the Bell’s Inequalities of quantum physics as examples.

Team semantics is a highly general framework for logics which describe dependencies and independencies among variables. Typically, the dependencies considered in this context are properties of sets of configurations or data records. We show how team semantics can be further generalized to support languages for the discussion of interventionist counterfactuals and causal dependencies, such as those that arise in manipulationist theories of causation. We show that the “causal teams” we introduce in the present paper can be used for (...) modelling some classical counterfactual scenarios which are not captured by the usual causal models. We then analyse the basic properties of our counterfactual languages and discuss extensively the differences with respect to the Lewisian tradition. (shrink)

Identifying optimal ways of organizing exploration in particle physics mega-labs is a challenging task that requires a combination of case-based and formal epistemic approaches. Data-driven studies suggest that projects pursued by smaller master-teams are substantially more efficient than larger ones across sciences, including experimental particle physics. Smaller teams also seem to make better project choices than larger, centralized teams. Yet the epistemic requirement of small, decentralized, and diverse teams contradicts the often emphasized and allegedly inescapable logic of discovery that (...) forces physicists pursuing the fundamental levels of the physical world to perform centralized experiments in mega-labs at high energies. We explain, however, that this epistemic requirement could be met, since the nature of theoretical and physical constraints in high energy physics and the technological obstacles stemming from them turn out to be surprisingly open-ended. (shrink)

We investigate extensions of dependence logic with generalized quantifiers. We also introduce and investigate the notion of a generalized atom. We define a system of semantics that can accommodate variants of dependence logic, possibly extended with generalized quantifiers and generalized atoms, under the same umbrella framework. The semantics is based on pairs of teams, or double teams. We also devise a game-theoretic semantics equivalent to the double team semantics. We make use of the double team semantics (...) by defining a logic $$\hbox {DC}^2$$ DC 2 which canonically fuses together two-variable dependence logic $$\hbox {D}^2$$ D 2 and two-variable logic with counting quantifiers $$\hbox {FOC}^2$$ FOC 2 . We establish that the satisfiability and finite satisfiability problems of $$\hbox {DC}^2$$ DC 2 are complete for $$\hbox {NEXPTIME}$$ NEXPTIME. (shrink)

We used agent-based modelling to highlight the advantages and disadvantages of several management styles in biology, ranging from centralized to egalitarian ones. In egalitarian groups, all team members are connected with each other, while in centralized ones, they are only connected with the principal investigator. Our model incorporated time constraints, which negatively influenced weakly connected groups such as centralized ones. Moreover, our results show that egalitarian groups outperform others if the questions addressed are relatively simple or when the communication (...) among agents is limited. Complex epistemic spaces are explored best by centralized groups. They outperform other team structures because the individual members can develop their own ideas with less interference of the opinions of others. The optimal ratio between time spent on experimentation and dissemination varies between different organizational structures. Furthermore, if the evidence is shared only after a relevant degree of certainty is reached, all investigated groups epistemically profit. We discovered that the introduction of seminars to the model changes the epistemic performance in favour of weakly connected teams. Finally, the abilities of the principal investigator do not seem to outperform cognitive diversity, as group performances were not strongly influenced by the increase of her abilities. (shrink)

In this paper, we analyze the relationship between the logic of gift and team performance. We explore this connection empirically, using a detailed data set from the National Basketball Association. In particular, we use the NBA Cares Community Assist Award as a way to measure gift-giving to the community. We explore the response of an entire team after one if its members has been recognized for his gift-giving behavior. Using two winners, we show that after a player (...) has received the award there is an increase in the number of assists given by each member of the team, and that there is also an increase in the number of wins. Therefore, our results show that the team’s performance would improve after a player has been recognized because of his gift-giving attitude. This finding to management implies that managers’ incentivization of a sharing and giving philosophy would not only improve their relationship bond but it would also help them increase their performance. (shrink)

This study analyses behaviour in non-zero-sum finite multi-stage games, particularly the Centipede Game. The classical Nash Equilibrium fails to explain empirical behaviour and intuitive logic and has therefore been challenged. This paper introduces the ‘Pure Collective Equilibrium’, or PCE, which describes the equilibrium reached when agents assess their utility not by their own payoffs but by the mean collective payoff of the team, as outlined by some team-reasoning hypotheses. Classical behaviour and purely collective team reasoning then (...) both represent special cases—the first in which agents and their counterparts are on the Nash Equilibrium path, and the second in which agents and their counterparts are purely collective team reasoners. It is argued that agents intentionally and consistently deviate from classical rationality in the Centipede Game, even in the absence of philanthropic altruists or error-plagued populations. (shrink)

We analyze the causal-observational languages that were introduced in Barbero and Sandu (2018), which allow discussing interventionist counterfactuals and functional dependencies in a unified framework. In particular, we systematically investigate the expressive power of these languages in causal team semantics, and we provide complete natural deduction calculi for each language. Furthermore, we introduce a generalized semantics which allows representing uncertainty about the causal laws, and we analyze the expressive power and proof theory of the causal-observational languages over this enriched (...) semantics. (shrink)

We study the expressive power of open formulas of dependence logic introduced in Väänänen [Dependence logic (Vol. 70 of London Mathematical Society Student Texts), 2007]. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable by means of identity only in dependence logic, or equivalently in independence friendly logic.

I will show that the semantic structure of a new imperfect-information propositional logic can be described in terms of extensive forms of semantic games. I will discuss some ensuing properties of these games such as imperfect recall, informational consistency, and team playing. Finally, I will suggest a couple of applications that arise in physics, and most notably in quantum theory and quantum logics.

This paper investigates formal logics for reasoning about determinacy and independence. Propositional Dependence Logic D and Propositional Independence Logic I are recently developed logical systems, based on team semantics, that provide a framework for such reasoning tasks. We introduce two new logics L_D and L_I, based on Kripke semantics, and propose them as alternatives for D and I, respectively. We analyse the relative expressive powers of these four logics and discuss the way these systems relate to natural (...) language. We argue that L_D and L_I naturally resolve a range of interpretational problems that arise in D and I.We also obtain sound and complete axiomatizations for L_D and L_I . (shrink)

We study the extension of dependence logic \ by a majority quantifier \ over finite structures. We show that the resulting logic is equi-expressive with the extension of second-order logic by second-order majority quantifiers of all arities. Our results imply that, from the point of view of descriptive complexity theory, \\) captures the complexity class counting hierarchy. We also obtain characterizations of the individual levels of the counting hierarchy by fragments of \\).

We continue the work on the relations between independence logic and the model-theoretic analysis of independence, generalizing the results of [15] and [16] to the framework of abstract independence relations for an arbitrary AEC. We give a model-theoretic interpretation of the independence atom and characterize under which conditions we can prove a completeness result with respect to the deductive system that axiomatizes independence in team semantics and statistics.

Noun phrases with overt determiners, such as <i>some apples</i> or <i>a quantity of milk</i>, differ from bare noun phrases like <i>apples</i> or <i>milk</i> in their contribution to aspectual composition. While this has been attributed to syntactic or algebraic properties of these noun phrases, such accounts have explanatory shortcomings. We suggest instead that the relevant property that distinguishes between the two classes of noun phrases derives from two modes of existential quantification, one of which holds the values of a variable fixed (...) throughout a quantificational context while the other allows them to vary. Inspired by Dynamic Plural Logic and Dependence Logic, we propose Plural Predicate Logic as an extension of Predicate Logic to formalize this difference. We suggest that temporal <i>for</i>-adverbials are sensitive to aspect because of the way they manipulate quantificational contexts, and that analogous manipulations occur with spatial <i>for</i>-adverbials, habituals, and the quantifier <i>all</i>. (shrink)

Background Despite decades of anti-racism and equity, diversity, and inclusion (EDI) interventions in academic medicine, medical racism continues to harm patients and healthcare providers. We sought to deeply explore experiences and beliefs about medical racism among academic clinicians to understand the drivers of persistent medical racism and to inform intervention design. Methods We interviewed academically-affiliated clinicians with any racial identity from the Departments of Family Medicine, Cardiac Sciences, Emergency Medicine, and Medicine to understand their experiences and perceptions of medical racism. (...) We performed thematic content analysis of semi-structured interview data to understand the barriers and facilitators of ongoing medical racism. Based on participant narratives, we developed a logic framework that demonstrates the necessary steps in the process of addressing racism using if/then logic. This framework was then applied to all narratives and the barriers to addressing medical racism were aligned with each step in the logic framework. Proposed interventions, as suggested by participants or study team members and/or identified in the literature, were matched to these identified barriers to addressing racism. Results Participant narratives of their experiences of medical racism demonstrated multiple barriers to addressing racism, such as a perceived lack of empathy from white colleagues. Few potential facilitators to addressing racism were also identified, including shared language to understand racism. The logic framework suggested that addressing racism requires individuals to understand, recognize, name, and confront medical racism. Conclusions Organizations can use this logic framework to understand their local context and select targeted anti-racism or EDI interventions. Theory-informed approaches to medical racism may be more effective than interventions that do not address local barriers or facilitators for persistent medical racism. (shrink)

Directed acyclic graphs (DAGs) constitute a qualitative representation for conditional independence (CI) properties of a probability distribution. It is known that every CI statement implied by the topology of a DAG is witnessed over it under a graph-theoretic criterion of d-separation. Alternatively, all such implied CI statements are derivable from the local independencies encoded by a DAG using the so-called semi-graphoid axioms. We consider Labeled Directed Acyclic Graphs (LDAGs) modeling graphically scenarios exhibiting context-specific independence (CSI). Such CSI statements are modeled (...) by labeled edges, where labels encode contexts in which the edge vanishes. We study the problem of identifying all independence statements implied by the structure and the labels of an LDAG. We show that this problem is coNP-hard for LDAGs and formulate a sound extension of the semi-graphoid axioms for the derivation of such implied independencies. Finally we connect our study to certain qualitative versions of independence ubiquitous in database theory and teams semantics. (shrink)

This study investigates rehabilitation team members’ interactive accomplishments of their domains of work and responsibility in rehabilitation team conferences in Japan. A combination of membership categorization analysis and sequential analysis is adopted to systematically illustrate the situated productions of professional sense-making practices. Analysis focuses on the segment in which a physician asks a series of questions regarding a patient’s functional status and disability coded in the functional assessment record (FAR). A close examination of data shows that a physician (...) does not always choose a respondent with his or her gaze when asking a question because s/he is continuously reading the FAR displayed on a computer screen. Despite this, a physician’s mention of a topic generates a professional’s domain of work and responsibility in a local division of labor which is used by members to assume who the relevant categorial respondent is. Further, members demonstrate these assumptions by shifting their gazes toward the computer screen, back to the document on the desk, and turning toward co-participants, thus embodying professional roles and responsibilities in situ. This study utilizes the analyst’s ethnographic understanding of the routines and division of labor at the rehabilitation ward as a resource to explicate professional sense-making practices, thus utilizing Garfinkel’s ethnomethodological studies of work. Together with sequential and categorial resources offered by Sacks, this study elucidates inferences and normative expectations which rehabilitation team members bring together to reproduce the endogenous logic of rehabilitation culture in actual occasions of the institutional life. (shrink)

In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of statements, and added formulas expressing questions and dependencies to this classical core. In this paper, we broaden the scope of these investigations by studying questions and dependency in the context of intuitionistic logic. We propose an intuitionistic team semantics, where (...) teams are embedded within intuitionistic Kripke models. The associated logic is a conservative extension of intuitionistic logic with questions and dependence formulas. We establish a number of results about this logic, including a normal form result, a completeness result, and translations to classical inquisitive logic and modal dependence logic. (shrink)

We introduce generalized quantifiers, as defined in Tarskian semantics by Mostowski and Lindström, in logics whose semantics is based on teams instead of assignments, e.g., IF-logic and Dependence logic. Both the monotone and the non-monotone case is considered. It is argued that to handle quantifier scope dependencies of generalized quantifiers in a satisfying way the dependence atom in Dependence logic is not well suited and that the multivalued dependence atom is a better choice. This atom is in (...) fact definably equivalent to the independence atom recently introduced by Väänänen and Grädel. (shrink)

Feminist scholars have critically analyzed the effects of sex segregation in numerous social institutions, yet sex-segregated sport often remains unchallenged. Even critics of sex-segregated sport have tended to accept the merits of women-only teams at face value. In this article, we revisit this issue by examining the underlying assumptions supporting women’s and girls’ teams and explore how they perpetuate gender inequality. Specifically, we analyze the 14 U.S. court cases wherein adolescent boys have sought to play on girls’ teams in their (...) respective high schools. The courts’ decisions reveal taken-for-granted, essentialist assumptions about girls’ innate fragility and athletic inferiority. While the courts, policy makers, and many feminist scholars see maintaining teams for girls and women as a solution to the problem of boys’ and men’s dominance in sport, the logic supporting this form of segregation further entrenches notions of women’s inferiority. (shrink)

We prove that for any finite deduction structure there exists a unique concise-widest chain-preserved split. Based on this result, we propose a logical splitting strategy which enables an agent to split its belief structure such that all the original inference chains can be preserved. The significance of such logical splitting at least is four-fold: It can be used by an agent to separate its concerns appropriately, or even create smaller and smarter clones which could save time and efforts in their (...) deliberation computing; It will enable an agent to adjust its concerns dynamically based on its recognition of the current situation, which may further enable the agent to make rapid and rational decisions when situation shifting occurs; In periodic team synchronization domains where agents can periodically synchronize their behaviors with no restriction on communication, it can be employed as a critical process for maintaining the shared mental models among a team of agents; and It is helpful in alleviating the complexity of reasoning about relevant information, and in better anticipating both explicit and implicit information needs based on the recognition of the current situation. (shrink)

In To be is to be the object of a possible act of choice the authors defended Boolos’ thesis that plural quantification is part of logic. To this purpose, plural quantification was explained in terms of plural reference, and a semantics of plural acts of choice, performed by an ideal team of agents, was introduced. In this paper, following that approach, we develop a theory of concepts that—in a sense to be explained—can be labeled as a theory of (...) logical concepts. Within this theory, we propose a new logicist approach to natural numbers. Then, we compare our logicism with Frege’s traditional logicism. (shrink)

Featuring fourteen new essays from an international team of renowned contributors, this volume explores the key issues, debates and questions in the metaphysics of logic. The book is structured in three parts, looking first at the main positions in the nature of logic, such as realism, pluralism, relativism, objectivity, nihilism, conceptualism, and conventionalism, then focusing on historical topics such as the medieval Aristotelian view of logic, the problem of universals, and Bolzano's logical realism. The final section (...) tackles specific issues such as glutty theories, contradiction, the metaphysical conception of logical truth, and the possible revision of logic. The volume will provide readers with a rich and wide-ranging survey, a valuable digest of the many views in this area, and a long overdue investigation of logic's relationship to us and the world. It will be of interest to a wide range of scholars and students of philosophy, logic, and mathematics. (shrink)

Intuitionistic dependence logic was introduced by Abramsky and Väänänen [1] as a variant of dependence logic under a general construction of Hodges’ (trump) team semantics. It was proven that there is a translation from intuitionistic dependence logic sentences into second order logic sentences. In this paper, we prove that the other direction is also true, therefore intuitionistic dependence logic is equivalent to second order logic on the level of sentences.

By introducing and extending description logic (DLs) and growing up their application in knowledge representation and especially in OWLs and semantic web scope, many shortcomings and bugs were identified that weren’t resolvable in classical DLs and so logicians and computer scientists intended to non-classical and non-monotonic reasoning tools. In this paper, I discuses about abduction problem solvers, and by introducing A-Box abduction in description logics (DLs), such as ALC, discuss about decidability and complexity in different introduced algorithms, and report (...) shortly our team’s advantages in developing and implementation of ΑBox abduction in DLs. (shrink)

We show that for any pair $\phi$ and $\psi$ of contradictory formulas of dependence logic there is a formula $\theta$ of the same logic such that $\phi\equiv\theta$ and $\psi\equiv\neg\theta$. This generalizes a result of Burgess.

In this tutorial, the meaning of natural language is analysed along the lines proposed by Gottlob Frege and Richard Montague. In building meaning representations, we assume that the meaning of a complex expression derives from the meanings of its components. Typed logic is a convenient tool to make this process of composition explicit. Typed logic allows for the building of semantic representations for formal languages and fragments of natural language in a compositional way. The tutorial ends with the (...) discussion of an example fragment, implemented in the functional programming language Haskell Haskell Team; Jones.. (shrink)

We study the computational complexity of the model checking problem for quantifier-free dependence logic ${(\mathcal{D})}$ formulas. We characterize three thresholds in the complexity: logarithmic space (LOGSPACE), non-deterministic logarithmic space (NL) and non-deterministic polynomial time (NP).

In this work, we present a new approach to solve the location management problem by using the reporting cells strategy. Location management is a very important and complex problem in mobile computing which aims to minimize the costs involved. In the reporting cells location management scheme, some cells in the network are designated as reporting cells . The choice of these cells is not trivial because they affect directly to the cost of the mobile network. This article is focused on (...) the use of high performance computing to execute a parallel heuristic that places optimally the RCs in a mobile network, minimizing its total cost. The main goal of this work is to demonstrate that the collaborative work of different evolutionary algorithms can obtain very good results. For this reason, we have implemented a parallel heuristic and six evolutionary algorithms that works in a parallel way on a cluster to solve the RCs problem. (shrink)

I propose a modal logic that enables to reason about self-regarding and otherregarding motivations in strategic games. This logic integrates the concepts of joint action, belief, individual and group payoff. The first part of the article is focused on self-regarding agents. A self-regarding agent decides to perform a certain action only if he believes that this action maximizes his own personal benefit. The second part of the article explores different kinds of other-regarding motivations such as fairness and reciprocity. (...) Differently from self-regarding agents, other-regarding agents also consider the benefits of their choices for the group. Moreover, their decisions can be affected by their beliefs about other agents' willingness to act for the well-being of the group. The analysis also considers team-directed reasoning, i.e. the mode of reasoning that people use when they take themselves to be acting as members of a group or a team. (shrink)

Acknowledgement for the support of publication of JSRI no. 3.

List of books published by Moshe Idel in European languages.