scientific article; zbMATH DE number 139632

zbMATH Open0759.03017MaRDI QIDQ4029612FDOQ4029612

Authors: Tinko Tinchev, Dimiter Vakarelov 

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

Recommendations

• Foundations of Software Science and Computation Structures
• Propositional dynamic logic with recursive programs
• scientific article; zbMATH DE number 1114354
• PDL with data constants
• scientific article; zbMATH DE number 3848600

zbMATH Keywords

completenessfixed-point semanticsdynamic algebrasinfinitary axiomatizationgeneralization of PDLrecursion operator on programs

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Other algebras related to logic (03G25) Semantics in the theory of computing (68Q55)

Cited In (14)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Propositional dynamic logic of context-free programs and fixpoint logic with chop
• Strong completeness for iteration-free coalgebraic dynamic logics
• Title not available (Why is that?)
• On models for propositional dynamic logic
• Reasoning with recursive loops under the PLP framework
• Propositional dynamic logic with recursive programs
• Diamond formulas: A fragment of dynamic logic with recursively enumerable validity problem
• Weak completeness of coalgebraic dynamic logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Foundations of Software Science and Computation Structures

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4029612)