{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:29:40Z","timestamp":1725748180780},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405365"},{"type":"electronic","value":"9783642405372"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40537-2_21","type":"book-chapter","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T12:33:51Z","timestamp":1378902831000},"page":"250-256","source":"Crossref","is-referenced-by-count":0,"title":["TAFA \u2013 A Tool for Admissibility in Finite Algebras"],"prefix":"10.1007","author":[{"given":"Christoph","family":"R\u00f6thlisberger","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Baaz, M., Ferm\u00fcller, C.G., Salzer, G.: Automated deduction for many-valued logics. In: Handbook of Automated Reasoning, ch. 20, vol.\u00a0II, pp. 1355\u20131402. Elsevier (2001)","DOI":"10.1016\/B978-044450813-3\/50022-9"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Babenyshev, S., Rybakov, V., Schmidt, R.A., Tishkovsky, D.: A tableau method for checking rule admissibility in S4. In: Proc. M4M 2009. ENTCS, vol.\u00a0262, pp. 17\u201332 (2010)","DOI":"10.1016\/j.entcs.2010.04.003"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1017\/S0305004100013463","volume":"31","author":"G. Birkhoff","year":"1935","unstructured":"Birkhoff, G.: On the structure of abstract algebras. Proc. Camb. Philos. Soc.\u00a031, 433\u2013454 (1935)","journal-title":"Proc. Camb. Philos. Soc."},{"key":"21_CR4","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8130-3","volume-title":"A Course in Universal Algebra","author":"S. Burris","year":"1981","unstructured":"Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Graduate Texts in Mathematics, vol.\u00a078. Springer, New York (1981)"},{"key":"21_CR5","unstructured":"Cabrer, L.M., Metcalfe, G.: Admissibility via natural dualities. Manuscript"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1215\/00294527-2009-004","volume":"50","author":"P. Cintula","year":"2009","unstructured":"Cintula, P., Metcalfe, G.: Structural completeness in fuzzy logics. Notre Dame J. Form. Log.\u00a050(2), 153\u2013183 (2009)","journal-title":"Notre Dame J. Form. Log."},{"issue":"10","key":"21_CR7","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. Logic\u00a0162(10), 162\u2013171 (2010)","journal-title":"Ann. Pure Appl. Logic"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Commun. ACM\u00a022, 465\u2013476 (1979)","journal-title":"Commun. ACM"},{"issue":"2","key":"21_CR9","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. Symbolic Logic\u00a064(2), 859\u2013880 (1999)","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/S0168-0072(99)00032-9","volume":"102","author":"S. Ghilardi","year":"2000","unstructured":"Ghilardi, S.: Best solving modal equations. Ann. Pure Appl. Logic\u00a0102(3), 184\u2013198 (2000)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"21_CR11","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\u00a010(3), 227\u2013241 (2002)","journal-title":"Log. J. IGPL"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"H\u00e4hnle, R.: Automated Deduction in Multiple-Valued Logics. Oxford Univ. Press (1993)","DOI":"10.1093\/oso\/9780198539896.001.0001"},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.2307\/2694922","volume":"66","author":"R. Iemhoff","year":"2001","unstructured":"Iemhoff, R.: On the admissible rules of intuitionistic propositional logic. J. Symbolic Logic\u00a066(1), 281\u2013294 (2001)","journal-title":"J. Symbolic Logic"},{"issue":"1-2","key":"21_CR14","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. Logic\u00a0159(1-2), 171\u2013186 (2009)","journal-title":"Ann. Pure Appl. Logic"},{"key":"21_CR15","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. Logic Comput.\u00a015, 411\u2013431 (2005)","journal-title":"J. Logic Comput."},{"key":"21_CR16","unstructured":"Metcalfe, G.: An Avron rule for fragments of R-mingle. Journal of Logic and Computation (to appear)"},{"issue":"11","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1007\/s00500-012-0839-z","volume":"16","author":"G. Metcalfe","year":"2012","unstructured":"Metcalfe, G., R\u00f6thlisberger, C.: Admissibility in De Morgan algebras. Soft Comput.\u00a016(11), 1875\u20131882 (2012)","journal-title":"Soft Comput."},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Metcalfe, G., R\u00f6thlisberger, C.: Admissibility in finitely generated quasivarieties. Logical Methods in Computer Science\u00a09(2:9) (2013)","DOI":"10.2168\/LMCS-9(2:9)2013"},{"key":"21_CR19","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(97)80001-8","volume-title":"Admissibility of Logical Inference Rules","author":"V. Rybakov","year":"1997","unstructured":"Rybakov, V.: Admissibility of Logical Inference Rules. Studies in Logic and the Foundations of Mathematics, vol.\u00a0136. Elsevier, Amsterdam (1997)"},{"key":"21_CR20","unstructured":"Sprenger, M.: Algebra Workbench, http:\/\/www.algebraworkbench.net"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40537-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T20:18:43Z","timestamp":1715977123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40537-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405365","9783642405372"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40537-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}