{"entities":{"Q6829992":{"pageid":15119839,"ns":120,"title":"Item:Q6829992","lastrevid":56023123,"modified":"2026-02-26T16:16:12Z","type":"item","id":"Q6829992","labels":{"en":{"language":"en","value":"Tree languages defined in first-order logic with one quantifier alternation"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5313327"}},"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":"Q6829992$197CC4C2-578E-4825-B58D-24C12508B167","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0a9006329b51cae9cf4f21192d837a69f56643b7","datavalue":{"value":{"text":"Tree languages defined in first-order logic with one quantifier alternation","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6829992$43FB7751-33A8-4BC1-A849-8F8464B16268","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"fe0828822fdbd269bf5974c005b32f8a41c28f14","datavalue":{"value":"1170.03019","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829992$B0888C1D-666F-4366-B2EB-44662413E337","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"71c792bc530378fb7cbcc4e42e2f5920330e2d08","datavalue":{"value":"10.1007/978-3-540-70583-3_20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829992$D9C0DCFC-7F70-40E6-A5D8-3BA6D3DC6DB4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4f5b3c3247f723a8dd053286a58f85570c0f08c2","datavalue":{"value":{"entity-type":"item","numeric-id":290907,"id":"Q290907"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829992$084A58BA-5652-4CBB-AB4C-8DBD6595A996","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bf03d46d6c13b138c98e3cc17440d2819249349e","datavalue":{"value":{"entity-type":"item","numeric-id":845666,"id":"Q845666"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829992$FAAA02A4-EE37-41F9-BDB5-750705414E23","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829992$0E65D994-6616-4A69-B0B8-F0BF6514FA69","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"368aedbbcdb07b61d4f2acae84ab7ae3e3751f97","datavalue":{"value":{"time":"+2008-08-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":"Q6829992$4EBB5551-5741-4133-956F-7A9C51ED1C70","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"23f69188d5d49acf6ac7ca8a9c506b86a7234b08","datavalue":{"value":"\\textit{J.-E. Pin} and \\textit{P. Weil} have shown in [``Polynomial closure and unambiguous product'', Theory Comput. Syst. 30, No. 4, 383--422 (1997; Zbl 0872.68119)] that a (word) language is \\(\\Delta_2\\)-definable, in the language of alphabet labels and order, if and only if its syntactic monoid satisfies the identity \\((xy)^\\omega=(xy)^\\omega x(xy)^\\omega\\). Recall that a language is \\(\\Delta_2\\)-definable whenever it can be defined by a \\(\\Sigma_2\\)-formula and by another \\(\\Pi_2\\)-formula. In this paper, the authors show the analogous result for unranked ordered trees and forest languages. For a forest language, a (syntactic) forest algebra is associated, and it is shown that a forest language is definable in \\(\\Delta_2\\), in the language of descending order and label tests, if and only if its syntactic forest algebra satisfies the following two identities:\\N\\N(1) \\(h+g=g+h\\), and (2) \\(v^\\omega wv^\\omega=v^\\omega\\) for \\(w\\preceq v\\).\\N\\NThus, it is decidable whether a forest language can be defined in \\(\\Delta_2\\).\\N\\NFor the entire collection see [Zbl 1141.68001].","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829992$190EA528-E896-4941-96A5-2FEE8B1D4675","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"4bc285a01ee2fee3db93f6df1148b69669dc8b6e","datavalue":{"value":{"entity-type":"item","numeric-id":590045,"id":"Q590045"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829992$4650E6BA-D5A0-4D95-807E-C416B883C328","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"c270fb88a62fde738bd530246c5ba57a005a4efd","datavalue":{"value":"03D05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829992$B7CFC112-5C16-4383-888F-2FDE93C8D9F9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"407654cf92f0702e03297e7fe541e25fa3f13c2d","datavalue":{"value":"03B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829992$D9874E1B-5874-421F-A947-A0B406406B7E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9b78776a56fc28cdd893baa47605a105412b838a","datavalue":{"value":"68Q45","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829992$BF40CB05-E075-4A81-B378-A29E0DF94617","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7a4edb547ddc19fe899a8b3786c7d43a6515868d","datavalue":{"value":"5313327","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829992$F8D7AFB2-04FE-40EA-BE93-F080F787DD22","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":"Q6829992$E8B9A747-8EAC-4F73-AB38-06B7DE453C96","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Tree languages defined in first-order logic with one quantifier alternation","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Tree_languages_defined_in_first-order_logic_with_one_quantifier_alternation"}}}}}