Arithmetical completeness versus relative completeness

Studia Logica 47 (3):213 - 220 (1988)
Abstract
In this paper we study the status of the arithmetical completeness of dynamic logic. We prove that for finitistic proof systems for dynamic logic results beyond arithmetical completeness are very unlikely. The role of the set of natural numbers is carefully analyzed.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370552
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 31,317
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
9 ( #512,405 of 2,223,805 )

Recent downloads (6 months)
1 ( #423,227 of 2,223,805 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature