{"entities":{"Q1373997":{"pageid":1384737,"ns":120,"title":"Item:Q1373997","lastrevid":67270443,"modified":"2026-04-12T16:30:09Z","type":"item","id":"Q1373997","labels":{"en":{"language":"en","value":"Foundations of computer science. Potential, theory, cognition"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1092362"}},"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":"Q1373997$BDD0F7CE-54D5-453B-8407-1D0A7063CEC8","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f90a2ce57fc49a52be86146be16d0400ad72f1fc","datavalue":{"value":{"text":"Foundations of computer science. Potential, theory, cognition","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1373997$4AB8F020-53FA-42A6-A509-E2AE420B27D5","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"f8f5413e74383722baed054e5ae225de99ee6090","datavalue":{"value":"0877.00007","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1373997$8EFA7D9D-314B-4AB0-A22E-DDA37B8F1B80","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":"Q1373997$9AD7DB69-63C5-4C3A-B7BB-4D504A93C5DE","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e1e5dd463aa4d0314ca2a1cf8e190d7a60ad0624","datavalue":{"value":{"time":"+1997-11-27T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1373997$4CB71808-611A-4FAF-AC63-3BABBF7F4600","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"73e80fef0c57e6ffa4b45c8b6bb3884fdcb5d225","datavalue":{"value":"The articles of mathematical interest will be reviewed individually.  Indexed articles:  \\textit{Bauer, F. L.}, The might of formulas and their limits, 1-8 [Zbl 1126.00304]  \\textit{Mateescu, Alexandru; Rozenberg, Grzegorz; Salomaa, Arto}, Syntactic and semantic aspects of parallelism, 79-105 [Zbl 0887.68057]  \\textit{Kupka, Ingbert}, Unique fixpoints in complete lattices with applications to formal languages and semantics, 107-115 [Zbl 0883.06004]  \\textit{Karner, Georg; Kuich, Werner}, On abstract families of languages, power series, and elements, 117-124 [Zbl 0887.68058]  \\textit{Lange, Klaus-J\u00f6rn}, Are there formal languages complete for \\(\\text{SymSPACE}(\\log n)\\)?, 125-134 [Zbl 0887.68059]  \\textit{Jantzen, Matthias}, On twist-colored trios: A new morphic characterization of r.e. sets, 135-142 [Zbl 0887.68060]  \\textit{Esparza, J.; Rossmanith, P.}, An automata approach to some problems on context-free grammars, 143-152 [Zbl 0895.68085]  \\textit{Culik, Karel; Kari, Jarkko}, On aperiodic sets of Wang tiles, 153-162 [Zbl 0883.05035]  \\textit{Jenner, Birgit}, Closure under complementation of logspace complexity classes. A survey, 163-175 [Zbl 0887.68037]  \\textit{Kirsig, Bernd}, A relation between sparse and printable sets in \\(\\text{NSPACE}(\\log n)\\), 177-184 [Zbl 0885.68068]  \\textit{Weihrauch, Klaus}, A foundation for computable analysis, 185-199 [Zbl 0896.03033]  \\textit{Ehrig, H.; Padberg, J.}, A uniform approach to Petri nets, 219-231 [Zbl 0887.68076]  \\textit{Kiehn, Astrid}, Observing partial order runs of Petri nets, 233-238 [Zbl 0887.68077]  \\textit{Meseguer, Jos\u00e9; Montanari, Ugo; Sassone, Vladimiro}, Representation theorems for Petri nets, 239-249 [Zbl 0885.68115]  \\textit{Diekert, Volker}, A remark on trace equations, 251-260 [Zbl 0898.68057]  \\textit{Kindler, Ekkart; Reisig, Wolfgang}, Verification of distributed algorithms with algebraic Petri nets, 261-270 [Zbl 0899.68058]  \\textit{Daduna, Hans}, Discrete time analysis of a state dependent tandem with different customer types, 287-296 [Zbl 0887.60086]  \\textit{Hotz, G\u00fcnter; Wu, Hongzhong}, On the arrangement complexity of uniform trees, 337-350 [Zbl 0889.94015]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1373997$054C8288-096C-4482-8BA0-51811483411B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"342a6161f41187e2c595daa41b09cee10ab1ace9","datavalue":{"value":"00B15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1373997$499BA079-1868-4306-9554-971DDFD96734","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1373997$93E1EE6B-7AA0-4AE5-852C-2EF3C8B66CAC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4530fa8f7f9eb0c9ebb69dd13d7ac4aae7abeae1","datavalue":{"value":"1092362","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1373997$997D3B3E-8C4C-40BA-B592-1853883CCC9F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fa78ad5518ca246bcf12a7a95d0f4aea27c592e5","datavalue":{"value":"Computer science","type":"string"},"datatype":"string"},"type":"statement","id":"Q1373997$72961AD2-D487-4FB1-B674-7756377344B9","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":"Q1373997$5E4F4A08-5F0C-4381-BEEB-1E0AD2697116","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"596168de63941cf7693240ada101ca60c1a6d124","datavalue":{"value":"Q56067102","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1373997$FD266533-CFEE-4FEB-8DFA-1F8067644E06","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"7b7e2bc23e01d1569cafa4f0907189f8cd4cbb69","datavalue":{"value":"https://doi.org/10.1007/bfb0052071","type":"string"},"datatype":"url"},"type":"statement","id":"Q1373997$2D06BBC1-C225-4506-B225-26B14D29D671","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"9d90ef28c3b0b629d7b34a4ad830aec293350938","datavalue":{"value":"W2485675973","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1373997$A3FC870C-29AD-492D-8A51-1CD0F9DC891D","rank":"normal"}],"P1635":[{"mainsnak":{"snaktype":"value","property":"P1635","hash":"a4bda7b385bcc9e0aee69f09a60022834b3c6890","datavalue":{"value":"conf/birthday/1997brauer","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1373997$EC3705E6-7927-4014-B68A-F50EBB89E089","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"2dbfc4437dbfb44efcd846143735a7fd8b88e45e","datavalue":{"value":"10.1007/BFB0052071","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1373997$1B4FACC4-4A51-4ADE-A700-048EA686E0A1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Foundations of computer science. Potential, theory, cognition","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Foundations_of_computer_science._Potential,_theory,_cognition"}}}}}