Arithmetical completeness versus relative completeness

descriptionPublicationkeyboard_double_arrow_right Article 01 Sep 1988 English Publisher:Springer Science and Business Media LLCJournal:Studia Logica, volume 47, pages 213-220 (issn: 0039-3215, eissn: 1572-8730,

Copyright policy )

Authors: Michal Grabowski;

doi: 10.1007/bf00370552

Arithmetical completeness versus relative completeness

- Summary
- Subjects
- Metrics

Abstract

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.

Related Organizations

University of Warsaw
Poland

Keywords

Logic in computer science, dynamic logic, Nonstandard models of arithmetic, finitistic proof systems, Skolemization, arithmetical completeness, nonstandard models, Abstract data types; algebraic specification

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average