Arithmetical completeness versus relative completeness
type: Item
instance of: scholarly article
title: Arithmetical completeness versus relative completeness
zbMATH Open document ID: 0667.03018
DOI: 10.1007/BF00370552
author: Michał Grabowski
published in: Studia Logica
publication date: 1989-01-01T00:00:00Z
review text: By using nonstandard models for arithmetics and Skolemization techniques, the author shows that as far as finitistic proof systems for dynamic logic are concerned, we cannot expect more than D. Harel's arithmetical completeness.
reviewed by: Hirokazu Nishimura
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 03H15
zbMATH DE Number: 4091473
zbMATH Keywords: nonstandard models
zbMATH Keywords: Skolemization
zbMATH Keywords: finitistic proof systems
zbMATH Keywords: dynamic logic
zbMATH Keywords: arithmetical completeness
MaRDI profile type: Publication
cites work: Ten Years of Hoare's Logic: A Survey—Part I
cites work: Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
cites work: Effective Axiomatizations of Hoare Logics
cites work: Soundness and Completeness of an Axiom System for Program Verification
cites work: Q3765226
cites work: Sound and complete Hoare-like calculi based on copy rules
description: scientific article; zbMATH DE number 4091473