Fuzzy logics are in most cases based on an ad-hoc decision about the interpretation of the conjunction. If they are useful or not can typically be found out only by testing them wi...
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness an...
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
We propose a type system for locating the source of type errors in an applied lambda calculus with ML-style polymorphism. The system is based on discriminative sum types--known fr...