Related papers: Weakly True Concurrency and Its Logic
In forecasting competitions, the traditional mechanism scores the predictions of each contestant against the outcome of each event, and the contestant with the highest total score wins. While it is well-known that this traditional mechanism…
The last few years has seen a growing debate about techniques for managing uncertainty in AI systems. Unfortunately this debate has been cast as a rivalry between AI methods and classical probability based ones. Three arguments for…
Classical-realistic analysis of entangled systems have lead to retrodiction paradoxes, which ordinarily have been dismissed on the grounds of counter-factuality. Instead, we claim that such paradoxes point to a deeper logical structure…
We propose a notion of concavity in two-sided many-to-one matching, which is an analogue to the balancedness condition in cooperative games. A stable matching exists when the market is concave. We provide a class of concave markets. In the…
This paper introduces a notion of equivalence for higher-dimensional automata, called weak equivalence. Weak equivalence focuses mainly on a traditional trace language and a new homology language, which captures the overall independence…
In order to analyze the dynamics of two languages in competition, one approach is to fit historical data on their numbers of speakers with a mathematical model in which the parameters are interpreted as the similarity between those…
We introduce three general compositionality criteria over operational semantics and prove that, when all three are satisfied together, they guarantee weak bisimulation being a congruence. Our work is founded upon Turi and Plotkin's…
This is an exposition on supercyclicity and weak supercyclicity, especially designed to advance further developments in weakly supercyclicity, which is a recent research field showing significant momentum during the past two decades. For…
Since the seminal paper by Tversky and Kahneman, the conjunction fallacy has been the subject of multiple debates and become a fundamental challenge for cognitive theories in decision-making. In this article, we take a rather uncommon…
We find the algebraic laws for true concurrency. Eventually, we establish a whole axiomatization for true concurrency called APTC (Algebra for Parallelism in True Concurrency). The theory APTC has four modules: BATC (Basic Algebra for True…
AI-driven outcomes can be challenging for end-users to understand. Explanations can address two key questions: "Why this outcome?" (factual) and "Why not another?" (counterfactual). While substantial efforts have been made to formalize…
Necessary and sufficient conditions for weak and vague convergence of measures are important for a diverse host of applications. This paper aims to give a comprehensive description of the relationship between the two modes of convergence…
In this article we investigate a parabolic-parabolic-elliptic two-species chemotaxis system with weak competition and show global asymptotic stability of the coexistence steady state under a smallness condition on the chemotactic strengths,…
A common statistical task lies in showing asymptotic normality of certain statistics. In many of these situations, classical textbook results on weak convergence theory suffice for the problem at hand. However, there are quite some…
We consider the verification of omega-regular linear temporal properties of concurrent programs running under weak memory semantics. We observe that in particular, these properties may enforce liveness clauses, whose verification in this…
Counterfactual reasoning is a foundational topic in both philosophical and logical studies \cite{Stalnaker1968-STAATO-5, Lewis1973-LEWC-2}. A pivotal component of counterfactual analysis is the concept of similarity between possible worlds…
The class of defeasible logics is only vaguely defined -- it is defined by a few exemplars and the general idea of efficient reasoning with defeasible rules. The recent definition of the defeasible logic $DL(\partial_{||})$ introduced new…
The theory of random attractors has different notions of attraction, amongst them pullback attraction and weak attraction. We investigate necessary and sufficient conditions for the existence of pullback attractors as well as of weak…
The existence of adversarial examples has led to considerable uncertainty regarding the trust one can justifiably put in predictions produced by automated systems. This uncertainty has, in turn, lead to considerable research effort in…
Given a set of people and a set of events they attend, we address the problem of measuring connectedness or tie strength between each pair of persons given that attendance at mutual events gives an implicit social network between people. We…