Abstract. We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and the...
We generalise some results of [7, 5] and show that if L is an -modal logic (for some ordinal 3) such that (i) L contains the product logic K and (ii) the product of -many trees o...
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...
Abstract. We consider two systems of constructive modal logic which are computationally motivated. Their modalities admit several computational interpretations and are used to capt...
Natasha Alechina, Michael Mendler, Valeria de Paiv...