Related papers: Gibbardian Collapse and Trivalent Conditionals

We prove that a certain pair of bimodules over two artin algebras gives rise to a triangle equivalence between the singularity categories of the two corresponding trivial extension algebras. Some consequences and an example are given.

This paper is devoted to the investigation of term-definable connexive implications in substructural logics with exchange and, on the semantical perspective, in sub-varieties of commutative residuated lattices (FLe-algebras). In particular,…

For a variety $\mathcal{V}$, it has been recently shown that binary products commute with arbitrary coequalizers locally, i.e., in every fibre of the fibration of points $\pi: \mathrm{Pt} (\mathbb{C}) \rightarrow \mathbb{C}$, if and only if…

The Rearrangement Conjecture states that if two words over $\mathbb{P}$ are Wilf-equivalent in the factor order on $\mathbb{P}^\ast$ then they are rearrangements of each other. We introduce the notion of strong Wilf-equivalence and prove…

Let $j:Y \to X$ be a continuous surjection of compact metric spaces. Whyburn proved that $j$ is irreducible, meaning that $j(F) \subsetneq X$ for any proper closed subset $F \subsetneq Y$, if and only if $j$ is almost one-to-one, in the…

A bivariant functor is defined on a category of *-algebras and a category of operator ideals, both with actions of a second countable group $G$, into the category of abelian monoids. The element of the bivariant functor will be…

Glivenko's theorem states that a formula is derivable in classical propositional logic $\mathrm{CL}$ iff under the double negation it is derivable in intuitionistic propositional logic $\mathrm{IL}$: $\mathrm{CL}\vdash\varphi$ iff…

In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…

In the paper it is shown that the Kochen-Specker theorem follows from Burnside's theorem on noncommutative algebras. Accordingly, contextuality (as an impossibility of assigning binary values to projection operators independently of their…

We propose a model of incomplete \textit{twofold multiprior preferences}, in which an act $f$ is ranked above an act $g$ only when $f$ provides higher utility in a worst-case scenario than what $g$ provides in a best-case scenario. The…

Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original…

This is the first part of a series of papers studying the problem of existence of double categories for which horizontal bicategory and object category are given. We refer to this problem as the problem of existence of internalizations for…

We study the two Girard's translations of intuitionistic implication into linear logic by exploiting the bang calculus, a paradigmatic functional language with an explicit box-operator that allows both call-by-name and call-by-value…

One develops {\em ab initio} the theory of rational/birational maps over reduced, but not necessarily irreducible, projective varieties in arbitrary characteristic. A numerical invariant of a rational map is introduced, called the Jacobian…

We establish the convergence to the equilibrium for various linear collisional kinetic equations (including linearized Boltzmann and Landau equations) with physical local conservation laws in bounded domains with general Maxwell boundary…

Sophisticated machine models are increasingly used for high-stakes decisions in everyday life. There is an urgent need to develop effective explanation techniques for such automated decisions. Rule-Based Explanations have been proposed for…

We study bisimulation and context equivalence in a probabilistic $\lambda$-calculus. The contributions of this paper are threefold. Firstly we show a technique for proving congruence of probabilistic applicative bisimilarity. While the…

It is well known that many-sorted logic can be reduced to unsorted first-order logic by adding predicates for each sort, relativizing quantifiers to these predicates, and adding appropriate axioms governing their behavior. Existing…

We consider prescriptive type systems for logic programs (as in Goedel or Mercury). In such systems, the typing is static, but it guarantees an operational property: if a program is "well-typed", then all derivations starting in a…

Abductive forgetting is removing variables from a logical formula while maintaining its abductive explanations. It is carried in two alternative ways depending on its intended application. Both differ from the usual forgetting, which…