There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, namely, on the ascription of beliefs and inference rules by the agents to each other. We present a formal model of a system of bounded reasoners which reason about each other’s beliefs, and investigate the problem of belief ascription in a resource-bounded setting. We show that for agents whose computational resources and memory are bounded, (...) correct ascription of beliefs cannot be guaranteed, even in the limit. We propose a solution to the problem of correct belief ascription for feasible agents which involves ascribing reasoning strategies , or preferences on formulas, to other agents, and show that if a resource-bounded agent knows the reasoning strategy of another agent, then its ascription of beliefs to the other agent is correct in the limit. (shrink)

Coalition announcement logic is one of the family of the logics of quantified announcements. It allows us to reason about what a coalition of agents can achieve by making announcements in the setting where the anti-coalition may have an announcement of their own to preclude the former from reaching its epistemic goals. In this paper, we describe a PSPACE-complete model checking algorithm for CAL that produces winning strategies for coalitions. The algorithm is implemented in a proof-of-concept model checker.

We present a framework for verifying systems composed of heterogeneous reasoning agents, in which each agent may have differing knowledge and inferential capabilities, and where the resources each agent is prepared to commit to a goal (time, memory and communication bandwidth) are bounded. The framework allows us to investigate, for example, whether a goal can be achieved if a particular agent, perhaps possessing key information or inferential capabilities, is unable (or unwilling) to contribute more than a given portion of its (...) available computational resources or bandwidth to the problem. We present a novel temporal epistemic logic, BMCL-CTL , which allows us to describe a set of reasoning agents with bounds on time, memory and the number of messages they can exchange. The bounds on memory and communication are expressed as axioms in the logic. As an example, we show how to axiomatise a system of agents which reason using resolution and prove that the resulting logic is sound and complete. We then show how to encode a simple system of reasoning agents specified in BMCL-CTL in the description language of the Mocha model checker (Alur et al., Proceedings of the tenth international conference on computer-aided verification (CAV) , 1998), and verify that the agents can achieve a goal only if they are prepared to commit certain time, memory and communication resources. (shrink)

We show how sequent calculi for some generalized quantifiers can be obtained by generalizing the Herbrand approach to ordinary first order proof theory. Typical of the Herbrand approach, as compared to plain sequent calculus, is increased control over relations of dependence between variables. In the case of generalized quantifiers, explicit attention to relations of dependence becomes indispensible for setting up proof systems. It is shown that this can be done by turning variables into structured objects, governed by various types of (...) structural rules. These structured variables are interpreted semantically by means of a dependence relation. This relation is an analogue of the accessibility relation in modal logic. We then isolate a class of axioms for generalized quantifiers which correspond to first-order conditions on the dependence relation. (shrink)

Van Lambalgen (1990) proposed a translation from a language containing a generalized quantifierQ into a first-order language enriched with a family of predicatesR i, for every arityi (or an infinitary predicateR) which takesQxg(x, y1,..., yn) to x(R(x, y1,..., y1) (x,y1,...,yn)) (y 1,...,yn are precisely the free variables ofQx). The logic ofQ (without ordinary quantifiers) corresponds therefore to the fragment of first-order logic which contains only specially restricted quantification. We prove that it is decidable using the method of analytic tableaux. Related (...) results were obtained by Andréka and Németi (1994) using the methods of algebraic logic. (shrink)

Practical reasoners are resource-bounded—in particular they require time to derive consequences of their knowledge. Building on the Timed Reasoning Logics (TRL) framework introduced in [1], we show how to represent the time required by an agent to reach a given conclusion. TRL allows us to model the kinds of rule application and conflict resolution strategies commonly found in rule-based agents, and we show how the choice of strategy can influence the information an agent can take into account when making decisions (...) at a particular point in time. We prove general completeness and decidability results for TRL, and analyse the impact of communication in an example system consisting of two agents which use different conflict resolution strategies. (shrink)

The effective reasoning capability of an agent can be defined as its capability to infer, within a given space and time bound, facts that are logical consequences of its knowledge base. In this paper we show how to determine the effective reasoning capability of an agent with limited memory by encoding the agent as a transition system and automatically verifying whether a state where the agent believes a certain conclusion is reachable from the start state. We present experimental results using (...) the Model Based Planner (MBP) which illustrates how the length of the deduction varies for different memory sizes. (shrink)

We propose a framework for modelling situated resource-bounded agents. The framework is based on an objective ascription of intentional modalities and can be easily tailored to the system we want to model and the properties we wish to specify. As an elaboration of the framework, we introduce a logic, OBA, for describing the observations, beliefs, goals and actions of simple agents, and show that OBA is complete, decidable and has an efficient model checking procedure, allowing properties of agents specified in (...) OBA to be verified using standard theorem proving or model checking techniques. (shrink)

Agents which perform inferences on the basis of unreliable information need an ability to revise their beliefs if they discover an inconsistency. Such a belief revision algorithm ideally should be rational, should respect any preference ordering over the agent’s beliefs (removing less preferred beliefs where possible) and should be fast. However, while standard approaches to rational belief revision for classical reasoners allow preferences to be taken into account, they typically have quite high complexity. In this paper, we consider belief revision (...) for agents which reason in a simpler logic than full first-order logic, namely rule-based reasoners. We show that it is possible to define a contraction operation for rule-based reasoners, which we call McAllester contraction, which satisfies all the basic Alchourrón, Gärdenfors and Makinson (AGM) postulates for contraction (apart from the recovery postulate) and at the same time can be computed in polynomial time. We prove a representation theorem for McAllester contraction with respect to the basic AGM postulates (minus recovery), and two additional postulates. We then show that our contraction operation removes a set of beliefs which is least preferred, with respect to a natural interpretation of preference. Finally, we show how McAllester contraction can be used to define a revision operation which is also polynomial time, and prove a representation theorem for the revision operation. (shrink)

We show how sequent calculi for some generalized quantifiers can be obtained by generalizing the Herbrand approach to ordinary first order proof theory. Typical of the Herbrand approach, as compared to plain sequent calculus, is increased control over relations of dependence between variables. In the case of generalized quantifiers, explicit attention to relations of dependence becomes indispensible for setting up proof systems. It is shown that this can be done by turning variables into structured objects, governed by various types of (...) structural rules. These structured variables are interpreted semantically by means of a dependence relation. This relation is an analogue of the accessibility relation in modal logic. We then isolate a class of axioms for generalized quantifiers which correspond to first-order conditions on the dependence relation. (shrink)

We consider two systems of constructive modal logic which are computationally motivated. Their modalities admit several computational interpretations and are used to capture intensional features such as notions of computation, constraints, concurrency, etc. Both systems have so far been studied mainly from type-theoretic and category-theoretic perspectives, but Kripke models for similar systems were studied independently. Here we bring these threads together and prove duality results which show how to relate Kripke models to algebraic models and these in turn to the (...) appropriate categorical models for these logics. (shrink)

We consider a predicate logic Lfd where not all assignments of values to individual variables are possible. Some variables are functionally dependent on other variables. This makes sense if the models of logic are assumed to correspond to databases or states. We show that Lfd is undecidable but has a complete and sound sequent calculus formalisation.

(2012). Modal logics for reasoning about infinite unions and intersections of binary relations. Journal of Applied Non-Classical Logics: Vol. 22, No. 4, pp. 275-294. doi: 10.1080/11663081.2012.705960.

In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of something Ann is not aware of”—without using a stronger statement such as “Ann knows that Bill is aware of \(p\) and Ann is not aware of \(p\) ”, for some particular \(p\) . In Halpern and Rêgo (Proceedings of KR 2006; Games Econ Behav 67(2):503–525, 2009b) Halpern and Rêgo introduced a logic (...) in which such statements about knowledge of unawareness can be expressed. The logic extends the traditional framework with quantification over formulae, and is thus very expressive. As a consequence, it is not decidable. In this paper we introduce a decidable logic which can be used to reason about certain types of unawareness. Our logic extends the traditional framework with an operator expressing full awareness, i.e., the fact that an agent is aware of everything, and another operator expressing relative awareness, the fact that one agent is aware of everything another agent is aware of. The logic is less expressive than Halpern’s and Rêgo’s logic. It is, however, expressive enough to express all of the motivating examples in Halpern and Rêgo (Proceedings of KR 2006; Games Econ Behav 67(2):503–525, 2009b). In addition to proving that the logic is decidable and that its satisfiability problem is PSPACE-complete, we present an axiomatisation which we show is sound and complete. (shrink)

This special issue on Formal Models of Awareness contains five papers that concentrate on different approaches to the notion of awareness. They include syntactic and semantic approaches to modelling awareness and an alternative view from the multi-agent systems perspective where awareness is identified as the ability to perceive and understand actions of other agents.Velázquez-Quesada studies a logic of plausibility acknowledgement models used to interpret the notions of implicit and explicit beliefs. The models use the notion of a formula being acknowledged (...) as true that is similar to syntactic awareness in that the set of formulas acknowledged as true by an agent is not assumed to be closed under logical consequence. However it has a different meaning . A dynamic epistemic logic over such models is cons .. (shrink)

Public announcement logic is an extension of epistemic logic with dynamic operators that model the effects of all agents simultaneously and publicly acquiring the same piece of information. One of the extensions of PAL, group announcement logic, allows quantification over announcements made by agents. In GAL, it is possible to reason about what groups can achieve by making such announcements. It seems intuitive that this notion of coalitional ability should be closely related to the notion of distributed knowledge, the implicit (...) knowledge of a group. Thus, we study the extension of GAL with distributed knowledge, and in particular possible interaction properties between GAL operators and distributed knowledge. The perhaps surprising result is that, in fact, there are no interaction properties, contrary to intuition. We make this claim precise by providing a sound and complete axiomatisation of GAL with distributed knowledge. We also consider several natural variants of GAL with distributed knowledge, as well as some other related logic, and compare their expressive power. (shrink)

This LNCS book is part of the FOLLI book series and constitutes the proceedings of the 9th International Workshop on Logic, Rationality, and Interaction, LORI 2023, held in Jinan, China, in October 2023. The 15 full papers presented together with 7 short papers in this book were carefully reviewed and selected from 40 submissions. The workshop covers a wide range on the following topics such as agency; argumentation and agreement; belief representation; probability and uncertainty; belief revision and belief merging; knowledge (...) and action; dynamics of informational attitudes; intentions, plans, and goals; decision making and planning; preference and utility; cooperation; strategic reasoning and game theory; epistemology; social choice; social interaction; speech acts; knowledge representation; norms and normative systems; natural language; rationality; philosophical logic. (shrink)

This paper describes how to ethically conduct research with Black populations at the intersection of COVID-19 and the Black Lives Matter movement. We highlight the issues of historical mistrust in the USA and how this may impact Black populations’ participation in COVID-19 vaccination trials. We provide recommendations for researchers to ethically engage Black populations in research considering the current context. Our recommendations include understanding the impact of ongoing trauma, acknowledging historical context, ensuring diverse research teams and engaging in open and (...) honest conversations with Black populations to better address their needs. The core of our recommendation is recognising the impact of trauma in our research and health care practices. (shrink)

This study aims to investigate the spillover impact of work-family/family–work conflict and stress on five major industrial sectors, during the first wave of Covid-19. The purpose of this cross-sectional study is twofold; firstly, to test a hypothesized model where work-family/family-work conflicts are related to stress and where stress could exert a mediating role in such relationships. Secondly, we seek to explore the presence of these conflicts and stress in each of the five major industrial sectors and evaluate if there are (...) significant differences between them, identifying the sociodemographic characteristics associated. Two questionnaires were applied to 748 employees from the selected industries. According to our results, stress predicts both types of conflict and also exerts a mediator role. It was primarily found that the five sectors are significantly different regarding the work-family/family-work conflicts and stress. Findings and implications are discussed. (shrink)

Aversive autobiographical memories sometimes prompt maladaptive emotional responses and contribute to affective dysfunction in anxiety and depression. One way to regulate the impact of such memories is to create a downward counterfactual thought–a mental simulation of how the event could have been worse–to put what occurred in a more positive light. Despite its intuitive appeal, counterfactual thinking has not been systematically studied for its regulatory efficacy. In the current study, we compared the regulatory impact of downward counterfactual thinking, temporal distancing, (...) and memory rehearsal in 54 adult participants representing a spectrum of trait anxiety. Participants recalled regretful experiences and rated them on valence, arousal, regret, and episodic detail. Two to six days later, they created a downward counterfactual of the remembered event, thought of how they might feel about it 10 years from now, or simply rehearsed it. A day later, participants re-rated the phenomenological characteristics of the events. Across all participants, downward counterfactual thinking, temporal distancing, and memory rehearsal were equally effective at reducing negative affect associated with a memory. However, in individuals with higher trait anxiety, downward counterfactual thinking was more effective than rehearsal for reducing regret, and it was as effective as distancing in reducing arousal. We discuss these results in light of the functional theory of counterfactual thinking and suggest that they motivate further investigation into downward counterfactual thinking as a means to intentionally regulate emotional memories in affective disorders. (shrink)

The definition of consumerism is multifaceted, extending from the consumption of goods and services to its more negative connotations: the obsessive consumption of goods, exploitation of the people who create them and greed. In a society heavily influenced by consumerism, we find ourselves manipulated by social media and targeted advertising to buy goods or to cultivate a certain lifestyle, raising important ethical questions about responsibility and our autonomy to make decisions. How has the nature of how we create and consume (...) goods evolved and how is this linked to moral responsibility and autonomy? Can it also be argued that there is aesthetic appreciation to be gained from some of the items that we create and consume? (shrink)

In a review of the cell biology and heredity studies of 1900–1910, Bernardino Fantini argues that the choice of an experimental subject or organism was crucial in opening up new discoveries and new theories for specific fields of research.69 Thinking on a broader level, Bütschli expressed a similar view when he stated that an understanding of the true nature and structure of the “elementary organism” was crucial to the whole of biology. In this article we have traced the impact of (...) Bütschli's unicellular model of protozoa up to the general acceptance of the eukaryotic cell as nature's primary organism. We have also seen that Bütschli's vision in the Studien gave birth to Protistenforschung and Zellforschung, sister sciences whose task it was to further and integrate knowledge of the living cell. Of necessity, we have confined ourselves to German scientific developments. However, our attempt to recapture and define the unity and meaning of a biology of the “cell-microcosm” has given us pause to reconsider the development and nature of Wilhelmian biological science. (shrink)

This paper investigates when it is possible for a partial ordering P to force Pκ(λ) \ V to be stationary in VP. It follows from a result of Gitik that whenever P adds a new real, then Pκ(λ) \ V is stationary in VP for each regular uncountable cardinal κ in VP and all cardinals λ > κ in VP [4]. However, a covering theorem of Magidor implies that when no new ω-sequences are added, large cardinals become necessary [7]. The (...) following is equiconsistent with a proper class of ω₁-Erdős cardinals: If P is N₁-Cohen forcing, then Pκ(λ) \ V is stationary in VP, for all regular κ ≥ N₂ and all λ > κ. The following is equiconsistent with an ω₁-Erdős cardinal: If P is N₁-Cohen forcing, then PN₂ (N₃) \ V is stationary in VP. The following is equiconsistent with κ measurable cardinals: If P is κ-Cohen forcing, then Pκ + (Nκ \ V is stationary in VP. (shrink)

Counterfactual thinking, or simulating alternative versions of occurred events, is a common psychological strategy people use to process events in their lives. However, CFT is also a core com...

We define bisimulations for temporal logic with Since and Until. This new notion is compared to existing notions of bisimulations, and then used to develop the basic model theory of temporal logic with Since and Until. Our results concern both invariance and definability. We conclude with a brief discussion of the wider applicability of our ideas.

Conscience and Conscientious Objection of Health Care Professionals Refocusing the Issue Content Type Journal Article Pages 351-364 DOI 10.1007/s10730-009-9113-x Authors Natasha T. Morton, The University of Western Ontario Ontario Canada N6A 5B9 Kenneth W. Kirkwood, Arthur and Sonia Labatt Health Sciences Building London Ontario Canada N6A 5B9 Journal HEC Forum Online ISSN 1572-8498 Print ISSN 0956-2737 Journal Volume Volume 21 Journal Issue Volume 21, Number 4.

Refugees and asylum seekers may experience challenges related to pre-arrival experiences, structural disadvantage after migration and during resettlement requiring the need for special protection when participating in research. The aim was to review if and how people with refugee and asylum seeker backgrounds have had their need for special protection addressed in national and international research ethics guidelines. A systematic search of grey literature was undertaken. The search yielded 2187 documents of which fourteen met the inclusion criteria. Few guidelines addressed (...) specific ethical considerations for vulnerable groups much less people with refugee and asylum seeker backgrounds. One guideline explicitly addressed vulnerability for refugees and asylums seekers. To ensure members of ethics committees and researchers consider the potential challenges of conducting research with these groups, guidelines may need to be supplemented with a refugee and asylum seeker specific research ethics framework. Such a framework may be necessary to optimally protect people with refugee and asylum seeker backgrounds in research. (shrink)

Global co-stationarity of the ground model from an N₂-c.c, forcing which adds a new subset of N₁ is internally consistent relative to an ω₁-Erdös hyperstrong cardinal and a sufficiently large measurable above.

Previous work has shown that memory performance in older adults is affected by activation of a stereotype of age-related memory decline. In the present experiment, we examined whether stereotype threat would affect metamemory in older adults; that is, whether under stereotype threat they make poorer judgments about what they could remember. We tested older adults (MAge= 66.18 years) on a task in which participants viewed words paired with point values and “bet” on whether they could later recall each word. If (...) they bet on and recalled a word, they gained those points, but if they bet on and failed to recall a word, they lost those points. Thus, this task required participants to monitor how much they could remember and prioritize high value items. Participants performed this task over six lists of items either under stereotype threat about age-related memory decline or not under stereotype threat. Participants from both groups performed similarly on initial lists, but on later lists, participants under stereotype threat showed impaired performance as indicated by a lower average point score and a lower average gamma coefficient. The results suggest that a modest effect of stereotype threat on recall combined with a modest effect on metacognitive judgments to result in a performance deficit. This pattern of results may reflect an effect of stereotype threat on executive control reducing the ability to strategically use memory. (shrink)

This paper establishes a connection between structure sensitive categorial inference and classical modal logic. The embedding theorems for non-associative Lambek Calculus and the whole class of its weak Sahlqvist extensions demonstrate that various resource sensitive regimes can be modelled within the framework of unimodal temporal logic. On the semantic side, this requires decomposition of the ternary accessibility relation to provide its correlation with standard binary Kripke frames and models.

A Turing degree a is said to be almost everywhere dominating if, for almost all $X \in 2^{\omega}$ with respect to the "fair coin" probability measure on $2^{\omega}$ , and for all g: $\omega \rightarrow \omega$ Turing reducible to X, there exists f: $\omega \rightarrow \omega$ of Turing degree a which dominates g. We study the problem of characterizing the almost everywhere dominating Turing degrees and other, similarly defined classes of Turing degrees. We relate this problem to some questions in (...) the reverse mathematics of measure theory. (shrink)

England and Wales are moving toward a model of ‘opt out’ for use of personal confidential data in health research. Existing research does not make clear how acceptable this move is to the public. While people are typically supportive of health research, when asked to describe the ideal level of control there is a marked lack of consensus over the preferred model of consent. This study sought to investigate a relatively unexplored difference between the consent model that people prefer and (...) that which they are willing to accept. It also sought to explore any reasons for such acceptance. (shrink)

For many families, the idea of going out for walks and family adventures can be a dream that is erased by the determination of autistic spectrum in a child. Gaps in the health and quality of life of young people with autism spectrum disorder (ASD) are well documented. One particularly noticeable gap that affects both physical health and quality of life is in the area of outdoor recreation, particularly including outdoor recreation activities such as biking, hiking, running, canoeing/kayaking, horseback riding, (...) and skiing. Of the many outdoor activities to promote physical fitness, hiking is perhaps the most versatile and accessible for people with ASD. Hiking is a natural extension of walking. It is one of the first skills we acquire, one of the most important activities in everyday life and one of the few forms of recreation that does not require specific equipment and conditions. On the other hand, except for perhaps the most densely populated urban areas, there are almost always trails nearby. Lately even urban hikes that move around the city are becoming more and more popular. Whether you’re climbing the mountains at an expert level or hiking a trail, hiking gets your kids moving, which is of utmost importance in our modern society, when childhood seems to be filled more and more with time spent in front of the screens, and for children with autism this can become a serious problem. The main goal of this paper, on the one hand, is to increase awareness of the importance of hiking for psychophysical health, both for people from the general population and for people with ASD, but also to give recommendations for the approach and the way of organizing hiking activities for people with ASD, on the other hand. (shrink)

Are the state’s obligations to victims of its own wrongdoing greater than to persons who have suffered from bad luck? Many people endorse an affirmative answer to this question. Call this the Difference View. This view can seem arbitrary from the perspective of the victims in question; why should a victim of bad luck, who is just as badly off through no fault of her own, be entitled to less assistance from the state than a victim of state-caused wrongful harm? (...) This paper defends a qualified version of the Difference View, the Threshold Version of the Difference View. According to this view, all disadvantaged persons, no matter what the cause of their disadvantage, must be compensated until they reach a minimum threshold of wellbeing; however, among disadvantaged persons above this threshold, full compensation is owed for those who are victims of state wrongdoing, whereas full compensation is not necessarily owed to those who are disadvantaged due to bad luck. (shrink)

Henle, Mathias, and Woodin proved in [21] that, provided that${\omega }{\rightarrow }({\omega })^{{\omega }}$holds in a modelMof ZF, then forcing with$([{\omega }]^{{\omega }},{\subseteq }^*)$overMadds no new sets of ordinals, thus earning the name a “barren” extension. Moreover, under an additional assumption, they proved that this generic extension preserves all strong partition cardinals. This forcing thus produces a model$M[\mathcal {U}]$, where$\mathcal {U}$is a Ramsey ultrafilter, with many properties of the original modelM. This begged the question of how important the Ramseyness of$\mathcal (...) {U}$is for these results. In this paper, we show that several classes of$\sigma $-closed forcings which generate non-Ramsey ultrafilters have the same properties. Such ultrafilters include Milliken–Taylor ultrafilters, a class of rapid p-points of Laflamme,k-arrow p-points of Baumgartner and Taylor, and extensions to a class of ultrafilters constructed by Dobrinen, Mijares, and Trujillo. Furthermore, the class of Boolean algebras$\mathcal {P}({\omega }^{{\alpha }})/{\mathrm {Fin}}^{\otimes {\alpha }}$,$2\le {\alpha }<{\omega }_1$, forcing non-p-points also produce barren extensions. (shrink)