English
Related papers

Related papers: Disjunction and existence properties in modal arit…

200 papers

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…

Logic in Computer Science · Computer Science 2010-04-13 Kai Brünnler

Let $B$ be a bounded self-adjoint operator and let $A$ be a nonnegative self-adjoint unbounded operator. It is shown that if $BA$ is normal, it must be self-adjoint and so must be $AB$. Commutativity is necessary and sufficient for this…

Functional Analysis · Mathematics 2015-09-11 K. Gustafson , M. H. Mortad

We find first structural background information about the reasons that for any C*-algebra $A$ and any two Hilbert $A$-modules $M \subseteq N$ with $M^\perp=\{0\}$, every bounded $A$-linear map $N \to A$ (or $N \to N)$ vanishing on $M$ might…

Operator Algebras · Mathematics 2026-04-09 Michael Frank , Cristian Ivanescu

We define a congruence module $\Psi_A(M)$ associated to a surjective $\mathcal O$-algebra morphism $\lambda\colon A \to \mathcal{O}$, with $\mathcal{O}$ a discrete valuation ring, $A$ a complete noetherian local $\mathcal{O}$-algebra…

Number Theory · Mathematics 2024-11-26 Srikanth B. Iyengar , Chandrashekhar B. Khare , Jeffrey Manning

This thesis deals with the specification and construction of syntax and operational semantics of a programming language. We work with a general notion of signature for specifying objects of a given category as initial objects in a suitable…

Logic in Computer Science · Computer Science 2019-12-19 Ambroise Lafont

Bisimulation equivalence (or bisimilarity) of first-order grammars is decidable, as follows from the decidability result by Senizergues (1998, 2005) that has been given in an equivalent framework of equational graphs with finite out-degree,…

Logic in Computer Science · Computer Science 2013-12-16 Petr Jancar

In this paper, we examine the locality condition for non-splitting and determine the level of uniqueness of limit models that can be recovered in some stable, but not superstable, abstract elementary classes. In particular we prove (note…

Logic · Mathematics 2024-09-12 Will Boney , Monica M. VanDieren

We introduce the notion of $\Delta$ and $\sigma\,\Delta-$ pairs for operator algebras and characterise $\Delta-$ pairs through their categories of left operator modules over these algebras. Furthermore, we introduce the notion of…

Operator Algebras · Mathematics 2020-09-24 G. K. Eleftherakis , E. Papapetros

We study the structure of bounded linear functionals on a class of non-self-adjoint operator algebras that includes the multiplier algebra of every complete Nevanlinna-Pick space, and in particular the multiplier algebra of the…

Operator Algebras · Mathematics 2016-01-20 Matthew Kennedy , Dilian Yang

We study the validity of congruence inclusions of the form $ \alpha ( \beta \circ \alpha \gamma \circ \beta \circ \dotsc \circ \alpha \gamma \circ \beta ) \subseteq \alpha \beta \circ \alpha \gamma \circ \alpha \beta \circ \dots$ in…

Rings and Algebras · Mathematics 2020-04-14 Paolo Lipparini

A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i \alpha_i$ with no two $\alpha_i$ sharing an atom then one of…

Computational Complexity · Computer Science 2026-04-14 Jan Krajicek

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…

Dynamical Systems · Mathematics 2018-11-19 Fabien Durand , Valérie Goyheneche

Let M(q)=\sum c(n) q^n be one of Ramanujan's mock theta functions. We establish the existence of infinitely many linear congruences of the form c(An+B) \equiv 0 (mod \ell^j), where A is a multiple of \ell and an auxiliary prime p. Moreover,…

Number Theory · Mathematics 2014-03-07 Nickolas Andersen , Holley Friedlander , Jeremy Fuller , Heidi Goodson

We prove two results intended to streamline proofs about cellularity that pass through mutual algebraicity. First, we show that a countable structure $M$ is cellular if and only if $M$ is $\omega$-categorical and mutually algebraic. Second,…

Logic · Mathematics 2022-08-11 Samuel Braunfeld , Michael C. Laskowski

Persistence modules are representations of products of totally ordered sets in the category of vector spaces. They appear naturally in the representation theory of algebras, but in recent years they have also found applications in other…

Algebraic Topology · Mathematics 2024-11-04 Steve Oudot

Motivated by advances in categorical probability, we introduce non-commutative almost everywhere (a.e.) equivalence and disintegrations in the setting of C*-algebras. We show that C*-algebras (resp. W*-algebras) and a.e. equivalence classes…

Quantum Physics · Physics 2023-12-18 Arthur J. Parzygnat , Benjamin P. Russo

Let $(a_n), (b_n)$ be linear recursive sequences of integers with characteristic polynomials $A(X),B(X)\in \mathbb{Z}[X]$ respectively. Assume that $A(X)$ has a dominating and simple real root $\alpha$, while $B(X)$ has a pair of conjugate…

Number Theory · Mathematics 2021-11-23 Attila Pethő

Judgment aggregation studies how to combine individual judgments on logically related propositions into a collective judgment. Classical impossibility results show that sufficiently strong logical interconnections force dictatorship under…

Logic in Computer Science · Computer Science 2026-05-25 Yutaka Nagai , Hirotaka Ono

Let $A$ be a unital separable \CA and $B=C\otimes {\cal K},$ where $C$ is a unital \CA. Let $\tau: A\to M(B)/B$ be a weakly unital full essential extensions of $A$ by $B.$ We show that there is a bijection between a quotient group of…

Operator Algebras · Mathematics 2007-05-23 Huaxin Lin

We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…

Logic in Computer Science · Computer Science 2023-06-22 Dietrich Kuske , Jiamou Liu , Anastasia Moskvina