{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T06:43:04Z","timestamp":1775457784731,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540005681","type":"print"},{"value":"9783540364696","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36469-2_10","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T03:02:41Z","timestamp":1193454161000},"page":"119-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Information Retrieval in MML"],"prefix":"10.1007","author":[{"given":"Grzegorz","family":"Bancerek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Rudnicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,1,30]]},"reference":[{"issue":"1","key":"10_CR1","first-page":"107","volume":"1","author":"G. Bancerek","year":"1990","unstructured":"Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107\u2013114, 1990.","journal-title":"Formalized Mathematics"},{"key":"10_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/3-540-44557-9_8","volume-title":"TYPES","author":"D. Delahaye","year":"2000","unstructured":"David Delahaye. Information Retrieval in a Coq Proof Library using Type Isomorphisms. In T. Coquand et al., editors, TYPES, volume 1956 of LNCS, pages 131\u2013147. Springer, 2000."},{"key":"10_CR3","unstructured":"Mizar Manuals. \nhttp:\/\/mizar.org\/project\/bibliography.html\n\n."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/jsco.2001.0456","volume":"32","author":"P. Rudnicki","year":"2001","unstructured":"P. Rudnicki, Ch. Schwarzweller and A. Trybulec. Commutative Algebra in the Mizar System. Journal of Symbolic Computation, 32:143\u2013169, 2001.","journal-title":"Journal of Symbolic Computation"},{"issue":"3\u20134","key":"10_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1006218513245","volume":"23","author":"P. Rudnicki","year":"1999","unstructured":"Piotr Rudnicki and Andrzej Trybulec. On equivalents of well-foundedness. Journal of Automated Reasoning, 23(3\u20134):197\u2013234, 1999.","journal-title":"Journal of Automated Reasoning"},{"issue":"1","key":"10_CR6","first-page":"9","volume":"1","author":"A. Trybulec","year":"1990","unstructured":"Andrzej Trybulec. Tarski Grothendieck set theory. Formalized Mathematics, 1(1):9\u201311, 1990.","journal-title":"Formalized Mathematics"},{"issue":"2","key":"10_CR7","first-page":"313","volume":"1","author":"A. Wojciech","year":"1990","unstructured":"Wojciech A. Trybulec. Partially ordered sets. Formalized Mathematics, 1(2):313\u2013319, 1990.","journal-title":"Formalized Mathematics"},{"issue":"3","key":"10_CR8","first-page":"569","volume":"1","author":"W. A. Trybulec","year":"1990","unstructured":"Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569\u2013573, 1990.","journal-title":"Formalized Mathematics"},{"issue":"1","key":"10_CR9","first-page":"73","volume":"1","author":"E. Woronowicz","year":"1990","unstructured":"Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73\u201383, 1990.","journal-title":"Formalized Mathematics"},{"issue":"1","key":"10_CR10","first-page":"123","volume":"6","author":"M. \u017bynel","year":"1997","unstructured":"Mariusz \u017bynel and Czes\u0142aw Byli\u0144ski. Properties of relational structures, posets, lattices and maps. Formalized Mathematics, 6(1):123\u2013130, 1997.","journal-title":"Formalized Mathematics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36469-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T06:19:04Z","timestamp":1578637144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36469-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540005681","9783540364696"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-36469-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"30 January 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}