Related papers: Dynamic Cantor Derivative Logic
Whereas the semantics of probabilistic languages has been extensively studied, specification languages for their properties have received less attention -- with the notable exception of recent and on-going efforts by Joost-Pieter Katoen and…
For polynomials, local connectivity of Julia sets is a much-studied and important property. Indeed, when the Julia set of a polynomial of degree $d\geq 2$ is locally connected, the topological dynamics can be completely described as a…
We develop the theory of Hopf bimodules for a finite rigid tensor category C. Then we use this theory to define a distinguished invertible object D of C and an isomorphism of tensor functors ?^{**} and D tensor ^{**}? tensor D^{-1}. This…
Modal logics have proved useful for many reasoning tasks in symbolic artificial intelligence (AI), such as belief revision, spatial reasoning, among others. On the other hand, mathematical morphology (MM) is a theory for non-linear analysis…
A functional calculus for an order complete vector lattice $\mathcal{E}$ was developed by Grobler in 2014 using the Daniell integral. We show that if one represents the universal completion of $\mathcal{E}$ as $C^\infty(K)$, then the…
In an article dating back in 1992, Kosta Do\v{s}en initiated a project of modal translations in substructural logics, aiming at generalizing the well-known G\"{o}del-McKinsey-Tarski translation of intuitionistic logic into {\bf S4}.…
We first study probabilistic dynamical systems from logical perspective. To this purpose, we introduce the finitary dynamic probability logic} ($\mathsf{DPL}$), as well as its infinitary extension $\mathsf{DPL}_{\omega_1}\!$. Both these…
This work presents three increasingly expressive Dynamic Logics in which the programs are CCS processes (sCCS-PDL, CCS-PDL and XCCS-PDL). Their goal is to reason about properties of concurrent programs and systems described using CCS. In…
We present a categorical formalism for context-free languages with morphisms given by correspondences obtained from rational transductions. We show that D0L-systems are a special case of the correspondences that define morphisms in this…
This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…
Justification logic is a term used to identify a relatively new family of modal-like logics. There is an established literature about propositional justification logic, but incursions on the first-order case are scarce. In this paper we…
We consider the G\"odel bi-modal logic determined by fuzzy Kripke models where both the propositions and the accessibility relation are infinitely valued over the standard G\"odel algebra [0,1] and prove strong completeness of Fischer Servi…
A variety of problems emerged investigating electronic circuits, computer devices and cellular automata motivated a number of attempts to create a differential and integral calculus for Boolean functions. In the present article, we extend…
We develop the general theory of \emph{topometric spaces}, i.e., topological spaces equipped with a well-behaved lower semi-continuous metric function. Spaces of global and local types in continuous logic are the motivating examples for the…
We develop topological dynamics for the group of automorphisms of a monster model of any given theory. In particular, we find strong relationships between objects from topological dynamics (such as the generalized Bohr compactification…
We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…
Let $K$ be an algebraically closed field of characteristic zero and let $G$ be a finitely generated subgroup of the multiplicative group of $K$. We consider $K$-valued sequences of the form $a_n:=f(\varphi^n(x_0))$, where $\varphi\colon…
In this paper we demonstrate decidability for the intuitionistic modal logic S4 first formulated by Fischer Servi. This solves a problem that has been open for almost thirty years since it had been posed in Simpson's PhD thesis in 1994. We…
We devise a generic recipe for constructing $D$-dimensional lattice models whose $d$-dimensional boundary states, located on surfaces, hinges, corners, and so forth, can be obtained exactly. The solvability is rooted in the underlying…
The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…