{"entities":{"Q2553960":{"pageid":2564703,"ns":120,"title":"Item:Q2553960","lastrevid":79072544,"modified":"2026-05-06T13:05:05Z","type":"item","id":"Q2553960","labels":{"en":{"language":"en","value":"Equivalence of partial recursivity and computability by algorithms without concluding formulas"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3382328"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2553960$35008356-5CDB-47D7-8E37-62B18E104807","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6c18ea88c0dbc10c54c04dd9c642cb69078f5e29","datavalue":{"value":{"text":"Equivalence of partial recursivity and computability by algorithms without concluding formulas","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2553960$A154EAEC-F78B-47BD-9A61-0A6C74C3FED6","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"7106f8ff3ba4a31afdbca7babe38ed51666fb555","datavalue":{"value":"0242.02043","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2553960$2F483FF4-4455-4C3A-906B-29084E021333","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"719faedb96ccdc82355e6e4bcd01ae45a6003a5a","datavalue":{"value":"10.1007/BF02575518","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2553960$3CAED70F-F36C-492F-8180-1DFC57568869","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"52cccf60f0b7ae00b284e506a54e8eed8b433b9e","datavalue":{"value":{"entity-type":"item","numeric-id":1844220,"id":"Q1844220"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2553960$B1795C9B-2335-4595-9045-B554A9938231","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"986210a7788bf135576802eb9fb5ade52a93410d","datavalue":{"value":{"entity-type":"item","numeric-id":256972,"id":"Q256972"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2553960$E1560CB2-2602-401A-9D2A-0F9DAA2D6258","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"fa0ba58b3114d8fa3b465e5112e7eee5b47291c2","datavalue":{"value":{"entity-type":"item","numeric-id":260128,"id":"Q260128"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2553960$A3ED40DB-BC5B-465B-AC97-A4301AAEE2BA","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4bb0eaa1d64c683ee03edf396d2a33ea56290ca3","datavalue":{"value":{"time":"+1972-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2553960$F7B0A4BC-3660-4BFA-8BD2-474E1F7DE2A8","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"21699a423435669f291d1bd1ba3da28fa1465b3f","datavalue":{"value":"03D03","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2553960$994DF4AD-3E0A-453E-B453-9D2040C66E1E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"e6ee9f5484d11a01fb95552e5bea2154ebac0877","datavalue":{"value":"03D20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2553960$6A295E60-E2F7-4B47-97B9-BDA0C5514A9E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9ed1e3c6cced595a05b8ae19055521b22405b78a","datavalue":{"value":"68W99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2553960$D12764DA-011E-4897-86EF-D38232688D89","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9a3faf9abc3812116c230e7662ae1a9fd2633c82","datavalue":{"value":"3382328","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2553960$45FA844B-D227-4172-86B0-5ABDE0E49B2E","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2553960$B0B4EB72-76BF-41E7-8777-7EED2FC4C976","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"92363ae7b85a2f2143d0400523d539206a1dd11e","datavalue":{"value":"https://doi.org/10.1007/bf02575518","type":"string"},"datatype":"url"},"type":"statement","id":"Q2553960$384EB9C4-F615-4DC3-B459-1DFF2E6EF50E","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"6e63b4ba2a14cda95b5b1497219c3924b79ab138","datavalue":{"value":"W1988771156","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2553960$54C7DCBD-F2CD-402D-8241-B4510CBAF72A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Equivalence of partial recursivity and computability by algorithms without concluding formulas","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Equivalence_of_partial_recursivity_and_computability_by_algorithms_without_concluding_formulas"}}}}}