{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:55:43Z","timestamp":1725584143466},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212536"},{"type":"electronic","value":"9783642212543"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21254-3_35","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T09:38:04Z","timestamp":1306489084000},"page":"440-451","source":"Crossref","is-referenced-by-count":1,"title":["Well-Quasi-Ordering Hereditarily Finite Sets"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Policriti","sequence":"first","affiliation":[]},{"given":"Alexandru I.","family":"Tomescu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P., Delzanno, G., Van Begin, L.: A classification of the expressive power of well-structured transition systems. Information and Computation (in Press)","DOI":"10.1016\/j.ic.2010.11.003"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01594179","volume":"114","author":"W. Ackermann","year":"1937","unstructured":"Ackermann, W.: Die Widerspruchfreiheit der allgemeinen Mengenlehre. Mathematische Annalen\u00a0114, 305\u2013315 (1937)","journal-title":"Mathematische Annalen"},{"key":"35_CR3","volume-title":"Digraphs Theory, Algorithms and Applications","author":"J. Bang-Jensen","year":"2000","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs Theory, Algorithms and Applications, 1st edn. Springer, Berlin (2000)","edition":"1"},{"key":"35_CR4","volume-title":"Combinatorics","author":"B. Bollob\u00e1s","year":"1986","unstructured":"Bollob\u00e1s, B.: Combinatorics. Cambridge University Press, Cambridge (1986)"},{"issue":"1","key":"35_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.jctb.2010.10.003","volume":"101","author":"M. Chudnovsky","year":"2011","unstructured":"Chudnovsky, M., Seymour, P.D.: A well-quasi-order for tournaments. J. Comb. Theory, Ser. B\u00a0101(1), 47\u201353 (2011)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1-2","key":"35_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere? Theoretical Computer Science\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"35_CR7","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"3","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc.\u00a03(2), 326\u2013336 (1952)","journal-title":"Proc. London Math. Soc."},{"key":"35_CR8","first-page":"210","volume":"95","author":"J.B. Kruskal","year":"1960","unstructured":"Kruskal, J.B.: Well-quasi ordering, the tree theorem and V\u00e1szonyi\u2019s conjecture. Trans. Amer. Math. Soc.\u00a095, 210\u2013225 (1960)","journal-title":"Trans. Amer. Math. Soc."},{"key":"35_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02308-2","volume-title":"Basic Set Theory","author":"A. Levy","year":"1979","unstructured":"Levy, A.: Basic Set Theory. Springer, Berlin (1979)"},{"key":"35_CR10","unstructured":"Nash-Williams, C.S.J.A.: On well-quasi-ordering trees. In: Theory of Graphs and Its Applications (Proc. Symp. Smolenice, 1963), pp. 83\u201384. Publ. House Czechoslovak Acad. Sci. (1964)"},{"issue":"2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"459","DOI":"10.2178\/jsl\/1268917490","volume":"75","author":"E.G. Omodeo","year":"2010","unstructured":"Omodeo, E.G., Policriti, A.: The Bernays-Sch\u00f6nfinkel-Ramsey class for set theory: semidecidability. J. Symb. Log.\u00a075(2), 459\u2013480 (2010)","journal-title":"J. Symb. Log."},{"issue":"2","key":"35_CR12","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1090\/S0002-9939-97-03630-7","volume":"125","author":"F. Parlamento","year":"1997","unstructured":"Parlamento, F., Policriti, A., Rao, K.: Witnessing Differences Without Redundancies. Proc. of the American Mathematical Society\u00a0125(2), 587\u2013594 (1997)","journal-title":"Proc. of the American Mathematical Society"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N. Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.: Graph minors. XX. Wagner\u2019s conjecture. J. Combin. Theory, Ser. B\u00a092, 325\u2013357 (2004)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jctb.2009.07.003","volume":"100","author":"N. Robertson","year":"2010","unstructured":"Robertson, N., Seymour, P.: Graph minors. XXIII. Nash\u2013Williams\u2019s immersion conjecture. J. Combin. Theory, Ser. B\u00a0100, 181\u2013205 (2010)","journal-title":"J. Combin. Theory, Ser. B"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21254-3_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T00:02:52Z","timestamp":1553731372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21254-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212536","9783642212543"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21254-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}