"On the complexity of the closed fragment of Japaridze's provability logic."

Fedor Pakhomov (2014)

Details and statistics

DOI: 10.1007/S00153-014-0397-4

access: closed

type: Journal Article

metadata version: 2018-11-30

a service of  Schloss Dagstuhl - Leibniz Center for Informatics