A Cut-Free Sequent System for the Smallest Interpretability Logic

ISSN： 0039-3215

Source： Studia Logica, Vol.70, Iss.3, 2002-04, pp. : 353-372

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic

By Dyckhoff R. Pinto L.

Studia Logica, Vol. 60, Iss. 1, 1998-01 ,pp. : 107-118

Springer Publishing Company

Access to resources Recommend Favorite

Cut-Free Tableau Calculi for some Intuitionistic Modal Logics

By Ferrari M.

Studia Logica, Vol. 59, Iss. 3, 1997-11 ,pp. : 303-330

Springer Publishing Company

Access to resources Recommend Favorite

Cut-free Tableau Calculi for some Propositional Normal Modal Logics

By Amerbauer M.

Studia Logica, Vol. 57, Iss. 2-3, 1996-10 ,pp. : 359-372

Springer Publishing Company

Access to resources Recommend Favorite

Cut Elimination inside a Deep Inference System for Classical Predicate Logic

By Brünnler Kai

Studia Logica, Vol. 82, Iss. 1, 2006-02 ,pp. : 51-71

Springer Publishing Company

Access to resources Recommend Favorite

A Note on Bisimulation and Modal Equivalence in Provability Logic and Interpretability Logic

By Čačić Vedran

Studia Logica, Vol. 101, Iss. 1, 2013-02 ,pp. : 31-44

Springer Publishing Company

Access to resources Recommend Favorite