The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The aim of propositional algorithmic logic is to investigate the properties of program connectives. Complete axiomatic systems for deterministic as well as for nondeterministic interpretations of program variables are presented. They constitute basic sets of tools useful in the practice of proving the properties of program schemes. Propositional theories of data structures, e.g. the arithmetic of...
The thesis we present in this paper states that for every concurrent program π there exists a set of modal formulas, also called the axioms Ax(π), such that a) the structure of admissible parallel executions of the program π is a Kripke model of the set Ax(π) and, b) any Kripke model of the axioms Ax(π) is an extension of the structure of all admissible distributed (i.e. parallel) executions of the...
The problem of whether an arbitrary formula of Propositional Dynamic Logic (PDL) is deducible from a fixed axiom scheme of PDL is Π 11 -complete. This contrasts with the decidability of the problem when the axiom scheme is replaced by any single PDL formula.
The problem of whether an arbitrary formula of Propositional Dynamic Logic (PDL) is deducible from a fixed axiom scheme of PDL is Π 11 -complete. This contrasts with the decidability of the problem when the axiom scheme is replaced by any single PDL formula.
Algorithmic algebras form semantical base for semantics of algorithmic logics as Boolean algebras do for propositional calculus. The paper contains the proof of the following statement : every separable algorithmic algebra is representable by an algebra of computations.
The aim of propositional algorithmic logic PAL is to investigate properties of program connectives and to develop tools useful in the practice of proving properties of program schemes. The tautologies of PAL become tautologies of algorithmic logic after replacing program variables by programs and propositional variables by formulas.
The present volume contains papers selected for presentation at the 14th Symposium on Mathematical Foundations of Computer Science - MFCS '89 held in Porabka-Kozubnik, Poland, from August 28 to September 1, 1989. Previous MFCs proceedings have also been published in the Lecture Notes in Computer Science. This volume presents investigations and results in theoretical computer science, in particular...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.