Bøger af Daniele Mundici

This book constitutes the refereed proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory, KGC '97, held in Vienna, Austria, in August 1997.The volume presents 20 revised full papers selected from 38 submitted papers. Also included are seven invited contributions by leading experts in the area. The book documents interdisciplinary work done in the area of computer science and mathematical logics by combining research on provability, analysis of proofs, proof search, and complexity.

This volume covers recent developments in Lukasiewicz Logic and their algebras (Chang MV-algebras), with particular reference to (de Finetti) coherent evaluation of continuously valued events, (Renyi) conditionals, and related algorithms.

This short book, geared towards undergraduate students of computer science and mathematics, is specifically designed for a first course in mathematical logic.

States and proves various theorems of many-valued propositional logic. This text provides developments and trends, including applications to adaptive error-correcting binary search. It contains material, such as a simple proof of completeness theorem and of the equivalence between Chang's MV algebras and Abelian lattice-ordered groups with unit.