Computation paths logic: An expressive, yet elementary, process logic

Annals of Pure and Applied Logic 96 (1-3):167-186 (1999)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

The Expressive Unary Truth Functions of n -valued Logic.Stephen Pollard - 2005 - Notre Dame Journal of Formal Logic 46 (1):93-105.
Elementary classes in basic modal logic.Holger Sturm - 2000 - Studia Logica 64 (2):193-213.
An axiomatization of full computation tree logic.M. Reynolds - 2001 - Journal of Symbolic Logic 66 (3):1011-1057.
Ontologically Minimal Logical Semantics.Uwe Meixner - 1995 - Notre Dame Journal of Formal Logic 36 (2):279-298.
Product Ł ukasiewicz Logic.Rostislav Horčík & Petr Cintula - 2004 - Archive for Mathematical Logic 43 (4):477-503.
Hybrid logic meets if modal logic.Tero Tulenheimo - 2009 - Journal of Logic, Language and Information 18 (4):559-591.
Univers positifs.Bruno Poizat - 2006 - Journal of Symbolic Logic 71 (3):969 - 976.

Analytics

Added to PP
2014-01-16

Downloads
30 (#519,519)

6 months
15 (#157,754)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations