liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
On Strictly Arithmetical Completeness in Logics of Programs
University of Warsaw.
1991 (English)In: Theoretical Computer Science, ISSN 0304-3975, Vol. 79, no 2, 341-355 p.Article in journal (Refereed) Published
Abstract [en]

We introduce and discuss a notion of strictly arithmetical completeness related to relative completeness of Cook (1978) and arithmetical completeness of Harel (1978). We present a powerful technique of obtaining strictly arithmetical axiomatizations of logics of programs. Given a model-theoretic semantics of a logic and a set of formulae defining (in a metalanguage) its nonclassical connectives, we automatically derive strictly arithmetically complete and sound proof systems for this logic. As examples of application of the technique we obtain new axiomatizations of algorithmic logic, (concurrent) dynamic logic and temporal logic.

Place, publisher, year, edition, pages
Elsevier, 1991. Vol. 79, no 2, 341-355 p.
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-74975DOI: 10.1016/0304-3975(91)90336-ZOAI: diva2:499807
Available from: 2012-02-13 Created: 2012-02-13 Last updated: 2012-02-22

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Szalas, Andrzej
In the same journal
Theoretical Computer Science
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 112 hits
ReferencesLink to record
Permanent link

Direct link