Logical specifications as productions for transformation of program graphs

Bulletin of Symbolic Logic 6 (1):133-134 (2000)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,888

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Notes on the stable regularity lemma.M. Malliaris & S. Shelah - 2021 - Bulletin of Symbolic Logic 27 (4):415-425.
REVIEWS-Three papers on infinite graphs.Peter Komjath - 2001 - Bulletin of Symbolic Logic 7 (4):539-540.
Peirce's Logical Graphs for Boolean Algebras and Distributive Lattices.Minghui Ma - 2018 - Transactions of the Charles S. Peirce Society 54 (3):320.
“Setting” n-Opposition.Régis Pellissier - 2008 - Logica Universalis 2 (2):235-263.

Analytics

Added to PP
2014-01-19

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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