{"entities":{"Q6654467":{"pageid":14265624,"ns":120,"title":"Item:Q6654467","lastrevid":100192106,"modified":"2026-06-05T21:35:09Z","type":"item","id":"Q6654467","labels":{"en":{"language":"en","value":"Why propositional quantification makes modal logics on trees robustly hard?"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7959674"}},"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":"Q6654467$47FED4AB-7008-404E-A43F-4F600084E29D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"2c2334456658a812cda15f3115b36a24d054e085","datavalue":{"value":{"text":"Why propositional quantification makes modal logics on trees robustly hard?","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6654467$61A3D4A6-B304-48DC-B863-BE0080C47654","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"f9c1e49065ecf3df4ddde172b7d2e9d3d19e8baf","datavalue":{"value":"10.5555/3470152.3470154","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6654467$63B882D6-BDC9-4A8A-A947-C57A8687C73D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"1fd1e780c6b9d32de1062017625c6e21a121a467","datavalue":{"value":{"entity-type":"item","numeric-id":2007733,"id":"Q2007733"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6654467$82D9ACA2-2670-4503-9959-8CE53DEA5235","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"487657d41a3727080d9cf416d12bed060ca6cc64","datavalue":{"value":{"entity-type":"item","numeric-id":213235,"id":"Q213235"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6654467$35D5F9B1-DB58-4B90-9A87-10B737073CF4","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4e986e57a46b356e61a6b4db9acbb203ad87efab","datavalue":{"value":{"time":"+2024-12-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6654467$F538D1A5-E42E-4553-B63E-26B25C34F0A0","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"7cfff2e3b7f009b69ae82e4aa296ae1902bd02ff","datavalue":{"value":"68Q60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6654467$81609555-F26F-4EF0-BC2F-435193DD2580","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"74a6cec96241e450625296e63e8dd539239d7104","datavalue":{"value":"03B45","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6654467$B9D33544-8398-4F15-B2FD-846E37272519","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"dceb03284631440826561a5960685592e41d62a9","datavalue":{"value":"7959674","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6654467$23A000DF-AD46-48C1-993F-3B7A45C70F0B","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":"Q6654467$07C1508C-16FB-4497-9ACA-2F778B7A0C99","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Why propositional quantification makes modal logics on trees robustly hard?","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Why_propositional_quantification_makes_modal_logics_on_trees_robustly_hard%3F"}}}}}