Creating and sharing knowledge for telecommunications

Classic-like cut-based tableau systems for finite-valued logics

on 09-11-2012


Carlos Caleiro, IST-UTL / SQIG-IT

November 9, 2012, Friday, 16h15m.

Abstract: A general procedure is presented for producing classic-like cut-based tableau systems for finite-valued logics. In such systems, cut is the only branching rule, and formulas are accompanied by signs acting as syntactic proxies for the two classical truth-values. The systems produced are guaranteed to be sound, complete and analytic, and they are also seen to polynomially simulate the truth-table method, thus extending known results about classical logic. Lukasiewicz's 3-valued logic is used throughout as a simple illustrative example. Joint work with M. Volpe and J. Marcos.

Room: 3.10, Mathematics

Support: SQIG/Instituto de Telecomunicações with support from FCT and FEDER namely by the FCT project PEst-OE/EEI/LA0008/2011.

More Information..