Related papers: Weakly True Concurrency and Its Logic
Counterfactual statements, which describe events that did not or cannot take place, are beneficial to numerous NLP applications. Hence, we consider the problem of counterfactual detection (CFD) and seek to enhance the CFD models. Previous…
We establish a relation between the Schwarz inequality and the generalized concurrence of an arbitrary, pure, bipartite or tripartite state. This relation places concurrence in a geometrical and functional-analytical setting.
In many applications, it is important to be able to explain the decisions of machine learning systems. An increasingly popular approach has been to seek to provide \emph{counterfactual instance explanations}. These specify close possible…
Program equivalence is the fulcrum for reasoning about and proving properties of programs. For noninterference, for example, program equivalence up to the secrecy level of an observer is shown. A powerful enabler for such proofs are logical…
Mathematical reasoning models are widely deployed in education, automated tutoring, and decision support systems despite exhibiting fundamental computational instabilities. We demonstrate that state-of-the-art models (Qwen2.5-Math-7B)…
In this paper we investigate fair computations in the pi-calculus. Following Costa and Stirling's approach for CCS-like languages, we consider a method to label process actions in order to filter out unfair computations. We contrast the…
This thesis embarks on a comprehensive exploration of formal computational models that underlie typed programming languages. We focus on programming calculi, both functional (sequential) and concurrent, as they provide a compelling rigorous…
Weak bisimilarity is a distribution-based equivalence notion for Markov automata. It has gained some popularity as the coarsest reasonable behavioural equivalence on Markov automata. This paper studies a strictly coarser notion: Late weak…
Continuity is one of the most central notions in mathematics, physics, and computer science. An interesting associated topic is decompositions of continuity, where continuity is shown to be equivalent to the combination of two or more weak…
Tullock contests model real-life scenarios that range from competition among proof-of-work blockchain miners to rent-seeking and lobbying activities. We show that continuous-time best-response dynamics in Tullock contests with convex costs…
Cumulative logics are studied in an abstract setting, i.e., without connectives, very much in the spirit of Makinson's early work. A powerful representation theorem characterizes those logics by choice functions that satisfy a weakening of…
A relation is obtained between weak values of quantum observables and the consistency criterion for histories of quantum events. It is shown that ``strange'' weak values for projection operators (such as values less than zero) always…
We study the closure of approximating sequences of some diffusion equations under certain weak convergence. A specific description of the closure under weak $H^1$-convergence is given, which reduces to the original equation when the…
This article is devoted to questions concerning the existence of solutions for partial differential equation problems modeling granular flows. The models studied take into account the complex threshold rheology of these flows, as well as…
We introduce the notions of weakly *-concave and weakly naturally quasi-concave correspondence and prove fixed point theorems and continuous selection theorems for these kind of correspondences. As applications in the game theory, by using…
Reasoning is central to human intelligence. However, fallacious arguments are common, and some exacerbate problems such as spreading misinformation about climate change. In this paper, we propose the task of logical fallacy detection, and…
In this note we define a process algebra TCP (Truly Concurrent Processes) which corresponds closely with the automata model of concurrency based on Span(RGraph), the category of spans of reflexive graphs. In TCP, each process has a fixed…
We study whether a logic based on team semantics can be enriched with a conditional satisfying minimal requirements--namely, preservation of the closure property of the logic, Modus Ponens, and the Deduction Theorem. We show that such…
A weak measurement consists in coupling a system to a probe in such a way that constructive interference generates a large output. So far, only the average output of the probe and its variance were studied. Here, the characteristic function…
We study the weakest model of quantum nondeterminism in which a classical proof has to be checked with probability one by a quantum protocol. We show the first separation between classical nondeterministic communication complexity and this…