{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:05:32Z","timestamp":1725566732611},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_19","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"263-275","source":"Crossref","is-referenced-by-count":0,"title":["Coprimality in Finite Models"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Mostowski","sequence":"first","affiliation":[]},{"given":"Konrad","family":"Zdanowski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.2307\/2586837","volume":"63","author":"A. B\u00e8s","year":"1998","unstructured":"B\u00e8s, A., And Richard, D.: Undecidable extensions of Skolem arithmetic. Journal of Symbolic Logic\u00a063, 379\u2013401 (1998)","journal-title":"Journal of Symbolic Logic"},{"key":"19_CR2","first-page":"1","volume-title":"Current Trends in Theoretical Computer Science","author":"Y. Gurevich","year":"1988","unstructured":"Gurevich, Y.: Logic and the Challenge of Computer Science. In: B\u00f6rger, E. (ed.) Current Trends in Theoretical Computer Science, pp. 1\u20137. Computer Science Press, Rockville (1988)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the ACM\u00a012, 576\u2013583 (1969)","journal-title":"Communications of the ACM"},{"key":"19_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139164986","volume-title":"The prime number theorem","author":"G.J.O. Jameson","year":"2003","unstructured":"Jameson, G.J.O.: The prime number theorem. Cambridge University Press, Cambridge (2003)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.2178\/jsl\/1080938836","volume":"69","author":"L.A. Ko\u0142odziejczyk","year":"2004","unstructured":"Ko\u0142odziejczyk, L.A.: Truth definitions in finite models. Journal of Symbolic Logic\u00a069, 183\u2013200 (2004)","journal-title":"Journal of Symbolic Logic"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.2178\/jsl\/1102022213","volume":"69","author":"L.A. Ko\u0142odziejczyk","year":"2004","unstructured":"Ko\u0142odziejczyk, L.A.: A finite model-theoretical proof of a property of bounded query classes within PH. Journal of Symbolic Logic\u00a069, 1105\u20131116 (2004)","journal-title":"Journal of Symbolic Logic"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2178\/jsl\/1107298508","volume":"70","author":"M. Krynicki","year":"2005","unstructured":"Krynicki, M., And Zdanowski, K.: Theories of arithmetics in finite models. Journal of Symbolic Logic\u00a070, 1\u201328 (2005)","journal-title":"Journal of Symbolic Logic"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1002\/malq.200310041","volume":"49","author":"T. Lee","year":"2003","unstructured":"Lee, T.: Arithmetical definability over finite structures. Mathematical Logic Quarterly\u00a049, 385\u2013393 (2003)","journal-title":"Mathematical Logic Quarterly"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.2307\/2275735","volume":"62","author":"F. Maurin","year":"1997","unstructured":"Maurin, F.: The theory of integer multiplication with order restricted to primes is decidable. Journal of Symbolic Logic\u00a062, 123\u2013130 (1997)","journal-title":"Journal of Symbolic Logic"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1002\/1521-3870(200111)47:4<513::AID-MALQ513>3.0.CO;2-J","volume":"47","author":"M. Mostowski","year":"2001","unstructured":"Mostowski, M.: On representing concepts in finite models. Mathematical Logic Quarterly\u00a047, 513\u2013523 (2001)","journal-title":"Mathematical Logic Quarterly"},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-94-017-2612-2_2","volume-title":"Philosophical Dimensions of Logic and Science","author":"M. Mostowski","year":"2003","unstructured":"Mostowski, M.: On representing semantics in finite models. In: Rojszczak, A., Cachro, J., Kurczewski, G. (eds.) Philosophical Dimensions of Logic and Science, pp. 15\u201328. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1002\/malq.200310086","volume":"50","author":"M. Mostowski","year":"2004","unstructured":"Mostowski, M., Andwasilewska, A.: Arithmetic of divisibility in finite models. Mathematical Logic Quarterly\u00a050, 169\u2013174 (2004)","journal-title":"Mathematical Logic Quarterly"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/11494645_45","volume-title":"New Computational Paradigms","author":"M. Mostowski","year":"2005","unstructured":"Mostowski, M., And Zdanowski, K.: FM\u2013representability and beyond. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol.\u00a03526, pp. 358\u2013367. Springer, Heidelberg (2005)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/963927.963928","volume":"5","author":"N. Schweikardt","year":"2004","unstructured":"Schweikardt, N.: Arithmetic, First-Order Logic, and Counting Quantifiers. ACMTransactions on Computational Logic\u00a05, 1\u201335 (2004)","journal-title":"ACMTransactions on Computational Logic"},{"key":"19_CR15","volume-title":"Elementary Theory of Numbers","author":"W. Sierpi\u0144ski","year":"1964","unstructured":"Sierpi\u0144ski, W.: Elementary Theory of Numbers. PWN (Polish Scientific Publishers), North Holland (1964)"},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-94-010-1138-9_8","volume-title":"Proceedings 15th ICALP 88 Logic, foundations of mathematics and computability theory","author":"L.W. Szczerba","year":"1977","unstructured":"Szczerba, L.W.: Interpretability of elementary theories. In: Butts, Hintikka (eds.) Proceedings 15th ICALP 88 Logic, foundations of mathematics and computability theory, pp. 129\u2013145. Reidel Publishing, Dordrecht (1977)"},{"key":"19_CR17","unstructured":"Trachtenbrot, B.: The impossibility of an algorithm for the decision problem for finite domains. In: Doklady Akademii Nauk SSSR, vol.\u00a070, pp. 569\u2013572 (1950) (in Russian)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:54:12Z","timestamp":1619506452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11538363_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}