An elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logic

Notre Dame Journal of Formal Logic 30 (4):563-573 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

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

An elementary completeness proof for a system of natural deduction.David W. Bennett - 1973 - Notre Dame Journal of Formal Logic 14 (3):430-432.
On Elementary Equivalence for Equality-free Logic.E. Casanovas, P. Dellunde & R. Jansana - 1996 - Notre Dame Journal of Formal Logic 37 (3):506-522.
Some elementary closure properties of $n$-cylinders.M. B. Thuraisingham - 1983 - Notre Dame Journal of Formal Logic 24 (2):242-254.
Proof of some theorems on recursively enumerable sets.Thoralf Skolem - 1962 - Notre Dame Journal of Formal Logic 3 (2):65-74.
Analogous characterizations of finite and isolated sets.J. Barback, W. D. Jackson & M. Parnes - 1972 - Notre Dame Journal of Formal Logic 13 (4):551-555.
On characterizations of the first-order functional calculus.Juliusz Reichbach - 1961 - Notre Dame Journal of Formal Logic 2 (1):1-15.
Elementary logic without referential quantification.John Thomas Canty - 1971 - Notre Dame Journal of Formal Logic 12 (4):441-446.
On a conservative attitude toward some naive semantic principles.Paul Vincent Spade - 1975 - Notre Dame Journal of Formal Logic 16 (4):597-602.

Analytics

Added to PP
2010-08-24

Downloads
2 (#1,450,151)

6 months
9 (#1,260,759)

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