{"entities":{"Q3260571":{"pageid":3271279,"ns":120,"title":"Item:Q3260571","lastrevid":80176847,"modified":"2026-05-06T15:36:14Z","type":"item","id":"Q3260571","labels":{"en":{"language":"en","value":"Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3143692"}},"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":"Q3260571$D21C8AFE-DF51-46FB-A243-CE82A1659D6A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"3743caa1389b883f3f31123fa3a06b45c16425e4","datavalue":{"value":{"text":"Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3260571$E81CECB3-AE20-40DC-B66C-587C9F2AEE0A","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"562ef283f3e9deffb42d4b20fef070219a5a25f7","datavalue":{"value":"0088.01601","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3260571$1098E990-EC01-4692-BA2A-801E66BD004B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"dc3f221a9a72a0c331ee1daf65e704b907cc4c40","datavalue":{"value":"10.2307/2964290","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3260571$5F562CBA-8EC7-4C5B-819E-337DCE45E3A4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"97b1cbbc4bbc59378d62dd7a9b623c16e74dfb5d","datavalue":{"value":{"entity-type":"item","numeric-id":200395,"id":"Q200395"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3260571$110FF1DE-54E0-4A39-81D0-3AC7A5FE824C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"6218d42f0175ef35f91c4900eb5db86484a9463d","datavalue":{"value":{"entity-type":"item","numeric-id":2710590,"id":"Q2710590"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3260571$C3F7D3E9-1EC5-4C0B-BECA-3E57E10FF420","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"eff49425df1fb73d895b1b592e51cf569fcdb0bf","datavalue":{"value":{"time":"+1959-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":"Q3260571$A7336C5A-DD8A-4C0E-884F-90EE65ACF23A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"fc83c452823a8e87c48da253723fa63911b6f94c","datavalue":{"value":"3143692","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3260571$DA59E416-E10C-4DF7-8777-2D14ACA1D9E2","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a82faa36e079e9c253f60fdf24799386c02e9e8d","datavalue":{"value":"foundations of mathematics, philosophy, logic","type":"string"},"datatype":"string"},"type":"statement","id":"Q3260571$E251D25A-83DC-4EFE-9258-D7C321500D70","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"4575eecdd2d0fe7a32e403d2a2899f3498be29eb","datavalue":{"value":"Q29392709","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3260571$DAB3E58A-8879-4C5C-B022-83CD887AF58D","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":"Q3260571$9D8B1B08-66D2-4FD4-889D-90660F362117","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"7d989c3f103353df36c537e0be0eb58169972f43","datavalue":{"value":"https://doi.org/10.2307/2964290","type":"string"},"datatype":"url"},"type":"statement","id":"Q3260571$71F97BD6-AAF1-4D0E-8237-8CA30DEFA369","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"9cda83f64b889ddee47e0600bdc06ecbd481af27","datavalue":{"value":"W2127316662","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3260571$58991F75-0FBB-4D76-80B2-A363FE3E0D12","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"d938e2cf16a516c25169e92ed68817a27d01f44d","datavalue":{"value":{"entity-type":"item","numeric-id":5845382,"id":"Q5845382"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3260571$EF42967D-9635-421F-84A3-5485ACF43C3B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Three_theorems_on_recursive_enumeration._I._Decomposition._II._Maximal_set._III._Enumeration_without_duplication"}}}}}