An approach to design of automata-based axiomatization for propositional program and temporal logics

In Dieter Spreen, Hannes Diener & Vasco Brattka (eds.), Logic, Computation, Hierarchies. De Gruyter. pp. 297-324 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1515/9781614518044.297

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,829

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

On Some Method Of Axiomatization Of Some Propositional Calculi.Zdzislaw Dywan - 1986 - Bulletin of the Section of Logic 15 (2):52-56.
Reducing dynamic epistemic logic to pdl by program transformation.Jan van Eijck - unknown
Propositional temporal logics: decidability and completeness.O. Lichtenstein & A. Pneuli - 2000 - Logic Journal of the IGPL 8 (1):55-85.
Branching-time logics repeatedly referring to states.Volker Weber - 2009 - Journal of Logic, Language and Information 18 (4):593-624.
Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics.Balázs Biró & Ildikó Sain - 1993 - Annals of Pure and Applied Logic 63 (3):201-225.
Remark on a finite axiomatization of finite intermediate propositional logics.D. Skvortsov - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):381-386.
A new algebraic semantic approach and some adequate connectives for computation with temporal logic over discrete time.Alfredo Burrieza & Inma P. De Guzmán - 1992 - Journal of Applied Non-Classical Logics 2 (2):181-200.
Alternating automata and temporal logic normal forms.Clare Dixon, Alexander Bolotov & Michael Fisher - 2005 - Annals of Pure and Applied Logic 135 (1-3):263-285.
An infinite class of maximal intermediate propositional logics with the disjunction property.Pierangelo Miglioli - 1992 - Archive for Mathematical Logic 31 (6):415-432.
Hierarchies of modal and temporal logics with reference pointers.Valentin Goranko - 1996 - Journal of Logic, Language and Information 5 (1):1-24.
Verification of concurrent programs: the automata-theoretic framework.Moshe Y. Vardi - 1991 - Annals of Pure and Applied Logic 51 (1-2):79-98.
Resolution-based methods for modal logics.H. de Nivelle, R. Schmidt & U. Hustadt - 2000 - Logic Journal of the IGPL 8 (3):265-292.
Hilbert-Style Axiom Systems for the Matrix-Based Logics RMQ − and RMQ.Albert J. J. Anglberger & Jonathan Lukic - 2015 - Studia Logica 103 (5):985-1003.
An axiomatization for until and since over the reals without the IRR rule.Mark Reynolds - 1992 - Studia Logica 51 (2):165 - 193.
Is “some-other-time” sometimes better than “sometime” for proving partial correctness of programs?Ildikó Sain - 1988 - Studia Logica 47 (3):279 - 301.

Analytics

Added to PP
2015-04-02

Downloads
5 (#1,539,211)

6 months
2 (#1,196,523)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references