A Property of 2‐Sorted Peano Models and Program Verification

Mathematical Logic Quarterly 30 (19-24):325-334 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

A property of 2‐sorted peano models and program verification.L. Csirmaz & J. B. Paris - 1984 - Mathematical Logic Quarterly 30 (19‐24):325-334.
Program verification: the very idea.James H. Fetzer - 1988 - Communications of the Acm 31 (9):1048--1063.
Nonstandard Runs And Program Verification.Laszlo Csirmaz - 1981 - Bulletin of the Section of Logic 10 (2):68-77.
Verification of concurrent programs: the automata-theoretic framework.Moshe Y. Vardi - 1991 - Annals of Pure and Applied Logic 51 (1-2):79-98.
Saturated models of peano arithmetic.J. F. Pabion - 1982 - Journal of Symbolic Logic 47 (3):625-637.
Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
Torre models in the isols.Joseph Barback - 1994 - Journal of Symbolic Logic 59 (1):140-150.
The joint embedding property in normal open induction.Margarita Otero - 1993 - Annals of Pure and Applied Logic 60 (3):275-290.
Interstitial and pseudo gaps in models of Peano Arithmetic.Ermek S. Nurkhaidarov - 2010 - Mathematical Logic Quarterly 56 (2):198-204.

Analytics

Added to PP
2015-12-02

Downloads
20 (#728,433)

6 months
3 (#928,914)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeffrey Paris
University of Manchester

Citations of this work

No citations found.

Add more citations

References found in this work

First-Order Dynamic Logic.David Harel - 1982 - Journal of Symbolic Logic 47 (2):453-454.
Mathematical Theory of Computation.Zohar Manna - 1979 - Journal of Symbolic Logic 44 (1):122-124.

Add more references