5 research outputs found

    Kripke Semantics for Intuitionistic Lukasiewicz Logic

    Get PDF
    This paper proposes a generalization of the Kripke semantics of intuitionistic logic IL appropriate for intuitionistic Łukasiewicz logicIŁL —a logic in the intersection between IL and (classical) Łukasiewicz logic. This generalised Kripke semantics is based on the poset sum construction, used in Bova and Montagna (Theoret Comput Sci 410(12):1143–1158, 2009). to show the decidability (and PSPACE completeness) of the quasiequational theory of commutative, integral and bounded GBL algebras. The main idea is that wψw \Vdash \psi —which for ILis a relation between worlds w and formulas ψ\psi , and can be seen as a function taking values in the booleans (wψ)B(w \Vdash \psi ) \in {{\mathbb {B}}}—becomes a function taking values in the unit interval (wψ)[0,1](w \Vdash \psi ) \in [0,1]. An appropriate monotonicity restriction (which we call sloping functions) needs to be put on such functions in order to ensure soundness and completeness of the semantics

    Seventh Biennial Report : June 2003 - March 2005

    No full text

    Fifth Biennial Report : June 1999 - August 2001

    No full text

    Constructive Fuzzy Logics

    Get PDF
    We generalise Kripke’s semantics for Intuitionistic logic to Hajek’s BL and consider the constructive subsystems of GBLewf and Intuitionistic Affine logic or ALi. The genesis of our semantics is the Poset Product construction for GBL-algebras elucidated in a series of papers by Peter Jipsen, Simone Bova, and Franco Montagna. We present natural deduction systems for all of these systems and corresponding deduction theorems for these same. We present the algebraic semantics for each of the logics under consideration, demonstrate their soundness and completeness with respect to these algebraic semantics. We also show how the classical Kripke semantics for Intuitionistic logic can be recast in terms of Poset Products. We then proceed to the main results, showing how a very natural generalisation of the Kripke semantics holds for each of GBLewf , ALi and Hajek’s BL based on the embedding results of Jipsen and Montagna and the decidability results of Bova and Montagna. We demonstrate soundness and completeness of the logics under our semantics in each case, with the exception of ALi, whose robust completeness with respect to the intended models (relational models with frames valued in involutive pocrims) we leave as an open problem for the ambitious reader
    corecore