Gentzen-type axiomatization for PAL (Q688720): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Q688719 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Siegfried Johannes Gottwald / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decidability of Propositional Algorithmic Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential method in propositional dynamic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantical analysis of constructive PDL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of looping and converse is elementarily decidable / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:26, 22 May 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
    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
    0 references
    logic of programs
    0 references
    sequent calculus
    0 references
    decidability
    0 references
    propositional algorithmic logic
    0 references
    axiomatization
    0 references