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

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-73579-5_2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

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

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
2015English

A Natural Axiomatization of Computability and Proof of Church's Thesis

Bulletin of Symbolic Logic
PhilosophyLogic
2008English

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

Strong Convergence of a Unified General Iteration Fork-Strictly Pseudononspreading Mapping in Hilbert Spaces

Abstract and Applied Analysis
Applied MathematicsAnalysis
2014English

C2PDLS: A Combination of Combinatory and Converse PDL With Substitutions

English

Equational Axiomatization of Algebras With Structure

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Local Computability of Computable Metric Spaces and Computability of co-c.e. Continua

Glasnik Matematicki
Mathematics
2012English

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