{"entities":{"Q2537127":{"pageid":2547870,"ns":120,"title":"Item:Q2537127","lastrevid":78857894,"modified":"2026-05-06T12:35:54Z","type":"item","id":"Q2537127","labels":{"en":{"language":"en","value":"The strong decidability of cut logics. II. Generalizations"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3299732"}},"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":"Q2537127$CB7635F4-AEBD-4984-B526-19CBE04276F1","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a6765e4093ba32ca01611bd790de37737aa382fa","datavalue":{"value":{"text":"The strong decidability of cut logics. II. Generalizations","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2537127$A827FF34-F2F5-4A7B-BA5F-4AD476C42639","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"d264711fac1f34461a40a405a7ac4759bf903070","datavalue":{"value":"0188.02801","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2537127$DEB9D6E8-35D2-4086-B78C-B3363D3D1FA0","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"6325d9f59cde8ebbdb24a9f950cab3fcef3decf6","datavalue":{"value":{"entity-type":"item","numeric-id":190248,"id":"Q190248"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2537127$7EF9529E-0FD4-43A3-8CC6-8E64D0C5A17D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"652ad65ffdd573691be68fbfe67aa0cdf6812549","datavalue":{"value":{"time":"+1971-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":"Q2537127$B101B36D-27CE-4738-9E88-782C1242215B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"407654cf92f0702e03297e7fe541e25fa3f13c2d","datavalue":{"value":"03B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2537127$F55DAAEF-6C95-422A-86F1-3E984DAE7ED7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d2aeb4fd8c17f01d078d901ff89f700b5878dcb3","datavalue":{"value":"3299732","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2537127$B0ADD3A1-F876-4427-A601-1EBD38A192B2","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f441ca3826c2a626abc1e33f52cef18dbfcee6b1","datavalue":{"value":"recursion theory, constructive mathematics","type":"string"},"datatype":"string"},"type":"statement","id":"Q2537127$12094952-C3B5-42D0-ACCD-E6C1E078D3B1","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4b8f662030bbf0728e1f0fd9338d320ff5a55994","datavalue":{"value":{"entity-type":"item","numeric-id":1211979,"id":"Q1211979"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2537127$EB760712-4245-4BF5-A47A-D9B95B9D10BC","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":"Q2537127$FDD00643-DACD-4ACD-87DD-191478B2D1C4","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"dfc2a9280f274b681d6f0be8c512a807c8f6edd0","datavalue":{"value":"https://doi.org/10.1305/ndjfl/1093894363","type":"string"},"datatype":"url"},"type":"statement","id":"Q2537127$B6785C48-223F-4289-9933-B64A6F9B9527","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"a33dc2e458b6b6a7d55cb70747c86d35d2c00b80","datavalue":{"value":"W2029509025","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2537127$524BA4C0-1A4C-4C95-ACBB-0AC9BFECCA03","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ad941bd845a5694d30288149e0d8aeb3973639c7","datavalue":{"value":"10.1305/NDJFL/1093894363","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2537127$01CD881C-ACA0-440A-AC25-35C65328E4B1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The strong decidability of cut logics. II. Generalizations","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_strong_decidability_of_cut_logics._II._Generalizations"}}}}}