English
Related papers

Related papers: A note on drastic product logic

200 papers

Linear temporal logic (LTL) is a specification language for finite sequences (called traces) widely used in program verification, motion planning in robotics, process mining, and many other areas. We consider the problem of learning LTL…

Artificial Intelligence · Computer Science 2026-01-22 Ritam Raha , Rajarshi Roy , Nathanaël Fijalkow , Daniel Neider

We study a notion of residual finiteness for continuous actions of discrete groups on compact Hausdorff spaces and how it relates to the existence of norm microstates for the reduced crossed product. Our main result asserts that an action…

Operator Algebras · Mathematics 2011-05-31 David Kerr , Piotr W. Nowak

The purpose of the present paper is to lay the foundations for a systematic study of tensor products of operator systems. After giving an axiomatic definition of tensor products in this category, we examine in detail several particular…

Operator Algebras · Mathematics 2011-02-25 Ali S. Kavruk , Vern I. Paulsen , Ivan G. Todorov , Mark Tomforde

In this survey, we present in a unified way the categorical and syntactical settings of coherent differentiation introduced recently, which shows that the basic ideas of differential linear logic and of the differential lambda-calculus are…

Logic in Computer Science · Computer Science 2024-01-29 Thomas Ehrhard

The category of $C^*$-algebras is blessed with many different tensor products. In contrast, virtually the only tensor product ever used in the category of von Neumann algebras is the normal spatial tensor product. We propose a definition of…

Operator Algebras · Mathematics 2015-06-05 Matthew Wiersma

In [Mon11] are studied, for the axiomatic extensions of the monoidal t-norm based logic ([EG01]), the properties of single chain completeness. On the other side, in [GJKO07, Chapter 5] are studied many logical and algebraic properties (like…

Logic · Mathematics 2012-05-22 Matteo Bianchi

Partial rigidity is a quantitative notion of recurrence and provides a global obstruction which prevents the system from being strongly mixing. A dynamical system $(X, \mathcal{X}, \mu, T)$ is partially rigid if there is a constant $\delta…

Dynamical Systems · Mathematics 2024-12-13 Tristán Radić

This paper deals with many-valued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated…

Logic · Mathematics 2009-10-02 Felix Bou , Francesc Esteva , Lluis Godo , Ricardo Rodriguez

We discuss the interplay between K-theoretical dynamics and the structure theory for certain C*-algebras arising from crossed products. For noncommutative C*-systems we present notions of minimality and topological transitivity in the…

Operator Algebras · Mathematics 2015-02-24 Timothy Rainone

Metric Temporal Logic $\mathsf{MTL}[\until_I,\since_I]$ is one of the most studied real time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of…

Logic in Computer Science · Computer Science 2014-04-29 Khushraj Madnani , Shankara Narayanan Krishna , Paritosh Pandya

Recently, arXiv:2312.16035 showed that all logics based on Boolean Normal monotonic three-valued schemes coincide with classical logic when defined using a strict-tolerant standard ($\mathbf{st}$). Conversely, they proved that under a…

Logic · Mathematics 2025-03-31 Quentin Blomet , Bruno Da Ré

A previous article shows that any linear height bounded normal proof of a tautology in the Natural Deduction for Minimal implicational logic $M_{\supset}$ is as huge as it is redundant. More precisely, any proof in a family of…

Computational Complexity · Computer Science 2021-01-26 Edward Hermann Haeusler

Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…

Logic in Computer Science · Computer Science 2022-07-11 Luca Ciccone , Luca Padovani

Let $\Lambda$ be an artin algebra. We are going to consider full subcategories of $\mod\Lambda$ closed under finite direct sums and under submodules with infinitely many isomorphism classes of indecomposable modules. The main result asserts…

Representation Theory · Mathematics 2010-09-07 Claus Michael Ringel

In the propositional modal (and algebraic) treatment of two-variable first-order logic equality is modelled by a `diagonal' constant, interpreted in square products of universal frames as the identity (also known as the `diagonal')…

Logic in Computer Science · Computer Science 2015-12-29 Christopher Hampson , Stanislav Kikot , Agi Kurucz

We study the matricial field (MF) property for certain reduced crossed product C*-algebras and their traces. Using classification techniques and induced K-theoretic dynamics, we show that reduced crossed products of ASH-algebras of real…

Operator Algebras · Mathematics 2016-06-29 Timothy Rainone , Christopher Schafhauser

Let $G$ be a discrete group. Given unital $G$-$C^*$-algebras $\mathcal{A}$ and $\mathcal{B}$, we give an abstract condition under which every $G$-subalgebra $\mathcal{C}$ of the form $\mathcal{A}\subset \mathcal{C}\subset…

Operator Algebras · Mathematics 2025-06-18 Tattwamasi Amrutam , Yongle Jiang

We systematically investigate $C^*$-norms on the algebraic graded product of $\mathbb{Z}_2$-graded $C^*$-algebras. This requires to single out the notion of a compatible norm, that is a norm with respect to which the product grading is…

Operator Algebras · Mathematics 2021-12-09 Vitonofrio Crismale , Stefano Rossi , Paola Zurlo

If ${\cal D}$ is a definable category then it may contain no nonzero finitely presented modules but, by a result of Makkai, there is a $\varinjlim$-generating set of strictly ${\cal D}$-atomic modules. These modules share some key…

Representation Theory · Mathematics 2024-02-09 Mike Prest

Strict-Tolerant Logic (ST) underpins naive theories of truth and vagueness (respectively including a fully disquotational truth predicate and an unrestricted tolerance principle) without jettisoning any classically valid laws. The classical…

Logic · Mathematics 2026-03-02 Francesco Paoli , Adam Přenosil