English
Related papers

Related papers: The Arity Hierarchy in the Polyadic $\mu$-Calculus

200 papers

Bicritical rational functions -- those with precisely two critical points -- include the well-studied families of unicritical polynomials and quadratic rational functions. In this article we lay out general foundations for studying…

Number Theory · Mathematics 2026-01-29 Vefa Goksel , Rafe Jones

We recall the definition of the quadratic helicity invariant and of the higher asymptotic ergodic $M$-invariant. We present a simpler new proof (in part) that the $M$-invariant is ergodic. The $M$-invariant is a higher invariant, this means…

Geometric Topology · Mathematics 2015-03-31 Petr M. Akhmetiev

We show that for finite n at least 3, every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras, polyadic algebras, and polyadic equality algebras contains an…

Logic · Mathematics 2013-05-22 Jannis Bulian , Ian Hodkinson

We extend intersection types to a computational $\lambda$-calculus with algebraic operations \`a la Plotkin and Power. We achieve this by considering monadic intersections, whereby computational effects appear not only in the operational…

Programming Languages · Computer Science 2024-01-24 Francesco Gavazzo , Riccardo Treglia , Gabriele Vanoni

Linear logic provides a framework to control the complexity of higher-order functional programs. We present an extension of this framework to programs with multithreading and side effects focusing on the case of elementary time. Our main…

Programming Languages · Computer Science 2011-06-13 Antoine Madet , Roberto M. Amadio

After a review of the concept of "monad with arities" we show that the category of algebras for such a monad has a canonical dense generator. This is used to extend the correspondence between finitary monads on sets and Lawvere's algebraic…

Category Theory · Mathematics 2016-04-04 Clemens Berger , Paul-André Melliès , Mark Weber

We study a variant of the modal $\mu$-calculus based on the constructive modal logic $\mathsf{CK}$. We define game semantics for the constructive $\mu$-calculus and prove its equivalence to the birelational Kripke semantics. We then use the…

Logic in Computer Science · Computer Science 2026-04-28 Leonardo Pacheco

We study multimodal logics over universally first-order definable classes of frames. We show that even for bimodal logics, there are universal Horn formulas that define set of frames such that the satisfiability problem is undecidable, even…

Logic in Computer Science · Computer Science 2018-09-11 Jakub Michaliszyn

Logical formalisms for reasoning about relations between spatial regions play a fundamental role in geographical information systems, spatial and constraint databases, and spatial reasoning in AI. In analogy with Halpern and Shoham's modal…

Logic in Computer Science · Computer Science 2017-01-11 Carsten Lutz , Frank Wolter

"Clarithmetic" is a generic name for formal number theories similar to Peano arithmetic, but based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html) instead of the more traditional classical or intuitionistic logics.…

Logic in Computer Science · Computer Science 2011-08-24 Giorgi Japaridze

We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a type system that uses intersection and product types. The presence of the latter and a restricted use of the type omega enable us to…

Logic in Computer Science · Computer Science 2013-08-01 Steffen van Bakel , Franco Barbanera , Ugo de'Liguoro

In this paper, we investigate the many-valued version of coalgebraic modal logic through predicate lifting approach. Coalgebras, understood as generic transition systems, can serve as semantic structures for various kinds of modal logics. A…

Logic in Computer Science · Computer Science 2022-06-16 Chun-Yu Lin , Churn-Jung Liau

We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…

Logic in Computer Science · Computer Science 2019-02-12 Sergey Slavnov

This paper presents the Pi-graphs, a visual paradigm for the modelling and verification of mobile systems. The language is a graphical variant of the Pi-calculus with iterators to express non-terminating behaviors. The operational semantics…

Formal Languages and Automata Theory · Computer Science 2010-11-02 Frédéric Peschanski , Hanna Klaudel , Raymond Devillers

Probabilistic argumentation is an alternative to causal modeling with Bayesian networks. Probabilistic argumentation structures (PAS) are defined on families of compatible frames (f.c.f). This is a generalization of the usual multivariate…

Information Theory · Computer Science 2018-10-09 Juerg Kohlas

Modal logics for reasoning about the power of coalitions capture the notion of effectivity functions associated with game forms. The main goal of coalition logics is to provide formal tools for modeling the dynamics of a game frame whose…

Logic · Mathematics 2017-03-01 Tomáš Kroupa , Bruno Teheux

There are many examples of dualities between topological spaces and algebras in the literature. Particularly, many of those examples come from the algebraic counterpart of a logical system, e.g, boolean and heyting algebras, MV-algebras,…

Category Theory · Mathematics 2023-11-08 Mayk de Andrade , Hugo Mariano

We prove that the category of Nachbin's compact ordered spaces and order-preserving continuous maps between them is dually equivalent to a variety of algebras, with operations of at most countable arity. Furthermore, we show that the…

Category Theory · Mathematics 2025-01-14 Marco Abbadini

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

We investigate the phenomenon that "every monad is a linear state monad". We do this by studying a fully-complete state-passing translation from an impure call-by-value language to a new linear type theory: the enriched call-by-value…

Programming Languages · Computer Science 2015-07-01 Rasmus Ejlers Møgelberg , Sam Staton