Gentzen-type axiomatization for PAL (Q688720): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q591511 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Siegfried Johannes Gottwald / rank | |||
Normal rank | |||
Revision as of 20:24, 19 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Gentzen-type axiomatization for PAL |
scientific article |
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
