Completeness of Floyd logic

&
Bulletin of the Section of Logic 7 (3):115-119 (1978)
  Copy   BIBTEX

Abstract

This is an abstract of our paper \A characterisation of Floyd-provable programs" submitted to Theoretical Computer Science. ! denotes the set of natural numbers. Y =d fyi : i 2 !g is the set of variable symbols. L denotes the set of classical rst order formulas of type t possibly with free variables , where t is the similarity type of arithmetic, i.e. it consists of \+; ; 0; 1" with arities \2; 2; 0; 0".

Categories

Keywords

Reprint years

Links

PhilArchive



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

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

My notes

Similar books and articles

Remarks on Floyd-Hoare derivability.Laszlo Csirmaz - 1980 - Bulletin of the Section of Logic 9 (3):131-133.
On definability in Peano arithmetic.Laszlo Csirmaz - 1979 - Bulletin of the Section of Logic 8 (3):148-152.
Completeness: from Gödel to Henkin.Maria Manzano & Enrique Alonso - 2014 - History and Philosophy of Logic 35 (1):1-26.
Misunderstanding gödel: New arguments about Wittgenstein and new remarks by Wittgenstein.Victor Rodych - 2003 - Dialectica 57 (3):279–313.
Intuitionistic completeness of first-order logic.Robert Constable & Mark Bickford - 2014 - Annals of Pure and Applied Logic 165 (1):164-198.
On the completeness of program verifications methods.Balazs Biro - 1981 - Bulletin of the Section of Logic 10 (2):83-88.
Taming logic.Maarten Marx, Szabolcs Mikul & István Németi - 1995 - Journal of Logic, Language and Information 4 (3):207-226.
Arithmetical completeness versus relative completeness.Michal Grabowski - 1988 - Studia Logica 47 (3):213 - 220.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
Omitting types for finite variable fragments and complete representations of algebras.Hajnal Andréka, István Németi & Tarek Sayed Ahmed - 2008 - Journal of Symbolic Logic 73 (1):65-89.
Completeness in Hybrid Type Theory.Carlos Areces, Patrick Blackburn, Antonia Huertas & María Manzano - 2013 - Journal of Philosophical Logic (2-3):1-30.
Elementary definability and completeness in general and positive modal logic.Ernst Zimmermann - 2003 - Journal of Logic, Language and Information 12 (1):99-117.
Resolution calculus for the first order linear logic.Grigori Mints - 1993 - Journal of Logic, Language and Information 2 (1):59-83.
Halldén-completeness by gluing of Kripke frames.J. F. A. K. van Benthem & I. L. Humberstone - 1983 - Notre Dame Journal of Formal Logic 24 (4):426-430.
On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation.Mojżesz Presburger & Dale Jabcquette - 1991 - History and Philosophy of Logic 12 (2):225-233.

Analytics

Added to PP
2015-02-02

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