{"id":"https://openalex.org/W2102374640","doi":"https://doi.org/10.1017/s0960129507006123","title":"Natural deduction via graphs: formal definition and computation rules","display_name":"Natural deduction via graphs: formal definition and computation rules","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2102374640","doi":"https://doi.org/10.1017/s0960129507006123","mag":"2102374640"},"language":"en","primary_location":{"id":"doi:10.1017/s0960129507006123","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129507006123","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071639019","display_name":"Herman Geuvers","orcid":"https://orcid.org/0000-0003-2522-2980"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"HERMAN GEUVERS","raw_affiliation_strings":["Radboud University Nijmegen, Institute for Computing and Information Sciences, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands Email:","Radboud University Nijmegen, Institute for Computing and Information Sciences, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands Email: H.Geuvers@cs.ru.nl"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Radboud University Nijmegen, Institute for Computing and Information Sciences, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands Email:","institution_ids":["https://openalex.org/I145872427"]},{"raw_affiliation_string":"Radboud University Nijmegen, Institute for Computing and Information Sciences, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands Email: H.Geuvers@cs.ru.nl","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037096385","display_name":"Iris Loeb","orcid":null},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"IRIS LOEB","raw_affiliation_strings":["Radboud University Nijmegen, Institute for Computing and Information Sciences, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands Email:","Radboud University Nijmegen#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Radboud University Nijmegen, Institute for Computing and Information Sciences, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands Email:","institution_ids":["https://openalex.org/I145872427"]},{"raw_affiliation_string":"Radboud University Nijmegen#TAB#","institution_ids":["https://openalex.org/I145872427"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071639019"],"corresponding_institution_ids":["https://openalex.org/I145872427"],"apc_list":null,"apc_paid":null,"fwci":1.9369,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.88362685,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"17","issue":"3","first_page":"485","last_page":"526"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9828000068664551,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.8353761434555054},{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.5940472483634949},{"id":"https://openalex.org/keywords/sequent-calculus","display_name":"Sequent calculus","score":0.554737389087677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5213974118232727},{"id":"https://openalex.org/keywords/formalism","display_name":"Formalism (music)","score":0.48738986253738403},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45280081033706665},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42475777864456177},{"id":"https://openalex.org/keywords/curry\u2013howard-correspondence","display_name":"Curry\u2013Howard correspondence","score":0.41590258479118347},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3616507053375244},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.10794416069984436}],"concepts":[{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.8353761434555054},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.5940472483634949},{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.554737389087677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5213974118232727},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.48738986253738403},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45280081033706665},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42475777864456177},{"id":"https://openalex.org/C85343465","wikidata":"https://www.wikidata.org/wiki/Q975734","display_name":"Curry\u2013Howard correspondence","level":3,"score":0.41590258479118347},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3616507053375244},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.10794416069984436},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C558565934","wikidata":"https://www.wikidata.org/wiki/Q2743","display_name":"Musical","level":2,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s0960129507006123","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129507006123","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/44fd5925-2434-4c6e-b57b-e6d504723acd","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/44fd5925-2434-4c6e-b57b-e6d504723acd","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Geuvers, J H & Loeb, I 2007, 'Natural deduction via graphs : formal definition and computation rules', Mathematical Structures in Computer Science, vol. 17, no. 3, pp. 485-526. https://doi.org/10.1017/S0960129507006123","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:repository.ubn.ru.nl:2066/36267","is_oa":false,"landing_page_url":"http://hdl.handle.net/2066/36267","pdf_url":null,"source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Structures in Computer Science, 17, 3, pp. 485-526","raw_type":"Article / Letter to editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/44fd5925-2434-4c6e-b57b-e6d504723acd","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/44fd5925-2434-4c6e-b57b-e6d504723acd","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Structures in Computer Science, 17(3), 485 - 526. Cambridge University Press","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1487251594","https://openalex.org/W1498613637","https://openalex.org/W1553954213","https://openalex.org/W1557413548","https://openalex.org/W1595139175","https://openalex.org/W1995338553","https://openalex.org/W2064236106","https://openalex.org/W2120076632","https://openalex.org/W2155268922","https://openalex.org/W2294530123","https://openalex.org/W2911865844","https://openalex.org/W4301438234"],"related_works":["https://openalex.org/W2023557900","https://openalex.org/W2617588251","https://openalex.org/W2154098055","https://openalex.org/W2137780954","https://openalex.org/W2753667555","https://openalex.org/W2270243227","https://openalex.org/W1566344352","https://openalex.org/W2056025285","https://openalex.org/W3081507517","https://openalex.org/W2075337691"],"abstract_inverted_index":{"In":[0],"this":[1,27,140],"paper,":[2],"we":[3,112,142,165,199],"introduce":[4],"the":[5,44,76,81,85,90,94,119,145,179,205],"formalism":[6,28],"of":[7,13,26,64,75,78,96,103,121,139,147,162,181,187,195],"deduction":[8,18,53,104,128,182],"graphs":[9,54,129],"as":[10,31],"a":[11,69,100,136,160,168,171,192],"generalisation":[12],"both":[14,56],"Gentzen\u2013Prawitz":[15],"style":[16,21],"natural":[17,37,196],"and":[19,58,87,89,123,198],"Fitch":[20],"flag":[22,33,48],"deduction.":[23],"The":[24,152,184],"advantage":[25],"is":[29,50,73,149],"that,":[30],"with":[32,107,174],"deductions":[34,49],"(but":[35],"not":[36],"deduction),":[38],"subproofs":[39],"can":[40],"be":[41],"shared,":[42],"but":[43],"linearisation":[45],"used":[46],"in":[47],"avoided.":[51],"Our":[52],"have":[55],"nodes":[57,65,86],"boxes":[59],",":[60],"which":[61],"are":[62],"collections":[63],"that":[66,144,176],"also":[67,166,190],"form":[68],"node":[70],"themselves.":[71],"This":[72],"reminiscent":[74],"bigraphs":[77],"Milner,":[79],"where":[80],"link":[82],"graph":[83,92],"describes":[84,93],"edges":[88],"place":[91],"nesting":[95],"nodes.":[97],"We":[98],"give":[99],"precise":[101],"definition":[102],"graphs,":[105],"together":[106],"some":[108,202],"illustrative":[109],"examples.":[110],"Furthermore,":[111],"analyse":[113],"their":[114],"computational":[115],"behaviour":[116],"by":[117,124],"studying":[118],"process":[120,146],"cut-elimination":[122,148],"defining":[125],"translations":[126],"from":[127],"to":[130,154,170],"simply":[131],"typed":[132],"lambda":[133],"terms.":[134],"From":[135],"slight":[137],"variation":[138],"translation,":[141],"conclude":[143],"strongly":[150],"normalising.":[151],"translation":[153,169],"simple":[155],"type":[156],"theory":[157],"removes":[158],"quite":[159],"lot":[161],"structure,":[163],"so":[164],"propose":[167],"context":[172],"calculus":[173],"lets":[175],"faithfully":[177],"captures":[178],"structure":[180],"graphs.":[183],"proof":[185],"nets":[186],"linear":[188],"logic":[189],"offer":[191],"graph-like":[193],"presentation":[194],"deduction,":[197],"point":[200],"out":[201],"similarities":[203],"between":[204],"two":[206],"formalisms.":[207]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}