scholarly journals Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m)

2000 ◽  
Vol 162 (1-2) ◽  
pp. 158-178 ◽  
Author(s):  
Fausto Giunchiglia ◽  
Roberto Sebastiani
1996 ◽  
Vol 61 (1) ◽  
pp. 91-124 ◽  
Author(s):  
Lev D. Beklemishev

AbstractWe characterize the bimodal provability logics for certain natural (classes of) pairs of recursively enumerable theories, mostly related to fragments of arithmetic. For example, we shall give axiomatizations, decision procedures, and introduce natural Kripke semantics for the provability logics of (IΔ0 + EXP, PRA); (PRA, IΣn); (IΣm, IΣn) for 1 ≤ m < n; (PA, ACA0); (ZFC, ZFC + CH); (ZFC, ZFC + ¬CH) etc. For the case of finitely axiomatized extensions of theories these results are extended to modal logics with propositional constants.


2012 ◽  
Vol 7 (1) ◽  
pp. 33-69 ◽  
Author(s):  
Carlos Caleiro ◽  
Luca Viganò ◽  
Marco Volpe
Keyword(s):  

1999 ◽  
Vol 40 (4) ◽  
pp. 317-333 ◽  
Author(s):  
Luis Fariñas del Cerro ◽  
Olivier Gasquet

2000 ◽  
Vol 10 (2) ◽  
pp. 145-172 ◽  
Author(s):  
Enrico Giunchiglia ◽  
Roberto Sebastiani ◽  
Fausto Giunchiglia ◽  
Armando Tacchella

Sign in / Sign up

Export Citation Format

Share Document