Spinks and Veroff have shown that constructive logic with strong negation (CLSN for short), can be considered as a substructural logic. We use algebraic tools developed to study substructural ... (Read More)

In previous investigations into the subject [Giuntini et al. (2007, Studia Logica, 87, 99–128), Paoli et al. (2008, Reports on Mathematical Logic, 44, ... (Read More)

We address the question, which MV-algebras have finite automorphism group. We prove that finitely presented MV-algebras whose maximal spectral space has topological dimension not exceeding 1 ... (Read More)

This article develops a comprehensive study of various types of interpolation properties and Beth definability properties (BDPs) for substructural logics, and their algebraic characterizations ... (Read More)

The aim of this article is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all -theories (equational extensions of untyped -calculus) ... (Read More)

The central topic of this work is the categories of modules over unital quantales. The main categorical properties are established and a special class of operators, called Q-module transforms, ... (Read More)

This article provides sound and complete logical systems for several fragments of English which go beyond syllogistic logic in that they use verbs as well as other limited syntactic material: ... (Read More)

We exhibit a non-finitary sentential logic that is algebraized by a quasivariety—in fact by a finitely based variety of finite type. The algebraization process requires infinitely many ... (Read More)

In this article, solutions to three open problems on ordered commutative monoids posed in Evans et al. (2001, Semigroup forum, 62, 249-278) [4] are presented. By an ordered ... (Read More)

When monitoring a system w.r.t. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is, models of ... (Read More)

In Barringer et al. (2004,Vol. 2937, LNCS), Eagle was introduced as a general purpose rule-based temporal logic for specifying run-time monitors. A novel interpretative trace-checking ... (Read More)

Perfect pre-deployment test coverage is notoriously difficult to achieve for large applications. Given enough end users, however, many more test cases will be encountered during an ... (Read More)

Complex distributed systems pose great challenges for quality assurance. Size, complexity and concurrency of these systems often render traditional verification techniques impractical. In ... (Read More)

We extend our previous approach to run-time verification of a single finite path against a formula in next-free Linear-Time Logic (LTL) with free variables and quantification. We ... (Read More)

Avariant of Lukasiewicz logic defined in a remark in White's 1979 paper on the consistency of the axiom of comprehension in the infinite-valued predicate logic of Lukasiewicz is studied; it is ... (Read More)

All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiable sentences. ... (Read More)

We investigate admissible rules of Lukasiewicz multi-valued propositional logic. We show that admissibility of multiple-conclusion rules in Lukasiewicz logic, as well as validity of universal ... (Read More)

In this article, we provide an inductive proof system for a notion of abstract non-interference (ANI) which fits in every field of computer science where we are interested in observing how ... (Read More)