{"entities":{"Q579237":{"pageid":581004,"ns":120,"title":"Item:Q579237","lastrevid":62922858,"modified":"2026-04-11T09:00:42Z","type":"item","id":"Q579237","labels":{"en":{"language":"en","value":"On n-equivalence of binary trees"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4014683"}},"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":"Q579237$C1874E1E-91F7-448C-929B-B95EC34C9862","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"65c57b802c46f4d1d8c4718e6581c5cd7b84429a","datavalue":{"value":{"text":"On n-equivalence of binary trees","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q579237$9F4041D0-67C4-4B77-8AAE-62DEC64211D2","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c06af64caf90dbf5e0372f586a75b4ede3dec4a0","datavalue":{"value":"0625.03013","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q579237$E0C804BE-4DE5-463B-93F3-3BD56CAAC508","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"70ecc260075ee1599934d252f5b5017b5aa41542","datavalue":{"value":{"entity-type":"item","numeric-id":579236,"id":"Q579236"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q579237$E7F018F9-C70D-489F-9645-63ADD9853AC8","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":"Q579237$8BD0F1B3-DF45-46F7-966C-528465BE500F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5ae48c61eed19d1e1e1f33f9255d5b329362d064","datavalue":{"value":{"time":"+1987-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":"Q579237$7FB1E813-A339-459C-8062-C6205399B25C","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"a945c3e0f380963a451ada32451e67d4212fbd5c","datavalue":{"value":"The paper contains a simple characterization of the binary trees which satisfy the same first-order sentences of quantifier depth n as the binary tree with one root whose branches all have length m (for all n and m). It follows immediately that, e.g., ``finiteness'' is not a first- order property of binary trees. The proof employs the Ehrenfeucht game.","type":"string"},"datatype":"string"},"type":"statement","id":"Q579237$C3EE2B43-DFA0-4051-9899-E7AB6E6B3E8F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"176e47af9f9e7cf4ebff07fc1f9e4f94a83134c1","datavalue":{"value":"03C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q579237$36F122E7-C7CB-42AD-B357-9C429401555E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b58df756e27df0e7b4d6d54dbbfd9015b563e63d","datavalue":{"value":"03C13","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q579237$880E5532-E6CF-4FC0-A2D4-93717B5D6779","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"6bc68fdb72eda783db87ef0277cbbfb4c760cdbc","datavalue":{"value":"06A12","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q579237$AA3406B3-BD00-4A39-BABF-E97E68A2F650","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5da87a72c21717089feda882f568938059a9d84","datavalue":{"value":"05C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q579237$6542B98F-DEB5-47FA-BBAD-B1631604B8DA","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d2148b483953ff59a72a3d38bd8ff10d7894b82a","datavalue":{"value":"4014683","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q579237$785D0490-E273-47B7-906C-466F89A3C910","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6f22279097c6d85cb4f7d769b454b07d77e45151","datavalue":{"value":"quantifier depth n-equivalence","type":"string"},"datatype":"string"},"type":"statement","id":"Q579237$6BFB9766-C88D-4588-9B68-69E44CE47885","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1cfab7320641965853a62ff5e5c00f87e266c99b","datavalue":{"value":"binary trees","type":"string"},"datatype":"string"},"type":"statement","id":"Q579237$F245A492-5EBF-478F-8737-AA9304BEEDAB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6cd206901b4266f658c5dc3df6b773506e3b5992","datavalue":{"value":"first-order sentences of quantifier depth n","type":"string"},"datatype":"string"},"type":"statement","id":"Q579237$1EE276CE-59B4-4AFD-8870-314E2C3B0EAE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f66ac1238aba41ed60334d6cbd0154ced56b0bfd","datavalue":{"value":"Ehrenfeucht game","type":"string"},"datatype":"string"},"type":"statement","id":"Q579237$35E5E1A2-88AB-4461-BAF8-73BC205DF5E2","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":"Q579237$47BB638F-532F-4A37-890E-AD3A8204B9CD","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"0de45aba9344dc004ed9003f7ae4eafac6d38e21","datavalue":{"value":"https://doi.org/10.1305/ndjfl/1093636941","type":"string"},"datatype":"url"},"type":"statement","id":"Q579237$B0A46B08-FC53-48F1-A3E7-3A284A8C074E","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"4952b451a14e1f5a928d100d53341a309a6164fc","datavalue":{"value":"W2066680155","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q579237$BC69684D-EB1D-452E-A008-67555A3ECF33","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7b60aae990e851b57e39cfe06fdd93f57e1e6e0c","datavalue":{"value":"10.1305/NDJFL/1093636941","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q579237$4200D1A9-105E-4DE5-8991-54EFD1F847D7","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"063470da879cd356ac1d191604fcda747cc3e800","datavalue":{"value":{"entity-type":"item","numeric-id":5436997,"id":"Q5436997"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6267984bf6dc9e44a762a03b0e214c832decba44","datavalue":{"value":{"amount":"+0.7855023741722107","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q579237$7EE83E60-48C1-4885-B0DC-541B9C5DB7C6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f4cee908fde155c78cbf8a62e18bfafe8de7f7ee","datavalue":{"value":{"entity-type":"item","numeric-id":3787513,"id":"Q3787513"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"257589b0dc769cdad53d21e802dbd01e8fc453ef","datavalue":{"value":{"amount":"+0.7745791673660278","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q579237$C5E6E8B1-EDCD-43D3-A1F8-6447ADCF6D71","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e6bd10261465b2f01c5b476a9cc1fd05d4121404","datavalue":{"value":{"entity-type":"item","numeric-id":3758818,"id":"Q3758818"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"97e5a0e07e8c5304a06edc0e6304b295dfef99cf","datavalue":{"value":{"amount":"+0.7737105488777161","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q579237$7F667A08-0727-46F3-8E3E-3CE7BF7A5790","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3db84ace2e45176688dec886ecdbd223d9e798d6","datavalue":{"value":{"entity-type":"item","numeric-id":5096727,"id":"Q5096727"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"71056865609c7ae1bf8fa9f0233a4dc67d67c607","datavalue":{"value":{"amount":"+0.7678050398826599","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q579237$DC29F3E7-36CB-4D91-A539-D003FA0C3948","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a3872718480c33feef9cb471cc19a8487acc9f04","datavalue":{"value":{"entity-type":"item","numeric-id":4941910,"id":"Q4941910"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"843d15404af14ce4631f831a0ce844df22106400","datavalue":{"value":{"amount":"+0.766714870929718","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q579237$6DD54E23-EB2C-46C2-B7A2-6F17485292E3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On n-equivalence of binary trees","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_n-equivalence_of_binary_trees"}}}}}