Skip to main content Accessibility help




This paper contains a proof–theoretic account of unification in intermediate logics. It is shown that many existing results can be extended to fragments that at least contain implication and conjunction. For such fragments, the connection between valuations and most general unifiers is clarified, and it is shown how from the closure of a formula under the Visser rules a proof of the formula under a projective unifier can be obtained. This implies that in the logics considered, for the n-unification type to be finitary it suffices that the m-th Visser rule is admissible for a sufficiently large m. At the end of the paper it is shown how these results imply several well-known results from the literature.



Hide All
[1]Baader, F. and Nipkow, T., Term Rewriting and All That, Cambridge University Press, Cambridge, 1998.
[2]Baader, F. and Snyder, W., Unification theory, Handbook of automated reasoning, Elsevier, Amsterdam, 2001.
[3]Cintula, P. and Metcalfe, G., Structural completeness in fuzzy logics. Notre Dame Journal of Formal Logic, vol. 50 (2009), no. 2, pp. 153183.
[4]Cintula, P. and Metcalfe, G., Admissible Rules in the Implication-Negation Fragment of Intuitionistic Logic. Annals of Pure and Applied Logic, vol. 162 (2010), no. 2, pp. 162171.
[5]Citkin, A. I., On structurally complete superintuitionistic logics. Soviet Mathematics Doklady, vol. 19 (1978), pp. 816819.
[6]Dzik, W., Splittings of Lattices of Theories and Unification Types. Proceedings of the Workshop on General Algebra, vol. 70, Verlag Johannes Heyn, Klagenfurt, 2006, pp. 7181.
[7]Dzik, W. and Wojtylak, P., Projective Unification in Modal Logic. Logic Journal of IGPL, vol. 20, (2011), no. 1, pp. 121153.
[8]Dzik, W. and Wronński, A., Structural completeness of Gödel and Dummett’s propositional calculi. Studia Logica, vol. 32 (1973), pp. 6973.
[9]Gabbay, D. and de Jongh, D. H. J., A Sequence of Decidable Finitely Axiomatizable Intermediate Logics with the Disjunction Property, this Journal, vol. 39 (1974), no. 1, pp. 6778.
[10]Ghilardi, S., Unification in intuitionistic logic, this Journal vol. 64 (1999), no. 2, pp. 859880.
[11]Ghilardi, S., Best solving modal equations. Annals of Pure and Applied Logic, vol. 102 (2000), pp. 183198.
[12]Ghilardi, S., A resolution/tableaux algorithm for projective approximations in IPC. Logic Journal of the IGPL, vol. 10 (2002), no. 3, pp. 227241.
[13]Ghilardi, S., Unification, Finite Duality and Projectivity in Varieties of Heyting Algebras. Annals of Pure and Applied Logic, vol. 127 (2004), no. 1–3, pp. 99115.
[14]Goudsmit, J. G. and Iemhoff, R., On unification and admissible rules in Gabbay–de Jongh logics.Annals of Pure and Applied Logic, vol. 165 (2014), no. 2, pp. 652672.
[15]Iemhoff, R., On the admissible rules of intuitionistic propositional logic, this Journal, vol. 66 (2001), no. 1, pp. 281294.
[16]Iemhoff, R., A(nother) characterization of intuitionistic propositional logic. Annals of Pure and Applied Logic, vol. 113 (2001), no. 1–3, pp. 161173.
[17]Iemhoff, R., Intermediate logics and Visser’s rules. Notre Dame Journal of Formal Logic, vol. 46 (2005), no. 1, pp. 6581.
[18]Iemhoff, R., A note on consequence, Logic Group Preprint Series, vol. 314, Utrecht University, Utrecht, 2013.
[19]Iemhoff, R., On Rules. Journal of Philosophical Logic, to appear.
[20]Iemhoff, R., A syntactic approach to unification in transitive reflexive modal logics. Notre Dame Journal of Formal Logic, to appear.
[21]Iemhoff, R. and Metcalfe, G., Proof theory for admissible rules. Annals of Pure and Applied Logic, vol. 159 (2009), no. 1–2, pp. 171186.
[22]Iemhoff, R. and Metcalfe, G., Hypersequent systems for the admissible rules of modal and intermediate logics, Lecture Notes in Computer Science, vol. 5407, Proceedings of LFCS ’09, (Artemov, S. and Nerode, A., editors), Springer, Berlin, 2009, pp. 230245.
[23]Jeřábek, E., Admissible rules of modal logics. Journal of Logic and Computation, vol. 15 (2005),no. 4, pp. 411431.
[24]Jeřábek, E., Complexity of admissible rules. Archive for Mathematical Logic, vol. 46 (2007), pp. 7392.
[25]Minari, P. and Wroński, A., The property (HD) in intermediate logics: a partial solution of a problem of H. Ono. Reports on Mathematical Logic, vol. 22 (1988), pp. 2125.
[26]Mints, G., Derivability of admissible rules, Studies in constructive mathematics and mathematical logic, Zapiski Nauchnykh Seminarov POMI, vol. 32, Nauka, Leningrad, 1972, pp. 8589.
[27]Olson, J. S., Raftery, J. G., and Alten, C. J. V., Structural completeness in substructural logics.Logic Journal of the IGPL, vol. 16 (2008), no. 5, pp. 453495.
[28]Pogorzelski, W. A., Structural completeness of the propositional calculus. Bulletin de l’Académie Polonaise des Sciences. Série des Sciences Mathématiques, vol. 19 (1971), no. 5, pp. 349351.
[29]Prucnal, T., On the structural completeness of some pure implicational propositional calculi.Studia Logica, vol. 32 (1973), no. 1, pp. 4550.
[30]Prucnal, T., Structural completeness of Medvedev’s propositional calculus. Reports on Mathematical Logic, vol. 6 (1976), pp. 103105.
[31]Prucnal, T., On two problems of Harvey Friedman. Studia Logica, vol. 38 (1979), no. 3, pp. 247262.
[32]Rozière, P., Regles admissibles en calcul propositionnel intuitionniste, Ph.D thesis, Université Paris VII, 1992.
[33]Rozière, P., Admissible and derivable rules in intuitionistic logic. Mathematical Structures in Computer Science, vol. 3 (1993), pp. 129136.
[34]Rybakov, V., Admissibility of Logical Inference Rules, Elsevier, Amsterdam, 1997.
[35]Rybakov, V., Writing out Best Unifiers in Intuitionistic Logic for Formulas with Coefficients. Logic Journal of the IGPL, vol. 21 (2013), no. 2, pp. 187198.
[36]Wolter, F. and Zakharyaschev, M., Undecidability of the Unification and Admissibility Problems for Modal and Description Logics. ACM Transactions on Computational Logic, vol. 9 (2008), no. 4, article 25.
[37]Wroński, A., Transparent Unification Problem. Reports on Mathematical Logic, vol. 29 (1995pp. 105107.



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed