Decidability and complexity for -regular properties of stochastic systems

, , &
Logic Journal of the IGPL 20 (6):1175-1201 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1093/jigpal/jzr054

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Squares of regular languages.Gerhard Lischke - 2005 - Mathematical Logic Quarterly 51 (3):299.
Decidability and complexity of fibred logics without shared connectives.Sérgio Marcelino & Carlos Caleiro - 2016 - Logic Journal of the IGPL 24 (5).
Baaz, M., HaHjek, P., Montagna, F. and Veith, H., Complexity of t-tautologies (1} 3) 3} 11 Beauquier, D. and Slissenko, A., A" rst order logic for speci" cation of timed algorithms: basic properties and a decidable class (1} 3) 13} 52. [REVIEW]L. Boasson, P. Cegielski, I. Guessarian, Y. Matiyasevich, E. Dantsin, M. Gavrilovich, E. A. Hirsch & B. Konev - 2001 - Annals of Pure and Applied Logic 113 (399):400.
Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics.Linh Nguyen - 2008 - Logic Journal of the IGPL 16 (2):175-193.
Review: Review of Modal Logic P. Blackburn, M. de Rijke, Y. Venema: Review of Modal Logic. [REVIEW]Heinrich Wansing - 2002 - Logic Journal of the IGPL 10 (4):457-458.
Correction to: Decidability of interpretability logics IL M 0 and IL W.Luka Mikec, Tin Perkov & Mladen Vukoviĉ - 2024 - Logic Journal of the IGPL 32 (5):936-937.
The d-elements of precoherent preidempotent quantales and their applications.Xianglong Ruan - forthcoming - Logic Journal of the IGPL.
N. Chomsky and M. P. Schützenberger. The algebraic theory of context-free languages. Computer programming and formal systems, edited by P. Braffort and D. Hirschberg, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1963, pp. 118–161. [REVIEW]G. H. Matthews - 1967 - Journal of Symbolic Logic 32 (3):388-389.
Strongly decidable properties of modal and intuitionistic calculi.L. Maksimova - 2000 - Logic Journal of the IGPL 8 (6):797-819.
Splitting properties of {$n$}-c.e. enumeration degrees.I. Sh Kalimullin - 2002 - Journal of Symbolic Logic 67 (2):537-546.

Analytics

Added to PP
2016-06-30

Downloads
17 (#1,149,837)

6 months
8 (#580,966)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Temporal Reference in Linear Tense Logic.M. J. Cresswell - 2010 - Journal of Philosophical Logic 39 (2):173-200.
A Sound and Complete Proof System for QPTL.Tim French & Mark Reynolds - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 127-147.
A Sound and Complete Proof System for QPTL.Tim French & Mark Reynolds - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 127-147.

Add more references