Proof search in Lax Logic

Authors:
Jacob M. Howe
Affiliations:
Computing Laboratory, University of Kent, Canterbury CT2 7NF, England
Venue:
Mathematical Structures in Computer Science
Year:
2001

Citing 10
Cited 2

Computational lambda-calculus and monads

Proceedings of the Fourth Annual Symposium on Logic in computer science
Propositional lax logic

Information and Computation
Permutability of proofs in intuitionistic sequent calculi

Theoretical Computer Science - Special issue: Gentzen
Efficient Loop-Check for Backward Proof Search in Some Non-classical Propositional Logics

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Almost Duplication-Free Tableau Calculi for Propositional Lax Logics

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
An Intuitionistic Modal Logic with Applications to the Formal Verification of Hardware

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Algorithmic Proof with Diminishing Resources, Part 1

CSL '90 Proceedings of the 4th Workshop on Computer Science Logic
Two Loop Detection Mechanisms: A Comparision

TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Computational types from a logical perspective

Journal of Functional Programming

Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
A modal deconstruction of access control logics

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Gentzen sequent calculus for Lax Logic is presented, the proofs in which correspond naturally 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 that uses a history mechanism in order to give a decision procedure for propositional Lax Logic.