{"id":"https://openalex.org/W2161977620","doi":"https://doi.org/10.1093/jigpal/jzp020","title":"Natural deduction for the finite least fixed point logic with an infinitary rule","display_name":"Natural deduction for the finite least fixed point logic with an infinitary rule","publication_year":2009,"publication_date":"2009-09-14","ids":{"openalex":"https://openalex.org/W2161977620","doi":"https://doi.org/10.1093/jigpal/jzp020","mag":"2161977620"},"language":"en","primary_location":{"id":"doi:10.1093/jigpal/jzp020","is_oa":false,"landing_page_url":"https://doi.org/10.1093/jigpal/jzp020","pdf_url":null,"source":{"id":"https://openalex.org/S2734381524","display_name":"Logic Journal of IGPL","issn_l":"1367-0751","issn":["1367-0751","1368-9894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logic Journal of IGPL","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/A5108098537","display_name":"A. M. Arruda","orcid":null},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"A. M. Arruda","raw_affiliation_strings":["Departamento de Computa\u00e7\u00e3o, Universidade Federal do Cear\u00e1, C.P. 12.166, Fortaleza-CE, Brasil, 60455-970.E-mail: aldufc@gmail.com"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Computa\u00e7\u00e3o, Universidade Federal do Cear\u00e1, C.P. 12.166, Fortaleza-CE, Brasil, 60455-970.E-mail: aldufc@gmail.com","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108482959","display_name":"A. T. Martins","orcid":"https://orcid.org/0009-0008-3374-9719"},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"A. T. Martins","raw_affiliation_strings":["Departamento de Computa\u00e7\u00e3o, Universidade Federal do Cear\u00e1, C.P. 12.166, Fortaleza-CE, Brasil, 60455-970.E-mail: ana@lia.ufc.br"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Computa\u00e7\u00e3o, Universidade Federal do Cear\u00e1, C.P. 12.166, Fortaleza-CE, Brasil, 60455-970.E-mail: ana@lia.ufc.br","institution_ids":["https://openalex.org/I243754102"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15021003,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"5","first_page":"531","last_page":"558"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9987000226974487,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9987000226974487,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9965999722480774,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/soundness","display_name":"Soundness","score":0.7094626426696777},{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.7073334455490112},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.587967574596405},{"id":"https://openalex.org/keywords/structural-proof-theory","display_name":"Structural proof theory","score":0.5613970160484314},{"id":"https://openalex.org/keywords/g\u00f6dels-incompleteness-theorems","display_name":"G\u00f6del's incompleteness theorems","score":0.5608152747154236},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.556513249874115},{"id":"https://openalex.org/keywords/sequent-calculus","display_name":"Sequent calculus","score":0.5339369177818298},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.5151878595352173},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.5071754455566406},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.501863956451416},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49472662806510925},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.48613688349723816},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.4858352839946747},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.4608791172504425},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.4240695536136627},{"id":"https://openalex.org/keywords/second-order-logic","display_name":"Second-order logic","score":0.41605526208877563},{"id":"https://openalex.org/keywords/least-fixed-point","display_name":"Least fixed point","score":0.4128165543079376},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.3866519331932068},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3752129077911377},{"id":"https://openalex.org/keywords/fixed-point-theorem","display_name":"Fixed-point theorem","score":0.27261269092559814},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23365634679794312},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.1738252341747284},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.11776119470596313},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.1172405481338501},{"id":"https://openalex.org/keywords/g\u00f6del","display_name":"G\u00f6del","score":0.1149711012840271},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09639418125152588},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0956677496433258}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7094626426696777},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.7073334455490112},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.587967574596405},{"id":"https://openalex.org/C195653647","wikidata":"https://www.wikidata.org/wiki/Q7625047","display_name":"Structural proof theory","level":4,"score":0.5613970160484314},{"id":"https://openalex.org/C180937797","wikidata":"https://www.wikidata.org/wiki/Q200787","display_name":"G\u00f6del's incompleteness theorems","level":3,"score":0.5608152747154236},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.556513249874115},{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.5339369177818298},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.5151878595352173},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.5071754455566406},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.501863956451416},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49472662806510925},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.48613688349723816},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.4858352839946747},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.4608791172504425},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.4240695536136627},{"id":"https://openalex.org/C144791301","wikidata":"https://www.wikidata.org/wiki/Q1548746","display_name":"Second-order logic","level":4,"score":0.41605526208877563},{"id":"https://openalex.org/C27333817","wikidata":"https://www.wikidata.org/wiki/Q6134913","display_name":"Least fixed point","level":5,"score":0.4128165543079376},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.3866519331932068},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3752129077911377},{"id":"https://openalex.org/C45962547","wikidata":"https://www.wikidata.org/wiki/Q1422068","display_name":"Fixed-point theorem","level":2,"score":0.27261269092559814},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23365634679794312},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.1738252341747284},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.11776119470596313},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.1172405481338501},{"id":"https://openalex.org/C2781302003","wikidata":"https://www.wikidata.org/wiki/Q3294091","display_name":"G\u00f6del","level":2,"score":0.1149711012840271},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09639418125152588},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0956677496433258},{"id":"https://openalex.org/C28642324","wikidata":"https://www.wikidata.org/wiki/Q656176","display_name":"Schauder fixed point theorem","level":4,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C206929604","wikidata":"https://www.wikidata.org/wiki/Q530152","display_name":"Picard\u2013Lindel\u00f6f theorem","level":3,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/jigpal/jzp020","is_oa":false,"landing_page_url":"https://doi.org/10.1093/jigpal/jzp020","pdf_url":null,"source":{"id":"https://openalex.org/S2734381524","display_name":"Logic Journal of IGPL","issn_l":"1367-0751","issn":["1367-0751","1368-9894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logic Journal of IGPL","raw_type":"journal-article"},{"id":"pmh:oai:open-archive.highwire.org:igpl:17/5/481","is_oa":false,"landing_page_url":"http://jigpal.oxfordjournals.org/cgi/content/short/17/5/481","pdf_url":null,"source":{"id":"https://openalex.org/S4406923041","display_name":"HighWire Press Open Archive","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"TEXT"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1488538795","https://openalex.org/W1984581643","https://openalex.org/W2033647831","https://openalex.org/W2036869460","https://openalex.org/W2037682959","https://openalex.org/W2046213250","https://openalex.org/W2090190027","https://openalex.org/W2094568058","https://openalex.org/W2318443385","https://openalex.org/W3127113455"],"related_works":["https://openalex.org/W2401016457","https://openalex.org/W2095663719","https://openalex.org/W1560572178","https://openalex.org/W4287115253","https://openalex.org/W2066585576","https://openalex.org/W3174004139","https://openalex.org/W2130593249","https://openalex.org/W838397816","https://openalex.org/W2057038881","https://openalex.org/W2161977620"],"abstract_inverted_index":{"The":[0,71],"notion":[1],"of":[2,7,22,30,56,67,74,118,132,149,161,170,184,258,266],"the":[3,20,40,54,60,65,130,178,182,256],"least":[4,41],"fixed":[5,36,42],"point":[6,37,43],"an":[8,110,147,175,199,263],"operator":[9],"is":[10,77,94,107,117,165],"widely":[11],"applied":[12],"in":[13,19,129,156,192],"computer":[14],"science":[15],"as,":[16],"for":[17,25,135,144,209,227,234,241,250],"instance,":[18],"context":[21],"query":[23],"languages":[24],"relational":[26],"databases.":[27],"Some":[28],"extensions":[29],"first-order":[31,157,185],"classical":[32],"logic":[33,44,252],"(FOL)":[34],"with":[35,50,174],"operators,":[38],"as":[39,127],"(LFP),":[45],"were":[46],"proposed":[47],"to":[48,53,214,245],"deal":[49],"problems":[51],"related":[52],"expressivity":[55],"FOL.":[57],"LFP":[58,212],"captures":[59],"complexity":[61],"class":[62,66],"PTIME":[63],"over":[64,91,102],"finite":[68,82,92,103,119,215],"ordered":[69],"structures.":[70],"descriptive":[72],"characterization":[73],"computational":[75],"classes":[76],"a":[78,150,168,171,188,205,247,251,278],"central":[79],"issue":[80],"within":[81,255,271],"model":[83],"theory":[84,134,143,249],"(FMT).":[85],"Trahtenbrot's":[86],"theorem":[87],"states":[88],"that":[89,98,113,180],"validity":[90],"models":[93],"not":[95],"recursively":[96],"enumerable,":[97],"is,":[99],"completeness":[100,226],"fails":[101],"models.":[104],"This":[105],"result":[106],"based":[108,166],"on":[109,167],"underlying":[111],"assumption":[112,126],"any":[114],"deductive":[115,239],"system":[116,173,240],"nature.":[120],"However,":[121],"we":[122,196,221,243],"can":[123],"relax":[124],"such":[125],"done":[128],"scope":[131,257],"proof":[133,142,164,172,248],"arithmetic.":[136,158],"Motivated":[137],"by":[138],"G\u00f6del":[139],"incompleteness":[140],"theorems,":[141],"arithmetic":[145,186],"offer":[146],"example":[148],"true":[151],"mathematically":[152],"meaningful":[153],"principle":[154],"non-derivable":[155],"One":[159],"way":[160,265],"presenting":[162],"this":[163,193,237],"definition":[169],"infinitary":[176,200,238],"rule,":[177,194],"\u03c9-rule,":[179],"establishes":[181],"consistency":[183],"through":[187,277],"proof-theoretical":[189,279],"perspective.":[190,280],"Inspired":[191],"here":[195],"will":[197,222],"propose":[198],"natural":[201],"deduction":[202],"system,":[203],"and":[204,211,218,225,229,273],"sequent":[206],"calculus":[207],"version,":[208],"FOL":[210],"restricted":[213],"models,":[216],"FOLfin":[217],"LFPfin,":[219,242],"respectively,":[220],"prove":[223],"soundness":[224],"them":[228],"also":[230,274],"normal":[231],"form":[232],"theorems":[233],"them.":[235],"With":[236],"aim":[244],"present":[246],"traditionally":[253],"investigated":[254],"FMT.":[259],"It":[260],"opens":[261],"up":[262],"alternative":[264],"proving":[267],"results":[268],"already":[269],"obtained":[270],"FMT":[272],"new":[275],"ones":[276]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}