{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:20:12Z","timestamp":1742955612462,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662469057"},{"type":"electronic","value":"9783662469064"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46906-4_2","type":"book-chapter","created":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T09:59:50Z","timestamp":1430387990000},"page":"10-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tutorial on Admissible Rules in Gudauri"],"prefix":"10.1007","author":[{"given":"Rosalie","family":"Iemhoff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,1]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0890-5401(91)90023-U","volume":"92","author":"A Avron","year":"1991","unstructured":"Avron, A.: Simple consequence relations. Inf. Comput. 92(1), 105\u2013139 (1991)","journal-title":"Inf. Comput."},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1093\/logcom\/exq020","volume":"21","author":"S Babenyshev","year":"2011","unstructured":"Babenyshev, S., Rybakov, V.V.: Linear temporal logic LTL: basis for admissible rules. J. Log. Comput. 21(2), 157\u2013177 (2011)","journal-title":"J. Log. Comput."},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF02259858","volume":"31","author":"A Chagrov","year":"1992","unstructured":"Chagrov, A.: A decidable modal logic with undecidable admissibility problem. Algebra Log. 31(1), 53\u201361 (1992). In Russian","journal-title":"Algebra Log."},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.apal.2010.09.001","volume":"162","author":"P Cintula","year":"2010","unstructured":"Cintula, P., Metcalfe, G.: Admissible rules in the implication-negation fragment of intuitionistic logic. Ann. Pure Appl. Log. 162(2), 162\u2013171 (2010)","journal-title":"Ann. Pure Appl. Log."},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF02123815","volume":"32","author":"W Dzik","year":"1973","unstructured":"Dzik, W., Wro\u0144ski, A.: Structural completeness of G\u00f6del and Dummett\u2019s propositional calculi. Stud. Log. 32, 69\u201373 (1973)","journal-title":"Stud. Log."},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"859","DOI":"10.2307\/2586506","volume":"64","author":"S Ghilardi","year":"1999","unstructured":"Ghilardi, S.: Unification in intuitionistic logic. J. Symb. Log. 64(2), 859\u2013880 (1999)","journal-title":"J. Symb. Log."},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1093\/jigpal\/10.3.229","volume":"10","author":"S Ghilardi","year":"2002","unstructured":"Ghilardi, S.: A resolution\/tableaux algorithm for projective approximations in IPC. Log. J. IGPL 10(3), 227\u2013241 (2002)","journal-title":"Log. J. IGPL"},{"issue":"1\u20133","key":"2_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.apal.2003.11.010","volume":"127","author":"S Ghilardi","year":"2004","unstructured":"Ghilardi, S.: Unification, finite duality and projectivity in varieties of Heyting algebras. Ann. Pure Appl. Log. 127(1\u20133), 99\u2013115 (2004)","journal-title":"Ann. Pure Appl. Log."},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/j.apal.2013.09.003","volume":"165","author":"JG Goudsmit","year":"2014","unstructured":"Goudsmit, J.G., Iemhoff, R.: On unification and admissible rules in Gabbay-de Jongh logics. Ann. Pure Appl. Log. 165(2), 652\u2013672 (2014)","journal-title":"Ann. Pure Appl. Log."},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1305\/ndjfl\/1107220674","volume":"46","author":"R Iemhoff","year":"2005","unstructured":"Iemhoff, R.: Intermediate logics and Visser\u2019s rules. Notre Dame J. Formal Log. 46(1), 65\u201381 (2005)","journal-title":"Notre Dame J. Formal Log."},{"issue":"1\u20132","key":"2_CR11","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.apal.2008.10.011","volume":"159","author":"R Iemhoff","year":"2009","unstructured":"Iemhoff, R., Metcalfe, G.: Proof theory for admissible rules. Ann. Pure Appl. Log. 159(1\u20132), 171\u2013186 (2009)","journal-title":"Ann. Pure Appl. Log."},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-540-92687-0_16","volume-title":"Logical Foundations of Computer Science","author":"R Iemhoff","year":"2008","unstructured":"Iemhoff, R., Metcalfe, G.: Hypersequent systems for the admissible rules of modal and intermediate logics. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 230\u2013245. Springer, Heidelberg (2008)"},{"key":"2_CR13","unstructured":"Iemhoff, R., Rozi\u00e8re, P.: Unification in fragments of intermediate logics. J. Symb. Logic (to appear)"},{"issue":"4","key":"2_CR14","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1093\/logcom\/exi029","volume":"15","author":"E Je\u0159\u00e1bek","year":"2005","unstructured":"Je\u0159\u00e1bek, E.: Admissible rules of modal logics. J. Log. Comput. 15(4), 411\u2013431 (2005)","journal-title":"J. Log. Comput."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00153-006-0028-9","volume":"46","author":"E Je\u0159\u00e1bek","year":"2007","unstructured":"Je\u0159\u00e1bek, E.: Complexity of admissible rules. Arch. Math. Log. 46, 73\u201392 (2007)","journal-title":"Arch. Math. Log."},{"key":"2_CR16","unstructured":"Je\u0159\u00e1bek, E.: Blending margins: the modal logic K has nullary unification type. J. Logic Comput. (to appear)"},{"key":"2_CR17","unstructured":"Mints, G.: Derivability of admissible rules. In: Studies in Constructive Mathematics and Mathematical Logic. Zap. Nauchn. Sem. LOMI, part V, vol. 32, pp. 85\u201389. Nauka, Leningrad (1972)"},{"issue":"7\u20138","key":"2_CR18","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1016\/j.apal.2013.01.001","volume":"164","author":"S Odintsov","year":"2013","unstructured":"Odintsov, S., Rybakov, V.V.: Unification and admissible rules for paraconsistent minimal Johansson\u2019s logic J and positive intuitionistic logic IPC$$^+$$. Ann. Pure Appl. Log. 164(7\u20138), 771\u2013784 (2013)","journal-title":"Ann. Pure Appl. Log."},{"key":"2_CR19","first-page":"349","volume":"19","author":"WA Pogorzelski","year":"1971","unstructured":"Pogorzelski, W.A.: Structural completeness of the propositional calculus. Bulletin de l\u2019Acad\u00e9mie Polonaise des Sciences, S\u00e9rie des sciences math\u00e9matiques, astronomiques et physiques 19, 349\u2013351 (1971)","journal-title":"Bulletin de l\u2019Acad\u00e9mie Polonaise des Sciences, S\u00e9rie des sciences math\u00e9matiques, astronomiques et physiques"},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1002\/malq.19750210138","volume":"21","author":"WA Pogorzelski","year":"1975","unstructured":"Pogorzelski, W.A., Prucnal, T.: Structural completeness of the first-order predicate calculus. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik 21(1), 315\u2013320 (1975)","journal-title":"Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik"},{"issue":"1","key":"2_CR21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF02120824","volume":"32","author":"T Prucnal","year":"1973","unstructured":"Prucnal, T.: On the structural completeness of some pure implicational propositional calculi. Stud. Log. 32(1), 45\u201350 (1973)","journal-title":"Stud. Log."},{"key":"2_CR22","first-page":"103","volume":"6","author":"T Prucnal","year":"1976","unstructured":"Prucnal, T.: Structural completeness of Medvedev\u2019s propositional calculus. Rep. Math. Log. 6, 103\u2013105 (1976)","journal-title":"Rep. Math. Log."},{"key":"2_CR23","unstructured":"Rozi\u00e8re, P.: R\u00e8gles admissibles en calcul propositionnel intuitionniste. Ph.D. thesis, Universit\u00e9 Paris VII (1992)"},{"key":"2_CR24","volume-title":"Admissibility of Logical Inference Rules","author":"V Rybakov","year":"1997","unstructured":"Rybakov, V.: Admissibility of Logical Inference Rules. Elsevier, Amsterdam (1997)"},{"issue":"50","key":"2_CR25","doi-asserted-by":"publisher","first-page":"4323","DOI":"10.1016\/j.tcs.2010.09.012","volume":"411","author":"V Rybakov","year":"2010","unstructured":"Rybakov, V.: Rules admissible in transitive temporal logic $$T_{S4}$$, sufficient condition. Theoret. Comput. Sci. 411(50), 4323\u20134332 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"2_CR26","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1093\/logcom\/exr022","volume":"22","author":"V Rybakov","year":"2012","unstructured":"Rybakov, V.: Writing out unifiers in linear temporal logic. J. Log. Comput. 22(5), 1199\u20131206 (2012)","journal-title":"J. Log. Comput."},{"key":"2_CR27","first-page":"75","volume":"23","author":"R Skura","year":"1989","unstructured":"Skura, R.: A complete syntactical characterization of the intuitionistic logic. Rep. Math. Log. 23, 75\u201380 (1989)","journal-title":"Rep. Math. Log."},{"issue":"4","key":"2_CR28","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1305\/ndjfl\/1093634487","volume":"33","author":"J Slaney","year":"1992","unstructured":"Slaney, J., Meyer, R.: A structurally complete fragment of relevant logic. Notre Dame J. Formal Log. 33(4), 561\u2013566 (1992)","journal-title":"Notre Dame J. Formal Log."},{"issue":"12","key":"2_CR29","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/malq.201110001","volume":"58","author":"K S\u0142omczy\u0144ska","year":"2012","unstructured":"S\u0142omczy\u0144ska, K.: Algebraic semantics for the $$(\\leftrightarrow,\\lnot \\lnot )$$-fragment of IPC. Math. Log. Q. 58(12), 29\u201337 (2012)","journal-title":"Math. Log. Q."},{"issue":"1","key":"2_CR30","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1305\/ndjfl\/1039096308","volume":"40","author":"A Visser","year":"1999","unstructured":"Visser, A.: Rules and arithmetics. Notre Dame J. Formal Log. 40(1), 116\u2013140 (1999)","journal-title":"Notre Dame J. Formal Log."},{"issue":"1\u20133","key":"2_CR31","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0168-0072(01)00081-1","volume":"114","author":"A Visser","year":"2002","unstructured":"Visser, A.: Substitutions of $$\\Sigma _1^0$$-sentences: explorations between intuitionistic propositional logic and intuitionistic arithmetic. Ann. Pure Appl. Log. 114(1\u20133), 227\u2013271 (2002)","journal-title":"Ann. Pure Appl. Log."},{"issue":"1","key":"2_CR32","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1305\/ndjfl\/1093636011","volume":"33","author":"T Williamson","year":"1992","unstructured":"Williamson, T.: An alternative rule of disjunction in modal logic. Notre Dame J. Formal Log. 33(1), 89\u2013100 (1992)","journal-title":"Notre Dame J. Formal Log."},{"key":"2_CR33","first-page":"69","volume":"38","author":"P Wojtylak","year":"2004","unstructured":"Wojtylak, P.: On a problem of H. Friedman and its solution by T. Prucnal. Rep. Math. Log. 38, 69\u201386 (2004)","journal-title":"Rep. Math. Log."},{"issue":"4","key":"2_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1380572.1380574","volume":"9","author":"F Wolter","year":"2008","unstructured":"Wolter, F., Zakharyaschev, M.: Undecidability of the unification and admissibility problems for modal and description logics. ACM Trans. Comput. Log. 9(4), 1\u201320 (2008). Article 25","journal-title":"ACM Trans. Comput. Log."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46906-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T10:18:02Z","timestamp":1675851482000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-46906-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662469057","9783662469064"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46906-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}