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)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,169

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

Logic, language, information and computation.Ruy de Queiroz & Angus Macintyre - 2008 - Annals of Pure and Applied Logic 152 (1):1-2.
The expressive power of k-ary exclusion logic.Raine Rönnholm - 2019 - Annals of Pure and Applied Logic 170 (9):1070-1099.
AF-algebras with lattice-ordered K0: Logic and computation.Daniele Mundici - 2023 - Annals of Pure and Applied Logic 174 (1):103182.
Elementary pairs of models.Elisabeth Bouscaren - 1989 - Annals of Pure and Applied Logic 45 (2):129-137.
A categorical approach to the theory of computation.Philip S. Mulry - 1989 - Annals of Pure and Applied Logic 43 (3):293-305.
Expressive power of digraph solvability.Marc Bezem, Clemens Grabmayer & Michał Walicki - 2012 - Annals of Pure and Applied Logic 163 (3):200-213.
A characterisation of elementary fibrations.Jacopo Emmenegger, Fabio Pasquali & Giuseppe Rosolini - 2022 - Annals of Pure and Applied Logic 173 (6):103103.

Analytics

Added to PP
2014-01-16

Downloads
41 (#610,039)

6 months
4 (#1,001,261)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations