Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras

Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. Similar to well-known results for monadic second-order logic over trees, we provide a translation of this logic into a class of automata, relative to the class of coalgebras that admit a tree-like supporting Kripke frame. We then consider invariance under behavioral equivalence of formulas; more in particular, we investigate whether the coalgebraic mu-calculus is the bisimulation-invariant fragment of monadic second-order logic. Building on recent results by the third author we show that in order to provide such a coalgebraic generalization of the Janin-Walukiewicz Theorem, it suffices to find what we call an adequate uniform construction for the functor. As applications of this result we obtain a partly new proof of the Janin-Walukiewicz Theorem, and bisimulation invariance results for the bag functor (graded modal logic) and all exponential polynomial functors. Finally, we consider in some detail the monotone neighborhood functor, which provides coalgebraic semantics for monotone modal logic. It turns out that there is no adequate uniform construction for this functor, whence the automata-theoretic approach towards bisimulation invariance does not apply directly. This problem can be overcome if we consider global bisimulations between neighborhood models: one of our main technical results provides a characterization of the monotone modal mu-calculus extended with the global modalities, as the fragment of monadic second-order logic for the monotone neighborhood functor that is invariant for global bisimulations

Expressiveness of the modal mu-calculus on monotone neighborhood structures

We characterize the expressive power of the modal mu-calculus on monotone neighborhood structures, in the style of the Janin-Walukiewicz theorem for the standard modal mu-calculus. For this purpose we consider a monadic second-order logic for monotone neighborhood structures. Our main result shows that the monotone modal mu-calculus corresponds exactly to the fragment of this second-order language that is invariant for neighborhood bisimulations

Uniform Interpolation for Coalgebraic Fixpoint Logic

We use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoys uniform interpolation. To this aim, first we generalize one of the central results in coalgebraic automata theory, namely closure under projection, which is known to hold for weak-pullback preserving functors, to a more general class of functors, i.e.; functors with quasi-functorial lax extensions. Then we will show that closure under projection implies definability of the bisimulation quantifier in the language of coalgebraic fixpoint logic, and finally we prove the uniform interpolation theorem

An expressive completeness theorem for coalgebraic modal mu-calculi

Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. We then consider invariance under behavioral equivalence of MSO-formulas. More specifically, we investigate whether the coalgebraic mu-calculus is the bisimulation-invariant fragment of the monadic second-order language for a given functor. Using automatatheoretic techniques and building on recent results by the third author, we show that in order to provide such a characterization result it suffices to find what we call an adequate uniform construction for the coalgebraic type functor. As direct applications of this result we obtain a partly new proof of the Janin-Walukiewicz Theorem for the modal mu-calculus, avoiding the use of syntactic normal forms, and bisimulation invariance results for the bag functor (graded modal logic) and all exponential polynomial functors (including the "game functor"). As a more involved application, involving additional non-trivial ideas, we also derive a characterization theorem for the monotone modal mu-calculus, with respect to a natural monadic second-order language for monotone neighborhood models.Comment: arXiv admin note: substantial text overlap with arXiv:1501.0721

Bio self-healing nanoconcretes

Concrete as the most widely used construction material is susceptible to crack when exposes to stresses. Various types of passive techniques have been introduced to fill the generated cracks, however the majority of them are not permanent, effective, and environmentally friendly. Over recent years, the embedment of an active mechanism called “self-healing mechanism” in concrete has been proposed as an alternative approach to ineffective passive techniques. Among the investigated self-healing mechanisms, bio self-healing approach has drawn considerable attention as it can address the cracking issues by inducing calcium carbonate in a sustainable way. However, the effectiveness of bio self-healing concrete highly depends on the successful protection of bacteria in concrete matrix. So far, various types of micro-scale and recently nano-scale protecting careers have been tested to evaluate the effectiveness of bio self-healing concrete. In this chapter, the latest nanobiotechnological self-healing approaches for protection of bacteria in a harsh concrete pH are discussed

Uniform Interpolation in Coalgebraic Modal Logic

A logic has uniform interpolation if its formulas can be projected down to given subsignatures, preserving all logical consequences that do not mention the removed symbols; the weaker property of (Craig) interpolation allows the projected formula - the interpolant - to be different for each logical consequence of the original formula. These properties are of importance, e.g., in the modularization of logical theories. We study interpolation in the context of coalgebraic modal logics, i.e. modal logics axiomatized in rank 1, restricting for clarity to the case with finitely many modalities. Examples of such logics include the modal logics K and KD, neighbourhood logic and its monotone variant, finite-monoid-weighted logics, and coalition logic. We introduce a notion of one-step (uniform) interpolation, which refers only to a restricted logic without nesting of modalities, and show that a coalgebraic modal logic has uniform interpolation if it has one-step interpolation. Moreover, we identify preservation of finite surjective weak pullbacks as a sufficient, and in the monotone case necessary, condition for one-step interpolation. We thus prove or reprove uniform interpolation for most of the examples listed above

Bioconcrete: next generation of self-healing concrete

Concrete is one of the most widely used construction materials and has a high tendency to form cracks. These cracks lead to significant reduction in concrete service life and high replacement costs. Although it is not possible to prevent crack formation, various types of techniques are in place to heal the cracks. It has been shown that some of the current concrete treatment methods such as the application of chemicals and polymers are a source of health and environmental risks, and more importantly, they are effective only in the short term. Thus, treatment methods that are environmentally friendly and long-lasting are in high demand. A microbial self-healing approach is distinguished by its potential for long-lasting, rapid and active crack repair, while also being environmentally friendly. Furthermore, the microbial self-healing approach prevails the other treatment techniques due to the efficient bonding capacity and compatibility with concrete compositions. This study provides an overview of the microbial approaches to produce calcium carbonate (CaCO₃). Prospective challenges in microbial crack treatment are discussed, and recommendations are also given for areas of future research

Development of an innovative urease-aided self-healing dental composite

Dental restorative materials suffer from major drawbacks, namely fracture and shrinkage, which result in failure and require restoration and replacement. There are different methods to address these issues, such as increasing the filler load or changing the resin matrix of the composite. In the present work, we introduce a new viable process to heal the generated cracks with the aid of urease enzyme. In this system, urease breaks down the salivary urea which later binds with calcium to form calcium carbonate (CaCO₃). The formation of insoluble CaCO₃ fills any resultant fracture or shrinkage from the dental composure hardening step. The healing process and the formation of CaCO₃ within dental composites were successfully confirmed by optical microscope, scanning electron microscopy (SEM), and energy-dispersive X-ray (EDS) methods. This research demonstrates a new protocol to increase the service life of dental restoration composites in the near future