{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:03:50Z","timestamp":1743041030137,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642118289"},{"type":"electronic","value":"9783642118296"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11829-6_3","type":"book-chapter","created":{"date-parts":[[2010,2,1]],"date-time":"2010-02-01T11:55:32Z","timestamp":1265025332000},"page":"6-8","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmic Definability and Completeness in Modal Logic"],"prefix":"10.1007","author":[{"given":"Dimiter","family":"Vakarelov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","first-page":"17","volume-title":"Advances in Modal Logic","author":"W. Conradie","year":"2005","unstructured":"Conradie, W., Goranko, V., Vakarelov, D.: Elementary canonical formulae: a survey on syntactic, algorithmic, and model-theoretic aspects. In: Schmidt, R., Pratt-Hartmann, I., Reynolds, M., Wansing, H. (eds.) Advances in Modal Logic, vol.\u00a05, pp. 17\u201351. Kings College, London (2005)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Conradie, W., Goranko, V., Vakarelov, D.: Algorithmic correspondence and completeness in modal logic I: The core algorithm SQEMA. Logical Methods in Computer Science\u00a02(1:5) (2006)","DOI":"10.2168\/LMCS-2(1:5)2006"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1093\/logcom\/exl026","volume":"16","author":"W. Conradie","year":"2006","unstructured":"Conradie, W., Goranko, V., Vakarelov, D.: Algorithmic correspondence and completeness in modal logic II. Polyadic and hybrid extensions of the algorithm SQEMA. Journal of Logic and Computation\u00a016, 579\u2013612 (2006)","journal-title":"Journal of Logic and Computation"},{"issue":"4","key":"3_CR4","doi-asserted-by":"crossref","first-page":"307","DOI":"10.3233\/FUN-2009-92401","volume":"92","author":"W. Conradie","year":"2009","unstructured":"Conradie, W., Goranko, V., Vakarelov, D.: Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions. Fundam. Inform.\u00a092(4), 307\u2013343 (2009)","journal-title":"Fundam. Inform."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Conradie, W., Goranko, V., Vakarelov, D.: Algorithmic correspondence in modal logic. In: V: Recursive extensions of the algorithm SQEMA (2009) (submitted)","DOI":"10.1016\/j.jal.2010.08.002"},{"key":"3_CR6","unstructured":"Gabbay, D.M., Schmidt, R., Sza\u0142as, A.: Second-Order Quantifier Elimination: Foundations, Computational Aspects and Applications. Studies in Logic, vol.\u00a012. College Publications (2008)"},{"key":"3_CR7","unstructured":"Georgiev, D., Tinchev, T., Vakarelov, D.: SQEMA - an algoritm for computing first-order equivalents in modal logic: a computer realization. In: Pioneers of Bulgarian Mathematics, International Conference dedicated to Nicola Obrechkoff and Lubomir Tschakaloff, Sofia, Abstracts, July 8-10 (2006)"},{"issue":"1-2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.apal.2005.10.005","volume":"141","author":"V. Goranko","year":"2006","unstructured":"Goranko, V., Vakarelov, D.: Elementary Canonical Formulae: Extending Sahlqvist Theorem. Annals of Pure and Applied Logic\u00a0141(1-2), 180\u2013217 (2006)","journal-title":"Annals of Pure and Applied Logic"},{"key":"3_CR9","first-page":"110","volume-title":"Proc. of the 3rd Scandinavial Logic Symposium, Uppsala 1973","author":"H. Sahlqvist","year":"1975","unstructured":"Sahlqvist, H.: Correspondence and completeness in the first and second-order semantics for modal logic. In: Kanger, S. (ed.) Proc. of the 3rd Scandinavial Logic Symposium, Uppsala 1973, pp. 110\u2013143. North-Holland, Amsterdam (1975)"},{"key":"3_CR10","first-page":"495","volume-title":"Advances in Modal Logic","author":"D. Vakarelov","year":"2003","unstructured":"Vakarelov, D.: Modal definability in languages with a finite number of propositional variables, and a new extention of the Sahlqvist class. In: Balbiani, P., Suzuki, N.-Y., Wolter, F., Zakharyaschev, M. (eds.) Advances in Modal Logic, vol.\u00a04, pp. 495\u2013518. King\u2019s College Publications, London (2003)"},{"key":"3_CR11","unstructured":"Vakarelov, D.: Modal definability, solving equations in modal algebras and generalization of the Ackermann lemma. In: Proceedings of 5th Panhellenic Logic Symposium, Athens, July 25-28, pp. 182\u2013189 (2005)"},{"key":"3_CR12","unstructured":"Vakarelov, D.: A recursive generalizations of Ackermann lemma with applications to \u03bc-definability. In: Kaouri, G., Zahos, S. (eds.) 6th Panhellenic Logic Symposium PLS 2007, Volos, Greece, July 5-8, pp. 133\u2013137 (2007) (Extended abstracts)"},{"key":"3_CR13","unstructured":"van Benthem, J.F.A.K.: Modal Logic and Classical Logic. Bibliopolis, Napoli (1983)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11829-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T03:31:31Z","timestamp":1739763091000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11829-6_3"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642118289","9783642118296"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11829-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}