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) (KAR id:13571)
PDF
Language: English |
|
Click to download this file (251kB)
|
![]() |
This file may not be suitable for users of assistive technology.
Request an accessible format
|
|
Postscript
Language: English |
|
Click to download this file (238kB)
Preview
|
Preview |
This file may not be suitable for users of assistive technology.
Request an accessible format
|
|
Official URL: http://dx.doi.org/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: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Mark Wheadon |
Date Deposited: | 24 Nov 2008 17:58 UTC |
Last Modified: | 16 Nov 2021 09:51 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/13571 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):