English
Related papers

Related papers: Disjunction and existence properties in modal arit…

200 papers

Some properties of $m$-density points and density-degree functions are studied. Moreover the following main results are provided: \vskip2mm \begin{itemize} \item {\it Let $\lambda$ be a continuous differential form of degree $h$ in…

Functional Analysis · Mathematics 2024-07-18 Silvano Delladio

We survey the complexity class $\exists \mathbb{R}$, which captures the complexity of deciding the existential theory of the reals. The class $\exists \mathbb{R}$ has roots in two different traditions, one based on the Blum-Shub-Smale model…

Computational Complexity · Computer Science 2024-07-26 Marcus Schaefer , Jean Cardinal , Tillmann Miltzow

In this paper, we study the alternating Euler $T$-sums and $\S$-sums, which are infinite series involving (alternating) odd harmonic numbers, and have similar forms and close relations to the Dirichlet beta functions. By using the method of…

Number Theory · Mathematics 2022-04-13 Ce Xu , Weiping Wang

We present natural deduction systems and associated modal lambda calculi for the necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in the dual-context style: they feature two distinct zones of…

Logic in Computer Science · Computer Science 2023-06-22 G. A. Kavvos

We define a family of three related reducibilities, $\leq_T$, $\leq_{tt}$ and $\leq_m$, for arbitrary functions $f,g:X\rightarrow\mathbb R$, where $X$ is a compact separable metric space. The $\equiv_T$-equivalence classes mostly coincide…

Logic · Mathematics 2019-06-19 Adam R. Day , Rod Downey , Linda Brown Westrick

Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…

Commutative Algebra · Mathematics 2017-11-06 Rameez Raja

Alternating sign matrices are known to be equinumerous with descending plane partitions, totally symmetric self-complementary plane partitions and alternating sign triangles, but no bijective proof for any of these equivalences has been…

Combinatorics · Mathematics 2019-10-11 Ilse Fischer , Matjaz Konvalinka

We study existence, uniqueness and computability of solutions for a class of discrete time recursive utilities models. By combining two streams of the recent literature on recursive preferences---one that analyzes principal eigenvalues of…

Economics · Quantitative Finance 2019-04-24 Jaroslav Borovicka , John Stachurski

We prove that there exists essentially one {\it minimal} differential algebra of distributions $\A$, satisfying all the properties stated in the Schwartz impossibility result [L. Schwartz, Sur l'impossibilit\'e de la multiplication des…

Functional Analysis · Mathematics 2024-05-20 Nuno Costa Dias , Cristina Jorge , Joao Nuno Prata

In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…

Logic · Mathematics 2015-06-09 Ioannis Souldatos

Let $\Sigma$ be a finite regular cell complex with $\emptyset \in \Sigma$, and regard it as a partially ordered set (poset) by inclusion. Let $R$ be the incidence algebra of the poset $\Sigma$ over a field $k$. Corresponding to the Verdier…

Rings and Algebras · Mathematics 2007-05-23 Kohji Yanagawa

The formal system $\lambda\delta$ is a typed lambda calculus derived from $\Lambda_\infty$, aiming to support the foundations of Mathematics that require an underlying theory of expressions (for example the Minimal Type Theory). The system…

Logic in Computer Science · Computer Science 2019-12-02 Ferruccio Guidi

We study the expressive power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulation, for some finite k, are definable in modal logic extended…

Logic in Computer Science · Computer Science 2014-06-25 Lauri Hella , Kerkko Luosto , Katsuhiko Sano , Jonni Virtema

We exhibit an isomorphism of associative algebras between the $\operatorname{Ext}$-algebra $\operatorname{Ext}_\Lambda^\ast(\Delta,\Delta)$ of standard modules over the dual extension algebra $\Lambda$ of two directed algebras $B$ and $A$…

Representation Theory · Mathematics 2021-11-30 Markus Thuresson

We investigate the expressive power of quantifier alternation hierarchy of first-order logic over words. This hierarchy includes the classes ${\Sigma}_i$ (sentences having at most $i$ blocks of quantifiers starting with an $\exists$) and…

Formal Languages and Automata Theory · Computer Science 2015-12-01 Théo Pierron , Thomas Place , Marc Zeitoun

We show that in a weak globular $\omega$-category, all composition operations are equivalent and commutative for cells with sufficiently degenerate boundary, which can be considered a higher-dimensional generalisation of the Eckmann-Hilton…

Category Theory · Mathematics 2025-12-22 Thibaut Benjamin , Ioannis Markakis , Wilfred Offord , Chiara Sarti , Jamie Vicary

We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. In a previous…

Logic in Computer Science · Computer Science 2016-08-16 Frédéric Blanqui

An \textit{ideal} of $N$-tuples of operators is a class invariant with respect to unitary equivalence which contains direct sums of arbitrary collections of its members as well as their (reduced) parts. New decomposition theorems (with…

Operator Algebras · Mathematics 2014-11-03 Piotr Niemiec

We continue the project of the study of reverse mathematics principles inspired by cardinal invariants. In this article in particular we focus on principles encapsulating the existence of large families of objects that are in some sense…

Logic · Mathematics 2026-02-04 David Belanger , Chi Tat Chong , Rupert Hölzl , Frank Stephan

Applicative bisimulation is a coinductive technique to check program equivalence in higher-order functional languages. It is known to be sound, and sometimes complete, with respect to context equivalence. In this paper we show that…

Logic in Computer Science · Computer Science 2015-06-23 Ugo Dal Lago , Alessandro Rioli
‹ Prev 1 3 4 5 6 7 10 Next ›