{"entities":{"Q5944309":{"pageid":8121111,"ns":120,"title":"Item:Q5944309","lastrevid":31370318,"modified":"2024-03-19T17:39:59Z","type":"item","id":"Q5944309","labels":{"en":{"language":"en","value":"Computer science logic. 15th international workshop, CSL 2001, 10th annual conference of the EACSL, Paris, France, September 10--13, 2001. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1653519"}},"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":"Q5944309$CE5D8A32-0A44-49FB-851B-A7A799D0D17A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e0a7ee20b56904ce6eb0c9159f482a9618ba3a9b","datavalue":{"value":{"text":"Computer science logic. 15th international workshop, CSL 2001, 10th annual conference of the EACSL, Paris, France, September 10--13, 2001. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5944309$4DA0341A-2763-4263-A46C-68BAF327D279","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"521a400b5ba74a61a17bfba88dbbf32037c38d6f","datavalue":{"value":"0971.00033","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5944309$B996F06A-E9D4-4941-B9DC-B015A9387062","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"75dce615b90cd8b975a59951014aeaaa27de57d2","datavalue":{"value":"10.1007/3-540-44802-0","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5944309$CEE6B7C7-E909-4511-9F62-DC1135EFDF4D","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":"Q5944309$67CB4D01-E42D-4D23-B84F-59363F1821F2","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6d3e9ce93542d4f996722c3cc295b2a33bb96fb2","datavalue":{"value":{"time":"+2001-10-08T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5944309$3F4FC8B8-434C-4B80-9841-01D1BA2CD4B2","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"f963a18cacd37801bf90297e6e2ece8be13036e6","datavalue":{"value":"The articles of this volume will be reviewed individually. The preceding workshop (14th, 2000) has been reviewed (see Zbl 0944.00037).  Indexed articles:  \\textit{O'Hearn, Peter; Reynolds, John; Yang, Hongseok}, Local reasoning about programs that alter data structures, 1-19 [Zbl 0999.68045]  \\textit{Van den Bussche, Jan}, Applications of Alfred Tarski's ideas in database theory, 20-37 [Zbl 0999.68055]  \\textit{Girard, Jean-Yves}, Locus solum: From the rules of logic to the logic of rules, 38 [Zbl 0999.68545]  \\textit{Kanovich, Max}, The expressive power of Horn monadic linear logic, 39-53 [Zbl 0999.03006]  \\textit{Guglielmi, Alessio; Stra\u00dfburger, Lutz}, Non-commutativity and MELL in the calculus of structures, 54-68 [Zbl 0999.03054]  \\textit{Mogbil, Virgile}, Quadratic correctness criterion for non-commutative logic, 69-83 [Zbl 0999.03055]  \\textit{Chen, Yijia; Shen, Enshao}, Capture complexity by partition, 84-98 [Zbl 0999.68084]  \\textit{Grohe, Martin; W\u00f6hrle, Stefan}, An existential locality theorem, 99-114 [Zbl 0999.03028]  \\textit{Marion, Jean-Yves}, Actual arithmetic and feasibility, 115-129 [Zbl 1005.68039]  \\textit{Schweikardt, Nicole}, The natural order-generic collapse for \\(\\omega\\)-representable databases over the rational and the real ordered group, 130-144 [Zbl 1005.68057]  \\textit{Power, John; Tourlas, Konstantinos}, An algebraic foundation for higraphs, 145-159 [Zbl 0999.68044]  \\textit{Korovina, M. V.; Kudinov, O. V.}, Semantic characterisations of second-order computability over the real numbers, 160-172 [Zbl 0999.03041]  \\textit{Robinson, Edmund; Rosolini, Giuseppe}, An abstract look at realizability, 173-187 [Zbl 0999.03059]  \\textit{Danos, Vincent; Harmer, Russell}, The anatomy of innocence, 188-202 [Zbl 0999.68120]  \\textit{Bezem, Marc}, An improved extensionality criterion for higher-order logic programs, 203-216 [Zbl 0999.68035]  \\textit{St\u00e4rk, Robert F.; Nanchen, Stanislas}, A logic for abstract state machines, 217-231 [Zbl 0999.68122]  \\textit{van Eijck, Jan}, Constrained hyper tableaux, 232-246 [Zbl 0999.03007]  \\textit{Lutz, Carsten; Sattler, Ulrike; Wolter, Frank}, Modal logic and the two-variable fragment, 247-261 [Zbl 0999.03020]  \\textit{Koriche, Fr\u00e9d\u00e9ric}, A logic for approximate first-order reasoning, 262-276 [Zbl 0999.68209]  \\textit{Dawar, A.; Gr\u00e4del, E.; Kreutzer, S.}, Inflationary fixed points in modal logic, 277-291 [Zbl 0999.03019]  \\textit{Alechina, Natasha; Mendler, Michael; de Paiva, Valeria; Ritter, Eike}, Categorical and Kripke semantics for constructive S4 modal logic, 292-307 [Zbl 1005.03024]  \\textit{Rasmussen, Thomas Marthedal}, Labelled natural deduction for interval logics, 308-323 [Zbl 0999.03016]  \\textit{de Boer, Frank S.; van Eijk, Rogier M.}, Decidable navigation logics for object structures, 324-338 [Zbl 0999.03018]  \\textit{Charatonik, Witold; Talbot, Jean-Marc}, The decidability of model checking mobile ambients, 339-354 [Zbl 0999.68123]  \\textit{Galota, Matthias; Vollmer, Heribert}, A generalization of the B\u00fcchi-Elgot-Trakhtenbrot theorem, 355-368 [Zbl 0999.03033]  \\textit{Finkel, Olivier}, An effective extension of the Wagner hierarchy to blind counter automata, 369-383 [Zbl 0999.03034]  \\textit{Klaedtke, Felix}, Decision procedure for an extension of WS1S, 384-398 [Zbl 0999.03035]  \\textit{Akama, Yohji}, Limiting partial combinatory algebras towards infinitary lambda-calculi and classical logic, 399-413 [Zbl 0999.03013]  \\textit{Ronchi Della Rocca, Simona; Roversi, Luca}, Intersection logic, 414-428 [Zbl 0999.03011]  \\textit{Schr\u00f6der, Lutz}, Life without the terminal type, 429-442 [Zbl 0999.03012]  \\textit{Abramsky, Samson; Lenisa, Marina}, Fully complete minimal PER models for the simply typed \\(\\lambda\\)-calculus, 443-457 [Zbl 0999.03010]  \\textit{Martin, Keye}, A principle of induction, 458-468 [Zbl 0999.03025]  \\textit{Baaz, Matthias; Moser, Georg}, On a generalisation of Herbrand's theorem, 469-483 [Zbl 0999.03051]  \\textit{Goubault-Larrecq, Jean}, Well-founded recursive relations, 484-497 [Zbl 0999.68094]  \\textit{Schmidt-Schau\u00df, Manfred}, Stratified context unification is in PSPACE, 498-512 [Zbl 0999.03008]  \\textit{Armando, Alessandro; Ranise, Silvio; Rusinowitch, Micha\u00ebl}, Uniform derivation of decision procedures by superposition, 513-527 [Zbl 1005.03012]  \\textit{Ro\u015fu, Grigore}, Complete categorical equational deduction, 528-538 [Zbl 0999.03060]  \\textit{Ohsaki, Hitoshi}, Beyond regularity: Equational tree automata for associative and commutative theories, 539-553 [Zbl 1002.03032]  \\textit{Courtieu, Pierre}, Normalized types, 554-569 [Zbl 0999.03503]  \\textit{Kopylov, Alexei; Nogin, Aleksey}, Markov's principle for propositional type theory, 570-584 [Zbl 0999.03053]  \\textit{Sch\u00fcrmann, Carsten}, Recursion for higher-order encodings, 585-599 [Zbl 0999.03039]  \\textit{Matthes, Ralph}, Monotone inductive and coinductive constructors of rank 2, 600-614 [Zbl 0999.68037]","type":"string"},"datatype":"string"},"type":"statement","id":"Q5944309$F8E0B44C-5466-4791-9C15-232155FDE671","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5944309$7EE27C4E-BAC7-41EB-A6C0-7DDF47E6098D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5944309$FB5135E8-7A2A-4379-8D67-D3850F9E1469","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f1971b12f93143b2604d15a1750f495d71fae62d","datavalue":{"value":"03-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5944309$EBB0ECF6-9CE3-4EBF-A4E4-EFD2891CAB80","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9510cff643ed4101db67dc00c1556399da46bcb2","datavalue":{"value":"1653519","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5944309$62D642A4-F3D8-4D54-B02F-A750F973B64F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"72f3e15ac9e86afcca52f0008f9a9b51ca2ef38e","datavalue":{"value":"Paris (France)","type":"string"},"datatype":"string"},"type":"statement","id":"Q5944309$53D96A93-B1FC-4983-936A-178E51079454","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q5944309$5ECBC97C-9367-49BD-89AD-B8C77FD62853","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f7c2172f0a2ed6197400daa3f44dae0d79725b1a","datavalue":{"value":"Workshop","type":"string"},"datatype":"string"},"type":"statement","id":"Q5944309$9ECFCCC6-544E-4E7A-A410-9D283EB03559","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d83ae477e518ffecea78688f13a2aaaeca13299","datavalue":{"value":"Conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q5944309$B33D6E0A-05AE-45CD-8F57-9F82F09B652F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a274856a37b02d92e5d2f719dabcc42c1d757ade","datavalue":{"value":"CSL 2001","type":"string"},"datatype":"string"},"type":"statement","id":"Q5944309$84DFDC63-6C62-46B1-9ADF-FA125C725654","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a6071aae134b9a15d114756f15b11190602631d3","datavalue":{"value":"EACSL","type":"string"},"datatype":"string"},"type":"statement","id":"Q5944309$69B73E5E-7050-4EEF-AA3E-B2F3502B3AC8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6e266570abfd2dbb24417bcf760bed9fb5fc2357","datavalue":{"value":"Computer science logic","type":"string"},"datatype":"string"},"type":"statement","id":"Q5944309$A6398F41-3960-42E8-ACE8-23A9D2573864","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":"Q5944309$3B865334-3B53-4B03-934E-CD873C575747","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"e2f064c0ac3a72723bc15b572e8f2bf865793c8a","datavalue":{"value":"https://doi.org/10.1007/3-540-44802-0","type":"string"},"datatype":"url"},"type":"statement","id":"Q5944309$161B1FD9-37D6-411E-B098-731478BBE7DD","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"7ef44f058f6320aac7a3c4e81b749f1d337d2294","datavalue":{"value":"W4240144211","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5944309$9E7127B2-2670-4D9C-A453-6E308D3D0322","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:5944309","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:5944309"}}}}}