{"entities":{"Q6410014":{"pageid":13543138,"ns":120,"title":"Item:Q6410014","lastrevid":103087268,"modified":"2026-06-06T06:16:28Z","type":"item","id":"Q6410014","labels":{"en":{"language":"en","value":"The First-Order Theory of Binary Overlap-Free Words is Decidable"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900545411"}},"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":"Q6410014$CDF251BE-B4C5-4DD9-9091-4C1A85D98B46","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"399bb970b5aa94d2dcc3b1c2412d70dc07f862c4","datavalue":{"value":{"time":"+2022-09-07T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6410014$F204528E-3872-41B3-B352-A4462D900DF9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4363d4080e22a7699af7ef2d60ea4397f2860d00","datavalue":{"value":{"entity-type":"item","numeric-id":346251,"id":"Q346251"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6410014$EC802898-D10F-4DCF-A5D2-7017471FE3DD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"acbe3fcdaa2e72f3bce067779bfee150bff0b503","datavalue":{"value":{"entity-type":"item","numeric-id":405317,"id":"Q405317"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6410014$4CEBFDB6-71E7-4D6E-A0D9-8C5C939793D2","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"dd7bbebd22fbd17c33a842af05d7bb0d953021e5","datavalue":{"value":"900545411","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6410014$C26D74A1-B2C8-4001-89AB-69C45E1D33D4","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":"Q6410014$187A7ED6-EB62-45CB-BC86-1C3A7506DF65","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The First-Order Theory of Binary Overlap-Free Words is Decidable","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_First-Order_Theory_of_Binary_Overlap-Free_Words_is_Decidable"}}}}}