Related papers: The flattening operator in team-based logics
Ordered logics and type systems have been used in a variety of applications including computational linguistics, memory allocation, stream processing, logical frameworks, parametricity, and enforcing security protocols. In most…
Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a semantical platform and research program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth which it has more…
We introduce relational semantics for "flat Heyting-Lewis logic" $\mathsf{HLC}^{\flat}$. This logic arises as the extension of intuitionistic logic with a Lewis-style strict implication modality that, contrary to its "sharp" counterpart…
Over the past few years, the federated learning ($\texttt{FL}$) community has witnessed a proliferation of new $\texttt{FL}$ algorithms. However, our understating of the theory of $\texttt{FL}$ is still fragmented, and a thorough, formal…
Extensional higher-order logic programming has been introduced as a generalization of classical logic programming. An important characteristic of this paradigm is that it preserves all the well-known properties of traditional logic…
This paper presents an extension of temporal epistemic logic with operators that quantify over agent strategies. Unlike previous work on alternating temporal epistemic logic, the semantics works with systems whose states explicitly encode…
Generalized orthomodular posets were introduced recently by D. Fazio, A. Ledda and the first author of the present paper in order to establish a useful tool for studying the logic of quantum mechanics. They investigated structural…
In this paper, we introduce a novel team semantics of LTL inspired by inquisitive logic. The main features of the resulting logic, we call InqLTL, are the intuitionistic interpretation of implication and the Boolean semantics of…
A specification given as a formula in linear temporal logic (LTL) defines a system by its set of traces. However, certain features such as information flow security constraints are rather modeled as so-called hyperproperties, which are sets…
The recently introduced series of description logics under the common moniker DL-Lite has attracted attention of the description logic and semantic web communities due to the low computational complexity of inference, on the one hand, and…
We show that first-order logic can be translated into a very simple and weak logic, and thus set theory can be formalized in this weak logic. This weak logical system is equivalent to the equational theory of Boolean algebras with three…
We consider a Hilbert space that is a product of a finite number of Hilbert spaces and operators that are represented by "componental operators" acting on the Hilbert spaces that form the product space. We attribute operatorial properties…
Paul Halmos' work in dilation theory began with a question and its answer: Which operators on a Hilbert space can be extended to normal operators on a larger Hilbert space? The answer is interesting and subtle. The idea of representing…
It is widely accepted that the logic of quantum mechanics is based on orthomodular posets. However, such a logic is not dynamic in the sense that it does not incorporate time dimension. To fill this gap, we introduce certain tense operators…
This paper examines bilateral claims problems with lower and upper exclusion thresholds that determine whether an individual is excluded from initial gains or losses. We introduce the exclusion dilation operator, a method that transforms…
Inquisitive team logic is a variant of inquisitive logic interpreted in team semantics, which has been argued to provide a natural setting for the regimentation of dependence claims. With respect to sentences, this logic is known to be…
Several logical operators are defined as dual pairs, in different types of logics. Such dual pairs of operators also occur in other algebraic theories, such as mathematical morphology. Based on this observation, this paper proposes to…
Operator monotone functions, introduced by Lowner in 1934, are an important class of real-valued functions. They arise naturally in matrix and operator theory and have various applications in other branches of mathematics and related…
Epistemic logics typically talk about knowledge of individual agents or groups of explicitly listed agents. Often, however, one wishes to express knowledge of groups of agents specified by a given property, as in `it is common knowledge…
We study distributed composite optimization over networks: agents minimize the sum of a smooth (strongly) convex function, the agents' sum-utility, plus a non-smooth (extended-valued) convex one. We propose a general algorithmic framework…