Finite approximability of forest superintuitionistic logics

1984 ◽  
Vol 36 (5) ◽  
pp. 878-882
Author(s):  
Ya. M. Drugush
2009 ◽  
Vol 74 (4) ◽  
pp. 1171-1205 ◽  
Author(s):  
Emil Jeřábek

AbstractWe develop canonical rules capable of axiomatizing all systems of multiple-conclusion rules over K4 or IPC, by extension of the method of canonical formulas by Zakharyaschev [37]. We use the framework to give an alternative proof of the known analysis of admissible rules in basic transitive logics, which additionally yields the following dichotomy: any canonical rule is either admissible in the logic, or it is equivalent to an assumption-free rule. Other applications of canonical rules include a generalization of the Blok–Esakia theorem and the theory of modal companions to systems of multiple-conclusion rules or (unitary structural global) consequence relations, and a characterization of splittings in the lattices of consequence relations over monomodal or superintuitionistic logics with the finite model property.


1991 ◽  
Vol 32 (1) ◽  
pp. 148-150
Author(s):  
N. V. Ivanov

Studia Logica ◽  
1982 ◽  
Vol 41 (1) ◽  
pp. 67-73
Author(s):  
Wies?aw Dziobiak

2011 ◽  
Vol 50 (2) ◽  
pp. 171-186 ◽  
Author(s):  
A. D. Yashin

Studia Logica ◽  
1986 ◽  
Vol 45 (1) ◽  
pp. 77-99 ◽  
Author(s):  
A. V. Kuznetsov ◽  
A. Yu. Muravitsky

Sign in / Sign up

Export Citation Format

Share Document