"On the complexity of the Leibniz hierarchy."

Tommaso Moraschini (2019)

Details and statistics

DOI: 10.1016/J.APAL.2019.02.003

access: closed

type: Journal Article

metadata version: 2022-10-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics