{"entities":{"Q6474446":{"pageid":13607438,"ns":120,"title":"Item:Q6474446","lastrevid":103350959,"modified":"2026-06-06T07:13:08Z","type":"item","id":"Q6474446","labels":{"en":{"language":"en","value":"Axiomatic Theory of Algorithms: Computability and Decidability in Algorithmic Classes"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900020199"}},"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":"Q6474446$6DC0B72E-8246-4A0A-9447-759AD5537188","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f2131ab0fa6a717351ae1e3ad21854c6ca6be241","datavalue":{"value":{"time":"+2004-09-08T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6474446$A1DA59A1-43D0-4C5B-B611-E6FF2ACD2441","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4ee58b454192e0bbe9bd9756cccb78c6ae1a5858","datavalue":{"value":{"entity-type":"item","numeric-id":1684626,"id":"Q1684626"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6474446$AA35EA09-2882-47AC-8059-338A669E80CD","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d53cd5ab715340bbfc507bf5b4aac1b907f4465d","datavalue":{"value":"03B70","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6474446$4D66CC52-0BC7-4BAB-A41D-1DCE0E67A6CA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a7dde57cbaf704d564d8f981ca98d6340e3d4aaf","datavalue":{"value":"68Q05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6474446$FF21667E-15BC-4E0B-8D49-9657B5FEED38","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7d367946cfc058fc2037cb65d858be9eb24104d2","datavalue":{"value":"900020199","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6474446$70D93B47-8A3D-42CF-AFAC-068D2D906216","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":"Q6474446$8B32D93A-BCE4-44F9-8BEF-CFB33310999B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Axiomatic Theory of Algorithms: Computability and Decidability in Algorithmic Classes","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Axiomatic_Theory_of_Algorithms:_Computability_and_Decidability_in_Algorithmic_Classes"}}}}}