Proof search in Lax Logic

Proof search in Lax Logic

A Gentzen sequent calculus for Lax Logic is presented, the proofs in which naturally correspond in a 1–1 way with the normal natural deductions for the logic. The propositional fragment of this calculus is then used a basis for another calculus, one which uses a history mechanism in order to give a decision procedure for propositional Lax Logic.

Propositional Lax Logic Propositional Lax Logic

We investigate a peculiar intuitionistic modal logic, called Propositional Lax Logic (PLL), which has promising applications to the formal veri cation of computer hardware. The logic has emerged from an attempt to express correctness `up to' behavioural constraints | a central notion in hardware veri cation | as a logical modality. As a modal logic it is special since it features a single modal...

Proof Search in Minimal Logic

Quantiied Lax Logic Quantiied Lax Logic

Lax Logic is an intuitionistic modal logic which has so far been investigated at the propositional level. It has shown itself to have applications in the formal veriication of hardware|a logical modality is used to capture and express the correctness of speciicationsùp to' behavioural constraints. A translation from Quantiied Lax Logic to a quantiied classical modal logic is presented which ena...

Proof Search in an Authorization Logic

We consider the problem of proof search in an expressive authorization logic that contains a “says” modality and an ordering on principals. After a description of the proof system for the logic, we identify two fragments that admit complete goal-directed and saturating proof search strategies. A smaller fragment is then presented, which supports both goal-directed and saturating search, and has...