Abstract
Most of the deduction algorithms are of the form of regular expressions. To investigate some properties of these deductions we introduce an extension of PDL with propositional constants and infinite conjunctions and disjunctions. We treat the formulas of the object logical language for which the deductions are as propositional variables, the sets of formulas — as propositional constants and the deductions — as regular programs. A Hilbert's style axiomatization of this logic is shown to be complete for countable Kripke structures of sets of formulas.
Examples include a logic for the PDL logical consequences, a kind of a nonmonotonic deduction algorithm and some properties of logical consequences.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Andréka. Sharpening the Characterization of the Power of Floyd method, Lecture Notes in Computer Science 148 (1983) 1–26
J.Barwise. Admissible Sets and Structures, Springer-Verlag, 1975
J.van Benthem. Partiality and Nonmonotonicity in Classical Logic, report ISLI, 1984
A. Bundy. The Computer Modelling of Mathematical Reasoning, Academic Press, 1983
M. Fischer and R. Ladner. Propositional Dynamic Logic of Regular Programs, J. Comp. Sys. Sci. 18 (1979) 194–211
D.Gabbay. Investigations in Modal and Tense Logics with Applications to Problems in Philosophy and Linguistics, D.Reidel, 1976
Y. Gurevich and S. Shelah. Interpreting Second-Order Logic in the Monadic Logic of Linear Order, J. Symbolic Logic, 48 (1983) 816–828
D. Harel, A. Pnueli and J. Stavi. Further Results on Propositional Dynamic Logic of Nonregular Programs, Lecture Notes in Computer Science 131 (1982) 124–136
J.Keisler. Model Theory for Infinitary Logic, North-Holland, 1971
D. Kozen. On Induction vs. ж-Continuity, Lecture Notes in Computer Science 131 (1982) 167–176
Z. Manna and A. Pnueli. Verification of Concurrent Programs: Temporal Proof Principles, Lecture Notes in Computer Science 131 (1982) 200–252
D. Miller. Expansion Tree Proofs and their Conversion to Natural Deduction Proofs, Lecture Notes in Computer Science 170 (1984) 375–393
I. N'emeti. Nonstandard Dynamic Logic, Lecture Notes in Computer Science 131 (1982) 311–348
S.Passy. Combinatory PDL, Ph.D. Thesis, July 1984, Sofia
S. Passy and T. Tinchev. PDL with Data Constants, Inf. Proc. Letters 20 (1985) 35–41
D. Plaisted. Using Examples, Case Analysis, and Dependency Graphs in Theorem Proving, Lecture Notes in Computer Science 170 (1984) 356–374
S.Radev. Infinitary Propositional Normal Modal Logic and Programming Languages, Ph.D. Thesis, November 1981, Warsaw
S. Radev. Propositional Logics of Formal Languages, Fundamenta Informaticae VII 4 (1984)
P. Schroeder-Heister. A Natural Extension of Natural Deduction, J. Symbolic Logic, 49 (1984) 1284–1300
S. Thomason. Reduction of Second-Order Logic to Modal Logic, Zait. Math. Logic und Grund. Math. 21 (1975) 107–114
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Radev, S. (1985). Extension of PDL and consequence relations. In: Skowron, A. (eds) Computation Theory. SCT 1984. Lecture Notes in Computer Science, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16066-3_21
Download citation
DOI: https://doi.org/10.1007/3-540-16066-3_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16066-3
Online ISBN: 978-3-540-39748-9
eBook Packages: Springer Book Archive