This paper extends the results of Hermida's thesis about logical predicates to more general logical relations and a wider collection of types. The extension of type constructors from types to logical relations is derived from an interpretation of ...

The main objective of this paper is to study some aspects of weak domains. We first show that every meet continuous weak domain is a domain. Then we prove that a dcpo P is exact iff the weakly way-below relation is the smallest approximating w-...

In this paper, the uniform topological spaces are established based on the congruences induced by BF-ideals and some of their properties are discussed in negative non-involutive residuated lattices. The following conclusions are proved: (i) every ...

In this paper we deal with systems of sets on the category of all semilattices. Based on the result of Z–frame freely generated by Z–sites studied in [D. Zhao, “Generalization of Frames and Continuous Lattices,” Ph.D. thesis, Cambridge University, ...

It is well-known that topological spaces can be axiomatically defined by the topological closure operator, i.e., Kuratowski Closure Axioms. Equivalently, they can be axiomatized by other set operators reflecting primitive notions of topology, such ...

We investigate the Eilenberg-Moore algebras of the extended probabilistic powerdomain monad Vw over the category TOP₀ of T0 topological spaces and continuous maps. We prove that every Vw-algebra in our setting is a weakly locally convex sober ...

We investigate the distinguishability of sets of relational structures concerning a class of structures in the following sense: for a fixed class of structures, given two sets of structures in this class, find a first-order formula of minimal ...

We introduce a generalization of Nelson algebras having a not-necessarily involutive negation; we suggest to dub this class quasi-Nelson algebras in analogy with quasi-De Morgan lattices, these being a non-involutive generalization of De Morgan ...

Multi-agent Dynamic Epistemic Logic, as a suitable modal logic to reason about knowledge evolving systems, has emerged in a number of contexts and scenarios. The agents knowledge in this logic is simply characterised by valuations of propositions. ...

In the present paper, we endow the logics of topological quasi Boolean algebras, topological quasi Boolean algebras 5, intermediate algebras of types 1-3, and pre-rough algebras with proper multi-type display calculi which are sound, complete, ...

This work proposes a Dynamic Epistemic Logic with Communication Actions that can be performed concurrently. Unlike Concurrent Epistemic Action Logic introduced by Ditmarsch, Hoek and Kooi [van Ditmarsch, H., W. van der Hoek and B. Kooi, “...

Abstract Dialectical Frameworks (adfs) are generalizations of Dung's abstract argumentation frameworks (afs) where each argument has an associated acceptance condition expressed by a boolean formula. The resulting extension is robust enough not ...

Problem partitioning strategies such as sequential covering are commonly used in rule learning algorithms, such that the task of finding a complete rule base is reduced to a sequence of subproblems. In this scenario, each solution to a subproblem ...

We define a new logic programming semantics in terms of abducible atoms. We use it to characterize the stage extensions of an argumentation framework AF by means of an associated normal program PAF. We also define the stage semantics for a special type ...

Quantum processes provide a parallel model for fuzzy connectives. Calculations of quantum states may be simultaneously performed by the superposition of membership and non-membership degrees of each element regarding the intuitionistic fuzzy sets. This ...

This paper studies the robustness of intuitionistic fuzzy implications in fuzzy reasoning based on Atanassov's intuitionistic fuzzy logic. Starting with an evaluation of the sensitivity in representable fuzzy negations, we apply the results in the Yager'...

We study a model of side-effecting processes obtained by starting from a monad modelling base effects and adjoining free operations using a cofree coalgebra construction; one thus arrives at what one may think of as types of non-wellfounded side-...

We show that logic C1 cannot be extended to a paraconsistent logic in which the substitution theorem is valid. We show that C1 can be extended to larger paraconsistent logics by adding some desirable properties as axioms. We use three-valued logics to ...

We present a parallel implementation of Coalgebraic Logic Programming (CoALP) in the programming language Go. CoALP was initially introduced to reflect coalgebraic semantics of logic programming, with coalgebraic derivation algorithm featuring both ...

We propose a new method for modelling users' preferences on attributes that contain more than one trait. Starting with a data set the users have to enter a sort of order on the attributes in form of formulas corresponding to their preferences. Based on ...