Proof search in lax logic (Q2746761)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Proof search in lax logic |
scientific article; zbMATH DE number 1656478
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proof search in lax logic |
scientific article; zbMATH DE number 1656478 |
Statements
7 March 2002
0 references
Gentzen sequent calculus
0 references
natural deduction
0 references
artificial intelligence
0 references
theorem-proving
0 references
proof-search calculi
0 references
lax logic
0 references
decision procedure
0 references
Proof search in lax logic (English)
0 references
The author gives two proof-search calculi for so-called lax logic. The first calculus is useful for enumerating without redundancy all proofs in the logic; especially where proof-search is for natural deductions. The other calculus builds on the propositional fragment of the first calculus to give a decision procedure for propositional lax logic, so useful for hardware verification.
0 references
