Completeness of Propositional Dynamic Logic with Infinite Repeating

Jurate Sakalauskaite and Mars K. Valiev
Additional contact information
Jurate Sakalauskaite: Lithuanian Academy of Sciences, Institute of Mathematics and Cybernetics
Mars K. Valiev: Academy of Sciences, Institute for System Studies

A chapter in Mathematical Logic, 1990, pp 339-349 from Springer

Abstract: Abstract Completeness of a finite deductive system for PDL with infinite repeating is proved using the method of tableaux trees.

Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0609-2_24

Ordering information: This item can be ordered from
http://www.springer.com/9781461306092

DOI: 10.1007/978-1-4613-0609-2_24

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().