Iteration-Free PDL With Storing, Recovering and Parallel Composition: A Complete Axiomatization

Journal of Logic and Computation - United Kingdom
doi 10.1093/logcom/exv035
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Oxford University Press (OUP)

Related search

Axiomatization and Computability of a Variant of Iteration-Free PDL With Fork

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

A Complete Equational Axiomatization for MPA With String Iteration

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1999English

A Complete Equational Axiomatization for Prefix Iteration With Silent Steps

BRICS Report Series
1995English

A Ground-Complete Axiomatization of Stateless Bisimilarity Over Linda

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2015English

Iteration of a Composition of Exponential Functions

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1991English

A Complete Axiomatization of a First-Order Temporal Logic Over Trace Systems

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1997English

Parallel Communicating Grammar Systems With Context-Free Components Are Turing Complete for Any Communication Model

Acta Universitatis Sapientiae, Informatica
2016English

Recovering Noise-Free Quantum Observables

Physical Review A
OpticsAtomicMolecular Physics,
2019English

A Group Preference Axiomatization With Cardinal Utility

Management Science
Management ScienceManagementOperations ResearchStrategy
1976English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy