{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T08:28:05Z","timestamp":1773390485345,"version":"3.50.1"},"reference-count":4,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":4991,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["MLQ - Math. Log. Quart."],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1002\/1521-3870(200201)48:1<125::aid-malq125>3.0.co;2-n","type":"journal-article","created":{"date-parts":[[2005,12,4]],"date-time":"2005-12-04T15:07:02Z","timestamp":1133708822000},"page":"125-130","source":"Crossref","is-referenced-by-count":8,"title":["On the Slowly Well Orderedness of \u025bo"],"prefix":"10.1002","volume":"48","author":[{"given":"Toshiyasu","family":"Arai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"10.1002\/1521-3870(200201)48:1<125::AID-MALQ125>3.0.CO;2-N-BIB1","author":"Matou\u0161ek","unstructured":"and , Invitation to Discrete Mathematics. Clarendon Press, Oxford-New York 1998."},{"key":"10.1002\/1521-3870(200201)48:1<125::AID-MALQ125>3.0.CO;2-N-BIB2","author":"Simpson","unstructured":"Non-provability of certain combinatorial properties of finite trees. In: Harvey Friedman's research on the foundations of mathematics (L.A. Harrington et al., eds.), North-Holl and Publ. Comp., Amsterdam 1985. pp. 87 - 117."},{"key":"10.1002\/1521-3870(200201)48:1<125::AID-MALQ125>3.0.CO;2-N-BIB3","author":"Weiermann","unstructured":"What makes a (point-wise) subrecursive hierarchy slow growing? In: Sets and proofs (S.B. Cooper and J.K. Truss, eds.), Cambridge Univ. Press, Cambridge 1999, pp. 403 - 423."},{"key":"10.1002\/1521-3870(200201)48:1<125::AID-MALQ125>3.0.CO;2-N-BIB4","author":"Weiermann","unstructured":"An application of graphical enumeration to PA. J. Symbolic Logic (to appear)."}],"container-title":["MLQ"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1521-3870(200201)48:1%3C125::AID-MALQ125%3E3.0.CO;2-N","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1521-3870(200201)48:1%3C125::AID-MALQ125%3E3.0.CO;2-N","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T02:48:44Z","timestamp":1625107724000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1521-3870(200201)48:1<125::AID-MALQ125>3.0.CO;2-N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"URL":"https:\/\/doi.org\/10.1002\/1521-3870(200201)48:1<125::aid-malq125>3.0.co;2-n","relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}