English
Related papers

Related papers: Monadic Second-Order Logic and Bisimulation Invari…

200 papers

Recent works have shown that defining a behavioural equivalence that matches the observational properties of a quantum-capable, concurrent, non-deterministic system is a surprisingly difficult task. We explore coalgebras over distributions…

Logic in Computer Science · Computer Science 2025-09-26 Lorenzo Ceragioli , Elena Di Lavore , Giuseppe Lomurno , Gabriele Tedeschi

Algebra and representation theory in modular tensor categories can be combined with tools from topological field theory to obtain a deeper understanding of rational conformal field theories in two dimensions: It allows us to establish the…

Category Theory · Mathematics 2008-11-26 Jürg Fröhlich , Jürgen Fuchs , Ingo Runkel , Christoph Schweigert

New Orlicz Brunn-Minkowski inequalities are established for rigid motion compatible Minkowski valuations of arbitrary degree. These extend classical log-concavity properties of intrinsic volumes and generalize seminal results of Lutwak and…

Metric Geometry · Mathematics 2014-12-01 Astrid Berg , Lukas Parapatits , Franz E. Schuster , Manuel Weberndorfer

The Minkowski question mark function is a rich object which can be explored from the perspective of dynamical systems, complex dynamics, metric number theory, multifractal analysis, transfer operators, integral transforms, and as a function…

Number Theory · Mathematics 2015-07-03 Giedrius Alkauskas

We develop the theory of relative monads and relative adjunctions in a virtual equipment, extending the theory of monads and adjunctions in a 2-category. The theory of relative comonads and relative coadjunctions follows by duality. While…

Category Theory · Mathematics 2025-10-21 Nathanael Arkor , Dylan McDermott

This paper is focused on the study of modal logics defined from valued Kripke frames, and particularly, on computability and expressibility questions of modal logics of transitive Kripke frames evaluated over certain residuated lattices. It…

Logic in Computer Science · Computer Science 2019-04-03 Amanda Vidal

Nakano's "later" modality, inspired by G\"{o}del-L\"{o}b provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of…

Logic in Computer Science · Computer Science 2015-04-20 Ranald Clouston , Rajeev Goré

We demonstrate and develop dyadic-probabilistic methods in connection with non-homogeneous bilinear operators, namely singular integrals and square functions. We develop the full non-homogeneous theory of bilinear singular integrals using a…

Classical Analysis and ODEs · Mathematics 2018-10-19 Henri Martikainen , Emil Vuorinen

A kind of motivic stable homotopy theory of algebras is developed. Explicit fibrant replacements for the $S^1$-spectrum and $(S^1,\mathbb G)$-bispectrum of an algebra are constructed. As an application, unstable, Morita stable and stable…

K-Theory and Homology · Mathematics 2016-08-03 Grigory Garkusha

The paper considers algorithmic properties of classical and non-classical first-order logics and theories in bounded languages. The main idea is to prove the undecidability of various fragments of classical and non-classical first-order…

Logic · Mathematics 2025-05-02 Mikhail Rybakov

We introduce a monotone modal analogue of the intuitionistic (normal) modal logic IK using a translation into a suitable (intuitionistic) first-order logic. We axiomatise the logic and give a semantics by means of intuitionistic…

Logic · Mathematics 2025-07-21 Jim de Groot

We present a coalgebraic framework for studying generalisations of dynamic modal logics such as PDL and game logic in which both the propositions and the semantic structures can take values in an algebra $\mathbf{A}$ of truth-degrees. More…

Logic in Computer Science · Computer Science 2025-12-30 Helle Hvid Hansen , Wolfgang Poiger

We introduce FIK, a natural intuitionistic modal logic specified by Kripke models satisfying the condition of forward confluence. We give a complete Hilbert-style axiomatization of this logic and propose a bi-nested calculus for it. The…

Logic in Computer Science · Computer Science 2023-09-13 Philippe Balbiani , Han Gao , Çiğdem Gencer , Nicola Olivetti

The paper investigates algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames or classes of finite Kripke frames. Precise complexity bounds for monadic logics of classes of Kripke frames with…

Logic · Mathematics 2023-06-26 I. Agadzhanian , M. Rybakov , D. Shkatov

We show that the definition of a second order superintegrable system on a (pseudo-)Riemannian manifold gives rise to a conformally invariant notion of superintegrability. Conformal equivalence is the natural extension of the well-known…

Differential Geometry · Mathematics 2025-05-09 Jonathan Kress , Konrad Schöbel , Andreas Vollmer

We introduce k-quantifier logics -- logics with access to k-tuples of elements and very general quantification patterns for transitions between k-tuples. The framework is very expressive and encompasses e.g. the k-variable fragments of…

Logic · Mathematics 2026-02-03 Janek Härtter , Martin Otto

We reconcile the two different category-theoretic semantics of regular theories in predicate logic. A 2-category of `regular fibrations' is constructed, as well as a 2-category of `regular proarrow equipments', and it is shown that the two…

Category Theory · Mathematics 2015-03-02 Finn Lawler

We construct an ontological model for the theory known as bilocal classical theory doi.org/10.1103/PhysRevA.102.052216. To our knowledge, this is only the second time that an ontological model has been constructed for an entire theory,…

Quantum Physics · Physics 2025-11-25 Sina Soltani , Marco Erba , David Schmid , John H. Selby

While behavioural equivalences among systems of the same type, such as Park/Milner bisimilarity of labelled transition systems, are an established notion, a systematic treatment of relationships between systems of different type is…

Logic in Computer Science · Computer Science 2025-02-07 Pedro Nora , Jurriaan Rot , Lutz Schröder , Paul Wild

The notion of orbit finite data monoid was recently introduced by Bojanczyk as an algebraic object for defining recognizable languages of data words. Following Buchi's approach, we introduce a variant of monadic second-order logic with data…

Formal Languages and Automata Theory · Computer Science 2017-01-11 Gabriele Puppis , Thomas Colcombet , Clemens Ley