caa a22 4500 465779255 CHVBK 20180323111950.0 cr unu---uuuuu 170327e19900901xx s 000 0 eng 10.1007/BF00370370 doi (NATIONALLICENCE)springer-10.1007/BF00370370 Shehtman Valentin Institute of General Plan of Moscow, 2-ja brestskaja st. 2/14, 125047, Moscow, CCCP aut Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable [Elektronische Daten] [Valentin Shehtman] We consider modal logics whose intermediate fragments lie between the logic of infinite problems [20] and the Medvedev logic of finite problems [15]. There is continuum of such logics [19]. We prove that none of them is finitely axiomatizable. The proof is based on methods from [12] and makes use of some graph-theoretic constructions (operations on coverings, and colourings). Polish Academy of Sciences, 1990 Studia Logica Kluwer Academic Publishers 49/3(1990-09-01), 365-385 0039-3215 49:3<365 1990 49 11225 https://doi.org/10.1007/BF00370370 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF00370370 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Shehtman Valentin Institute of General Plan of Moscow, 2-ja brestskaja st. 2/14, 125047, Moscow, CCCP aut NATIONALLICENCE 773 0- Studia Logica Kluwer Academic Publishers 49/3(1990-09-01), 365-385 0039-3215 49:3<365 1990 49 11225 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer