{"entities":{"Q4395565":{"pageid":6425164,"ns":120,"title":"Item:Q4395565","lastrevid":108356543,"modified":"2026-11-06T02:08:28Z","type":"item","id":"Q4395565","labels":{},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1163941"}},"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":"Q4395565$241F242A-FAD6-45B2-98DE-5FB838D050AF","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"83190f1d8aabd3d6302870a2d3c63cd2f05de3aa","datavalue":{"value":"0905.03027","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4395565$CA817392-E174-422D-AF86-0AE1B38FA151","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0c9427e415931a9146c366065f721100d114657c","datavalue":{"value":{"entity-type":"item","numeric-id":598540,"id":"Q598540"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4395565$E62CEC83-DBF9-4E15-BC31-8CABBABE0C25","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6fba0cf8f85f7b1ad95f7e924756131fda6f2c74","datavalue":{"value":{"time":"+1999-02-02T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4395565$F7BD289A-810D-4D8A-B018-FF017D0C4522","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"25e5a5f23d3e2e2c05864da16eda493011c33276","datavalue":{"value":"03C80","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4395565$4D28D9A8-8609-4C36-BC2C-4204CD37D58D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"239a4a174af03c82b61364f762873d53ef0a37ef","datavalue":{"value":"05C90","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4395565$952F9692-C1B9-4559-B128-CE559E8C5207","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"0285678d8ee9d4a5cc73c34865c3f6973f105fe4","datavalue":{"value":"1163941","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4395565$A2B55F62-A7F9-4835-88F8-370811FA7E68","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"101a6d30d7d701a0a5a68dbb2c50165d0cf7e326","datavalue":{"value":"partially ordered quantifier","type":"string"},"datatype":"string"},"type":"statement","id":"Q4395565$3E7112DB-0B1D-4130-97BB-1C5AAF16A926","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f4da53975bbde865a74eadf9560b30f2b822e264","datavalue":{"value":"dependence relation","type":"string"},"datatype":"string"},"type":"statement","id":"Q4395565$D50B0624-4963-4BFF-9AD7-2DF16FC32AEE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"399adc2b99fbd5a462fe5a075abeee3505f518d2","datavalue":{"value":"Mostowski graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q4395565$814567CD-6F97-41F3-8080-C92BB5641F6E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"87126af826260832ed12eb925a4b4df09ab8c3db","datavalue":{"value":"prefixes for branched quantifiers","type":"string"},"datatype":"string"},"type":"statement","id":"Q4395565$069FDB01-FE31-4774-9047-8C7D54259569","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cdac06a25f13da2d47ae34659a5b5753bd9ca729","datavalue":{"value":"operators on prefixes","type":"string"},"datatype":"string"},"type":"statement","id":"Q4395565$9A8178D2-01B7-4B88-BB64-1B0450B6061C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d321d77cbdffb1739345a85fcfe36fdd2a120f02","datavalue":{"value":"normal form operator","type":"string"},"datatype":"string"},"type":"statement","id":"Q4395565$AA15EDE9-FF52-4F99-B984-CE5CCD2C1C18","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":"Q4395565$A043BAE5-77F0-4CA2-B295-FA51356040E5","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0ddecab988e40005dbc1fdea6e35cc74fefc8ef8","datavalue":{"value":{"entity-type":"item","numeric-id":3396588,"id":"Q3396588"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c3fec2ae09404cab7ef8c6305ce931c9e4db3fda","datavalue":{"value":{"amount":"+0.7094938158988953","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":"Q4395565$57BF0628-098D-4E71-8442-C857BE1ED23A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f98632613f597f44c3e846d752075a093b119add","datavalue":{"value":{"entity-type":"item","numeric-id":1361405,"id":"Q1361405"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"192245d45b727fb683c9f6b951057602d315b593","datavalue":{"value":{"amount":"+0.704512357711792","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":"Q4395565$6E955A7C-5ADC-4CB5-B61A-E3A12C33AAF8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"515f548edb0523068dbd41cde2e04ca8da29d031","datavalue":{"value":{"entity-type":"item","numeric-id":4395567,"id":"Q4395567"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"51022740eb1ee15a493bf166124c9a223ad97e9e","datavalue":{"value":{"amount":"+0.7015742659568787","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":"Q4395565$1ACC5673-BF78-49CC-84D2-AD618B2AD737","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"b75d04b4dd447d34ac91578568c31b3c79ae1830","datavalue":{"value":{"entity-type":"item","numeric-id":3496324,"id":"Q3496324"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2604074ba809f2375aae91b36aadcb6a362961a0","datavalue":{"value":{"amount":"+0.695259153842926","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":"Q4395565$B03C1429-11A8-499F-8B84-D0581524D410","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"18738808f2f35a1420c5816bfeab8acf3e1792d7","datavalue":{"value":"The first part of the present paper deals with Mostowski graphs, which are defined as a special case of bipartite graphs. A Mostowski graph \\(M\\) is called disjointly constructible if it is an element of the least class \\(K\\) of Mostowski graphs containing the empty graph and all singleton graphs and being closed under disjoint unions and disjoint directed products. A Mostowski graph \\(M\\) is said to be problem-free iff no subgraph of \\(M\\) is a 5-path or a 6-cycle. Then there holds: Every disjointly constructible \\(M\\in K\\) is problem-free. Every nonempty, connected, problem-free Mostowski graph \\(M\\) with no extreme vertices is the disjoint directed product of two nonempty problem-free Mostowski graphs. Moreover, all problem-free Mostowski graphs are disjointly constructible, and, finally, \\(K\\) is the class of problem-free Mostowski graphs. In the second section, prefixes for branched quantifiers and their relationship to Mostowski graphs are considered. The Mostowski graph \\(M_Q\\) of a prefix \\(Q\\) is defined by the set \\(A_Q\\) of its universally quantified variables, the set \\(E_Q\\) of its existentially quantified variables, and the set \\(D_Q\\) of its pairwise dependencies of existentially quantified variables on earlier universally quantified variables. So, the prefix graphs are exactly the disjointly constructible graphs, hence precisely the problem-free graphs. Defining terms, formulas, subformulas, variables occurring free or bound in a formula and adopting certain deduction rules in a natural way, the author establishes a sequence of useful results for formulas and prefixes. Especially, if the prefixes \\(Q'\\) and \\(Q''\\) are interconvertible, then the corresponding Mostowski graphs coincide. The third section gives attention to a few useful operators on prefixes and states some of their basic properties. The beginning operator, the ending operator, the head operator, the tail operator, and the corresponding residue operators are of main interest. If \\(\\lvdash QA\\leftrightarrow Q'A\\) for every \\(A\\) such that \\(QA\\), \\(Q'A\\) are formulas, then the prefixes \\(Q\\) and \\(Q'\\) are strongly compatible. Defining the vertical normal form operator and the horizontal normal form operator, the author introduces in Section 4 two normal forms for prefixes and proves some important results about such normal forms. The fundamental standardization theorem on the equivalence of the interconvertibility of prefixes \\(Q\\) and \\(Q'\\) and the equality of the corresponding Mostowski graphs \\(M_Q\\) and \\(M_{Q'}\\) is a consequence of the so-called Normal-Form Theorem. The Graph Identity Theorem says that prefixes \\(Q\\) and \\(Q'\\) are equipotent if and only if \\(M_Q= M_{Q'}\\). This finally shows that \\(M_Q\\) contains precisely all essential semantic information about the prefix \\(Q\\). Part 5 deals with other transformations of prefixes by purely semantic means, and Part 6 introduces some concepts intended to revise and extend some ideas related to the comparative logical strength of prefixes. Finally, some open questions are formulated in Section 7. For the entire collection see [Zbl 0885.00035].","type":"string"},"datatype":"string"},"type":"statement","id":"Q4395565$91743A38-58FB-4238-AD45-AEC8BCA3335B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:4395565","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:4395565"}}}}}