{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:36:07Z","timestamp":1753889767351,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2008,3,31]],"date-time":"2008-03-31T00:00:00Z","timestamp":1206921600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/assumed-1991-2003"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We introduce `atomic flows': they are graphs obtained from derivations by\ntracing atom occurrences and forgetting the logical structure. We study simple\nmanipulations of atomic flows that correspond to complex reductions on\nderivations. This allows us to prove, for propositional logic, a new and very\ngeneral normalisation theorem, which contains cut elimination as a special\ncase. We operate in deep inference, which is more general than other syntactic\nparadigms, and where normalisation is more difficult to control. We argue that\natomic flows are a significant technical advance for normalisation theory,\nbecause 1) the technique they support is largely independent of syntax; 2)\nindeed, it is largely independent of logical inference rules; 3) they\nconstitute a powerful geometric formalism, which is more intuitive than syntax.<\/jats:p>","DOI":"10.2168\/lmcs-4(1:9)2008","type":"journal-article","created":{"date-parts":[[2008,6,3]],"date-time":"2008-06-03T13:27:58Z","timestamp":1212499678000},"source":"Crossref","is-referenced-by-count":12,"title":["Normalisation Control in Deep Inference via Atomic Flows"],"prefix":"10.46298","volume":"Volume 4, Issue 1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7234-2347","authenticated-orcid":false,"given":"Alessio","family":"Guglielmi","sequence":"first","affiliation":[]},{"given":"Tom","family":"Gundersen","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2008,3,31]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1081\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1081\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:03:00Z","timestamp":1681243380000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,31]]},"references-count":0,"URL":"https:\/\/doi.org\/10.2168\/lmcs-4(1:9)2008","relation":{"is-same-as":[{"id-type":"arxiv","id":"0709.1205","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.0709.1205","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2008,3,31]]},"article-number":"1081"}}