Related papers: Monadic Second-Order Logic and Bisimulation Invari…
Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation, respectively. It is proved that a first-order formula is equivalent to a standard translation of an intuitionistic…
We investigate equivariant analogues of the Minkowski--Weyl theorem and Gordan's lemma in an infinite-dimensional setting, where cones and monoids are invariant under the action of the infinite symmetric group. Building upon the framework…
We revisit the duality between Kripke and algebraic semantics of intuitionistic and intuitionistic modal logic. We find that there is a certain mismatch between the two semantics, which means that not all algebraic models can be embedded…
We introduce a complete set of combinatorial data that encode the category $2\mathfrak{Cob}$ of all $2$-cobordisms. As an application, we show that the local monoids of $2\mathfrak{Cob}$ do not have finitely axiomatizable equational…
Coalgebras for analytic functors uniformly model graph-like systems where the successors of a state may admit certain symmetries. Examples of successor structure include ordered tuples, cyclic lists and multisets. Motivated by goals in…
An algebraic theory, sometimes called an equational theory, is a theory defined by finitary operations and equations, such as the theories of groups and of rings. It is well known that algebraic theories are equivalent to finitary monads on…
The continuous modal mu-calculus is a fragment of the modal mu-calculus, where the application of fixpoint operators is restricted to formulas whose functional interpretation is Scott-continuous, rather than merely monotone. By…
This paper contains a study of multivariate second order stochastic mappings indexed by an abstract set $\Lambda$ in close connection to their operator covariance functions. The characterizations of the normal Hilbert module or of Hilbert…
We extend the two-variable logic on data words with guarded regular binary predicates of the form $\widetilde{L}(x,y)$ that is true if positions $x$ and $y$ are in the same class and the factor strictly between $x$ and $y$ is in the regular…
We propose a modal study of the notion of bisimulation. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are…
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the…
Pebble games are a powerful tool in the study of finite model theory, constraint satisfaction and database theory. Monads and comonads are basic notions of category theory which are widely used in semantics of computation and in modern…
In this paper we show how the theory of monads can be used to deduce in a uniform manner several duality theorems involving categories of relations on one side and categories of algebras with homomorphisms preserving only some operations on…
We introduce a family of modal expansions of {\L}ukasiewicz logic that are designed to accommodate modal translations of generalized basic logic (as formulated with exchange, weakening, and falsum). We further exhibit algebraic semantics…
If we replace first order logic by second order logic in the original definition of G\"odel's inner model $L$, we obtain HOD. In this paper we consider inner models that arise if we replace first order logic by a logic that has some, but…
In this paper we continue the study of the variety $\mathbb{MG}$ of monadic G\"odel algebras. These algebras are the equivalent algebraic semantics of the S5-modal expansion of G\"odel logic, which is equivalent to the one-variable monadic…
From the bicovariant first order differential calculus on inhomogeneous Hopf algebra ${\cal B}$ we construct the set of right-invariant Maurer-Cartan one-forms considered as a right-invariant basis of a bicovariant ${\cal B}$-bimodule over…
We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is…
This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal mu-calculus, three main…
The paper explores properties of the {\L}ukasiewicz {\mu}-calculus, or {\L}{\mu} for short, an extension of {\L}ukasiewicz logic with scalar multiplication and least and greatest fixed-point operators (for monotone formulas). We observe…