Gentzen-type axiomatization for PAL (Q688720)
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: Gentzen-type axiomatization for PAL |
scientific article; zbMATH DE number 438343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Gentzen-type axiomatization for PAL |
scientific article; zbMATH DE number 438343 |
Statements
Gentzen-type axiomatization for PAL (English)
0 references
12 December 1993
0 references
For propositional algorithmic logic (PAL) as introduced by \textit{G. Mirkowska} [Fund. Inform. 4, 675-760 (1981; Zbl 0494.68030)] the author gives a finite, cut-free Gentzen-type axiomatization, proves the completeness of this axiomatization, and gets as corollaries a small- model theorem as well as a decision procedure for PAL.
0 references
logic of programs
0 references
sequent calculus
0 references
decidability
0 references
propositional algorithmic logic
0 references
axiomatization
0 references
0.952166736125946
0 references
0.7531843781471252
0 references
