AbstractThe aim of propositional algorithmic logic (PAL) is to investigate the properties of simple nondeterministic while-program schemes on propositional level. We present finite, cut-free, Gentzen-type axiomatization of PAL. As a corollary from completeness theorem, we obtain the small-model theorem and algorithm for checking the validity of PAL formulas
AbstractThe borderline between decidable and undecidable propositional dynamic Logic (PDL) is sought...
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recurs...
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nonde...
AbstractThe aim of propositional algorithmic logic (PAL) is to investigate the properties of simple ...
AbstractWe present a new propositional calculus that has desirable natures with respect to both auto...
Modal logic has various applications in Computer Science. In this paper, an axiomatization of comput...
AbstractWe introduce a fundamental propositional logical system based on modal logic for describing ...
International audienceWe devote this paper to the axiomatization and the computability of a variant ...
Abstract. The complexity of satisfiability and determination of truth in a particular finite structu...
The proof of completeness for propositional logic is a constructive one, so a computer program is su...
AbstractWe consider an extension QPDL of Segerberg-Pratt's Propositional Dynamic Logic PDL, with pro...
In this thesis, we explore three aspects of the computational content of proofs. These are: a compu...
AbstractWe present a new technique for obtaining decision procedures for modal logics of programs. T...
AbstractA new technique for decidability of program logics is introduced. This technique is applied ...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
AbstractThe borderline between decidable and undecidable propositional dynamic Logic (PDL) is sought...
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recurs...
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nonde...
AbstractThe aim of propositional algorithmic logic (PAL) is to investigate the properties of simple ...
AbstractWe present a new propositional calculus that has desirable natures with respect to both auto...
Modal logic has various applications in Computer Science. In this paper, an axiomatization of comput...
AbstractWe introduce a fundamental propositional logical system based on modal logic for describing ...
International audienceWe devote this paper to the axiomatization and the computability of a variant ...
Abstract. The complexity of satisfiability and determination of truth in a particular finite structu...
The proof of completeness for propositional logic is a constructive one, so a computer program is su...
AbstractWe consider an extension QPDL of Segerberg-Pratt's Propositional Dynamic Logic PDL, with pro...
In this thesis, we explore three aspects of the computational content of proofs. These are: a compu...
AbstractWe present a new technique for obtaining decision procedures for modal logics of programs. T...
AbstractA new technique for decidability of program logics is introduced. This technique is applied ...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
AbstractThe borderline between decidable and undecidable propositional dynamic Logic (PDL) is sought...
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recurs...
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nonde...
DOI
Add to ORKG