"On Strictly Arithmetical Completeness in Logics of Programs."

Andrzej Szalas (1991)

Details and statistics

DOI: 10.1016/0304-3975(91)90336-Z

access: open

type: Journal Article

metadata version: 2024-02-05

a service of  Schloss Dagstuhl - Leibniz Center for Informatics