Investigations on Fragments of First Order Branching Temporal Logic

Mathematical Logic Quarterly 48 (1):51-62 (2002)
  Copy   BIBTEX

Abstract

We investigate axiomatizability of various fragments of first order computational tree logic showing that the fragments with the modal operator F are non axiomatizable. These results shows that the only axiomatizable fragment is the one with the modal operator next only.

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

First order common knowledge logics.Frank Wolter - 2000 - Studia Logica 65 (2):249-271.
Decidable fragments of first-order temporal logics.Ian Hodkinson, Frank Wolter & Michael Zakharyaschev - 2000 - Annals of Pure and Applied Logic 106 (1-3):85-134.
On Homogenous Fragments Of Normal Modal Propositional Logics.Jerzy Perzanowski - 1975 - Bulletin of the Section of Logic 4 (2):44-49.
On the restraining power of guards.Erich Grädel - 1999 - Journal of Symbolic Logic 64 (4):1719-1742.
An Event-Based Fragment of First-Order Logic over Intervals.Savas Konur - 2011 - Journal of Logic, Language and Information 20 (1):49-68.
A new modal lindström theorem.Johan van Benthem - 2007 - Logica Universalis 1 (1):125-138.

Analytics

Added to PP
2013-12-01

Downloads
25 (#633,530)

6 months
5 (#639,345)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references