{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:13Z","timestamp":1725558973244},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642138232"},{"type":"electronic","value":"9783642138249"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13824-9_1","type":"book-chapter","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T11:24:09Z","timestamp":1277983449000},"page":"1-18","source":"Crossref","is-referenced-by-count":0,"title":["Entailment Multipliers: An Algebraic Characterization of Validity for Classical and Modal Logics"],"prefix":"10.1007","author":[{"given":"Marcelo","family":"Finger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio S. C.","family":"Hernandes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Beame, P., Cook, S., Edmonds, J., Impagliazzo, R., Pitassi, T.: The relative complexity of NP search problems. In: Proceedings of the 27th ACM Symposium on Theory of Computing, pp. 303\u2013314 (1995)","DOI":"10.1145\/225058.225147"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Beame, P., Impagliazzo, R., Kraj\u2019icek, J., Pitassi, T., Pudl\u2019ak, P.: Lower bounds on hilbert\u2019s nullstellensatz and propositional proofs. In: Proceedings of the London Mathematical Society, vol.\u00a073, pp. 1\u201326 (1996)","DOI":"10.1112\/plms\/s3-73.1.1"},{"key":"1_CR3","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P. Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., de Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol.\u00a053. Cambridge University Press, Cambridge (2001)"},{"issue":"3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/BF01294258","volume":"6","author":"S. Buss","year":"1997","unstructured":"Buss, S., Impagliazzo, R., Krajicek, J., Pudlak, P., Razborov, A.A., Sgall, J.: Proof complexity in algebraic systems and bounded depth frege systems with modular counting. Computational Complexity\u00a06(3), 256\u2013298 (1997)","journal-title":"Computational Complexity"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Buss, S., Pitassi, T.: Good degree bounds on Nullstellensatz refutations of the induction principle. In: Proceedings from the 11th IEEE Conference on Computational Complexity, pp. 233\u2013242 (1996)","DOI":"10.1109\/CCC.1996.507685"},{"key":"1_CR6","first-page":"20","volume-title":"Proceedings of 35th International Symposium on Multiple-Valued Logic","author":"W. Carnielli","year":"2005","unstructured":"Carnielli, W.: Polynomial ring calculus for many-valued logics. In: Proceedings of 35th International Symposium on Multiple-Valued Logic, Calgary, Canad, pp. 20\u201325. IEEE Computer Society, Los Alamitos (2005)"},{"key":"1_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511621192","volume-title":"Modal Logic \u2014 an Introduction","author":"B.F. Chellas","year":"1980","unstructured":"Chellas, B.F.: Modal Logic \u2014 an Introduction. Cambridge University Press, Cambridge (1980)"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/logcom\/4.3.285","volume":"4","author":"M. D\u2019Agostino","year":"1994","unstructured":"D\u2019Agostino, M., Mondadorip, M.: The taming of the cut. Classical refutations with analytic cut. Journal of Logic and Computation\u00a04, 285\u2013319 (1994)","journal-title":"Journal of Logic and Computation"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10849-005-9001-y","volume":"15","author":"M. Finger","year":"2006","unstructured":"Finger, M., Gabbay, D.: Cut and pay. Journal of Logic, Language and Information\u00a015(3), 195\u2013218 (2006)","journal-title":"Journal of Logic, Language and Information"},{"key":"1_CR10","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198538332.001.0001","volume-title":"Labelled Deductive Systems","author":"D. Gabbay","year":"1996","unstructured":"Gabbay, D.: Labelled Deductive Systems, vol.\u00a01. Oxford University Press, Oxford (1996)"},{"key":"1_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"1_CR12","first-page":"213","volume":"16","author":"L. Lov\u00e1sz","year":"1982","unstructured":"Lov\u00e1sz, L.: Bounding the independence number of a graph. Annals of Discrete Mathematics\u00a016, 213\u2013223 (1982)","journal-title":"Annals of Discrete Mathematics"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Pitassi, T.: Algebraic propositional proof systems. In: Immerman, N., Kolaitis, P. (eds.) Descriptive Complexity and Finite Models. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a031, pp. 214\u2013244. DIMACS (1996)","DOI":"10.1090\/dimacs\/031\/07"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13824-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T22:38:10Z","timestamp":1711579090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13824-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642138232","9783642138249"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13824-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}