English
Related papers

Related papers: Disjunction and existence properties in modal arit…

200 papers

Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…

Rings and Algebras · Mathematics 2023-06-22 Robin Hirsch , Brett McLean

$B$-terms are built from the $B$ combinator alone defined by $B\equiv\lambda fgx. f(g~x)$, which is well known as a function composition operator. This paper investigates an interesting property of $B$-terms, that is, whether repetitive…

Logic in Computer Science · Computer Science 2023-06-22 Mirai Ikebuchi , Keisuke Nakano

A bisimulation for a coalgebra of a functor on the category of sets can be described via a coalgebra in the category of relations, of a lifted functor. A final coalgebra then gives rise to the coinduction principle, which states that two…

Logic in Computer Science · Computer Science 2023-06-22 Herman Geuvers , Bart Jacobs

Let $\cal A$ and $\cal B$ be Banach algebras. A linear map $T:{\cal A} \rightarrow {\cal B}$ is called separating or disjointness preserving if $ab=0$ implies $Ta\;Tb = 0$ for all $a,b\in {\cal A}$. In this paper, we study a new class of…

Functional Analysis · Mathematics 2013-11-04 Mahmood Alaghmandan , Rasoul Nasr-Isfahani , Mehdi Nemati

The power of the disconjugacy properties of second-order differential equations of Schr\"odinger type to check the regularity of rationally-extended quantum potentials connected with exceptional orthogonal polynomials is illustrated by…

Mathematical Physics · Physics 2012-12-11 Yves Grandati , Christiane Quesne

This paper studies the relationship between disjunctive form, a syntactic normal form for the modal mu calculus, and the alternation hierarchy. First it shows that all disjunctive formulas which have equivalent tableau have the same…

Logic in Computer Science · Computer Science 2015-09-11 Karoliina Lehtinen

In the article we investigate three classes of extended Boolean Connexive Logics. Two of them are extensions of Modal and non-Modal Boolean Connexive Logics with a property of closure under an arbitrary number of negations. The remaining…

Logic · Mathematics 2024-03-20 Tomasz Jarmuzek , Jacek Malinowski , Aleksander Parol , Nicolo Zamperlin

Nontrivial combinatory algebras with S and K must be infinite. Associativity is incompatible with combining a classifier and a retraction pair in a finite extensional magma. These obstructions exclude several standard settings from the…

Logic in Computer Science · Computer Science 2026-04-07 Stefano Palmieri

In this paper, we investigate diagrams, namely functors from any small category to a fixed category, and more particularly, their bisimilarity. Initially defined using the theory of open maps of Joyal et al., we prove several equivalent…

Logic in Computer Science · Computer Science 2020-06-08 Jérémy Dubut

We show various vanishing theorems for the cohomology groups of compact hermitian manifolds for which the Bismut connection has (restricted) holonomy contained in SU(n) and classify all such manifolds of dimension four. In this way we…

Differential Geometry · Mathematics 2009-10-09 S. Ivanov , G. Papadopoulos

We consider two sequences $a(n)$ and $b(n)$, $1\leq n<\infty$, generated by Dirichlet series $$\sum_{n=1}^{\infty}\frac{a(n)}{\lambda_n^{s}}\qquad\text{and}\qquad \sum_{n=1}^{\infty}\frac{b(n)}{\mu_n^{s}},$$ satisfying a familiar functional…

Number Theory · Mathematics 2022-04-22 Bruce C. Berndt , Atul Dixit , Rajat Gupta , Alexandru Zaharescu

This is a conitunation of [1] and [2]. We prove that if function $f$ belongs to the class $\Lambda_{\omega} \overset{\text{def}}{=} \{f: \omega_{f}(\delta)\leq \text{const} \omega(\delta)\} $ for an arbitrary modulus of continuity $\omega$,…

Functional Analysis · Mathematics 2016-05-18 Qinbo Liu

In this paper we consider a sufficiently broad class of nonlinear mathematical programs with disjunctive constraints, which, e.g., include mathematical programs with complemetarity/vanishing constraints. We present an extension of the…

Optimization and Control · Mathematics 2016-11-28 Matúš Benko , Helmut Gfrerer

Let T be an algebraically bounded theory. We consider the $L(\bar\delta)$-expansions of T by a tuple $\bar \delta$ of derivations (which may be commuting or not). We investigate the model completion of either of the above theories, whose…

Logic · Mathematics 2026-05-26 Fornasiero Antongiulio , Terzo Giuseppina

In this paper, a simple proof of the divergence theorem is given by using the Dirac operator and noncommutative residues. Then we extend the divergence theorem to compact manifolds with boundary by the noncommutative residue of the…

Mathematical Physics · Physics 2025-06-24 Jian Wang , Yong Wang

This paper explores goal-directed proof search in first-order multi-modal logic. The key issue is to design a proof system that respects the modularity and locality of assumptions of many modal logics. By forcing ambiguities to be…

Logic in Computer Science · Computer Science 2007-05-23 Matthew Stone

In two earlier papers we derived congruence formats with regard to transition system specifications for weak semantics on the basis of a decomposition method for modal formulas. The idea is that a congruence format for a semantics must…

Logic in Computer Science · Computer Science 2019-08-20 Wan Fokkink , Rob van Glabbeek , Bas Luttik

We study certain arithmetic properties of an analogue $B(n)$ of Lin's restricted partition function that counts the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ and $\pi_2$ comprise distinct odd parts and…

Number Theory · Mathematics 2026-04-10 Russelle Guadalupe

The stable model (SM) semantics lacks the properties of existence, relevance and cumulativity. If we prospectively consider the class of conservative extensions of SM semantics (i.e., semantics that for each normal logic program P retrieve…

Artificial Intelligence · Computer Science 2014-05-16 Mário Abrantes , Luís Moniz Pereira

Utilizing spectral residues of parameterized, recursively defined sequences, we develop a general method for generating identities of composition sums. Specific results are obtained by focusing on coefficient sequences of solutions of first…

Combinatorics · Mathematics 2007-05-23 Robert Milson