Skip to main content

Proof Search in Lax Logic

Howe, Jacob M. (2001) Proof Search in Lax Logic. Mathematical Structures in Computer Science, 11 (4). pp. 573-588. ISSN 0960-1295. (doi:10.1017/S0960129501003334)

Abstract

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

Item Type: Article
DOI/Identification number: 10.1017/S0960129501003334
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 17:58 UTC
Last Modified: 28 May 2019 13:50 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/13571 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year