In this paper we extend modal dependence logic MDL by allowing dependence atoms of the form dep(φ1, . . . , φn) where φi, 1 ≤ i ≤ n, are modal formulas (in MDL, only propositional variables are… (More)

The famous van Benthem theorem states that modal logic corresponds exactly to the fragment of first-order logic that is invariant under bisimulation. In this article we prove an exact analogue of… (More)

Soot particulate collected from a Euro III heavy duty diesel engine run under black smoke conditions was investigated using thermogravimetry, transmission electron microscopy, electron energy loss… (More)

This paper introduces modal independence logic MIL, a modal logic that can explicitly talk about independence among propositional variables. Formulas of MIL are not evaluated in worlds but in sets of… (More)

The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized… (More)

In this paper we investigate an extended version of modal dependence logic by allowing arbitrary Boolean connectives. Modal dependence logic was recently introduced by Jouko Väänänen by extending… (More)

Mathematical logic and computational complexity have close connections that can be traced to the roots of computability theory and the classical decision problem. In the context of complexity, some… (More)

Carbon nanofibers were obtained by thermo-catalytic decomposition of methane at 700 degrees C over Ni and Ni-Cu catalysts prepared by different methods (co-precipitation, impregnation and fusion) and… (More)