Abstract-- The concept of an M-approximative system is introduced. Basic properties of the category of M-approximative systems and in a natural way defined morphisms between them a...
Modal logic represents knowledge that agents have about other agents' knowledge. Probabilistic modal logic further captures probabilistic beliefs about probabilistic beliefs....
cal Abstract Algebraic Logic: Leibniz Equality and Homomorphism Theorems George Voutsadakis Received: 24 May 2006 / Accepted: 28 August 2006 / Published online: 25 October 2006
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...