Related papers: Strong Negation is Definable in 2Int

We formulate a Hilbert-style axiomatic system for STIT logic of imagination recently proposed by H. Wansing and prove its completeness by the method of canonical models.

We prove that n-variable logics do not have the weak Beth definability property, for all n greater than 2. This was known for n=3 (Ildik\'o Sain and Andr\'as Simon), and for n greater than 4 (Ian Hodkinson). Neither of the previous proofs…

This note gives a brief review of the integrable structures presented in the Seiberg-Witten approach to the N=2 SUSY gauge theories with emphasize on the case of the gauge theories with matter hypermultiplets included (described by spin…

We introduce the notion of weak Lie 2-bialgebra. Roughly, a weak Lie 2-bialgebra is a pair of compatible 2-term $L_\infty$-algebra structures on a vector space and its dual. The compatibility condition is described in terms of the big…

We show that the finite satisfiability problem for the unary negation fragment with arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actually holds for a more general setting in which one can require…

Deep neural networks are vulnerable to adversarial attacks and hard to interpret because of their black-box nature. The recently proposed invertible network is able to accurately reconstruct the inputs to a layer from its outputs, thus has…

Let R be a commutative ring with identity and M be an R-module. In this paper, we will introduce the concept of 2-irreducible (resp., strongly 2- irreducible) submodules of M as a generalization of irreducible (resp., strongly irreducible)…

We find that second order quantification is problematic when a quantified concept variable is supposed to function predicatively. This issue is analyzed and it is shown that a constructive interpretation of the falling under relation…

We introduce a two-dimensional metric (interval) temporal logic whose internal and external time flows are dense linear orderings. We provide a suitable semantics and a sequent calculus with axioms for equality and extralogical axioms. Then…

We study counterfactual classification as a new tool for decision-making under hypothetical (contrary to fact) scenarios. We propose a doubly-robust nonparametric estimator for a general counterfactual classifier, where we can incorporate…

We discuss the application of the determinantal method to the proof of the Riemann hypothesis. We start from the fact that, if a certain doubly infinite set of determinants are all positive, then the hypothesis is true. This approach…

Inspired by Hintikka's treatment of question embedding verbs in [8] and the variations of noncontingency operator, we propose a logic with strong noncontingency operator $\blacktriangle$ as the only primitive modality. A proposition is…

We construct a class of negative spin irreducible representations of the su(2) Lie algebra. These representations are infinite-dimensional and have an indefinite inner product. We analyze the decomposition of arbitrary products of positive…

A 2-group is a `categorified' version of a group, in which the underlying set G has been replaced by a category and the multiplication map m: G x G -> G has been replaced by a functor. A number of precise definitions of this notion have…

It is shown that order-invariance of two-variable first-logic is decidable in the finite. This is an immediate consequence of a decision procedure obtained for the finite satisfiability problem for existential second-order logic with two…

For an arbitrary infinite-dimensional Banach space $\X$, we construct examples of strongly-measurable $\X$-valued Pettis integrable functions whose indefinite Pettis integrals are nowhere weakly differentiable; thus, for these functions the…

Regular nested word languages (a.k.a. visibly pushdown languages) strictly extend regular word languages, while preserving their main closure and decidability properties. Previous works have shown that considering languages of 2-nested…

Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible…

This note gives a unifying characterization and exposition of strongly irreducible elements and their duals in lattices. The interest in the study of strong irreducibility stems from commutative ring theory, while the dual concept of strong…

Let $f(n)=\sum_k \binom nk^{-1}$. In a previous paper, we defined for a p-adic integer x that f(x) is p-definable if lim $f(x_j)$ exists in $Q_p$, where $x_j$ denotes the mod $p^j$ reduction of $x$. We proved that if p is odd, then -1 is…