{"id":"https://openalex.org/W2089552973","doi":"https://doi.org/10.1305/ndjfl/1093893524","title":"Propositional sequence-calculi for inconsistent systems.","display_name":"Propositional sequence-calculi for inconsistent systems.","publication_year":1968,"publication_date":"1968-10-01","ids":{"openalex":"https://openalex.org/W2089552973","doi":"https://doi.org/10.1305/ndjfl/1093893524","mag":"2089552973"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093893524","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093893524","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-9/issue-4/Propositional-sequence-calculi-for-inconsistent-systems/10.1305/ndjfl/1093893524.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-9/issue-4/Propositional-sequence-calculi-for-inconsistent-systems/10.1305/ndjfl/1093893524.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043484740","display_name":"Andr\u00e9s Raggio","orcid":"https://orcid.org/0000-0003-4802-7758"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andr\u00e9s R. Raggio","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5043484740"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.25879044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"9","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9230999946594238,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9230999946594238,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9140999913215637,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9133999943733215,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6585253477096558},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5215442180633545},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.38276830315589905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3320419490337372},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.32927167415618896},{"id":"https://openalex.org/keywords/medicine","display_name":"Medicine","score":0.22664320468902588},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.05097615718841553}],"concepts":[{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6585253477096558},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5215442180633545},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.38276830315589905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3320419490337372},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.32927167415618896},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.22664320468902588},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.05097615718841553},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093893524","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093893524","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-9/issue-4/Propositional-sequence-calculi-for-inconsistent-systems/10.1305/ndjfl/1093893524.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1093893524","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093893524","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":{"id":"doi:10.1305/ndjfl/1093893524","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093893524","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-9/issue-4/Propositional-sequence-calculi-for-inconsistent-systems/10.1305/ndjfl/1093893524.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.5899999737739563,"display_name":"Reduced inequalities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320997","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","ror":"https://ror.org/02ddkpn78"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2089552973.pdf","grobid_xml":"https://content.openalex.org/works/W2089552973.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W1483568252","https://openalex.org/W2149346202"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596"],"abstract_inverted_index":{"Contradictions":[0],"arise":[1],"mostly":[2],"at":[3,7],"the":[4,8,14,40,64,71,105,111,135,151,192,241,246,251],"beginning":[5],"and":[6,23,117,190],"end":[9],"of":[10,16,39,43,52,68,73,107,146,150,153,164,219,237,245],"a":[11,21,35,69,74,98,162,227,255,265],"theoretical":[12],"construction.If":[13],"meaning":[15],"words":[17],"is":[18,32,61,82],"not":[19,177],"fixed":[20],"proposition":[22,81],"its":[24,44,50,77],"negation":[25,106],"can":[26,101],"both":[27],"be":[28],"true.And,":[29],"as":[30,63,157],"it":[31,104],"well":[33],"known,":[34],"theory":[36,70],"in":[37,84,103,144],"spite":[38,145],"axiomatic":[41],"fixation":[42],"concepts":[45],"must":[46,155],"contain":[47,139],"inconsistencies":[48],"if":[49],"means":[51],"expression":[53],"are":[54,212],"sufficiently":[55],"rich.If":[56],"classical-but":[57],"also":[58,276],"intuitionistic-propositional":[59],"logic":[60,91,113],"used":[62],"basic":[65],"logical":[66,94,140],"frame":[67],"deduction":[72],"contradiction":[75,99,154],"produces":[76],"complete":[78],"trivialization:":[79],"every":[80,108],"deducible":[83],"it,":[85],"ex":[86],"falso":[87],"sequitur":[88],"quodl\u03afbet.The":[89],"minimal":[90],"avoids":[92],"this":[93,133,185,195],"principle":[95,152],"but":[96],"from":[97,215],"we":[100,199,224],"deduce":[102],"proposition.By":[109],"weakening":[110],"classical":[112],"S.":[114],"Jaskowski":[115],"(c/.[6])":[116],"specially":[118],"Newton":[119],"C.":[120],"A.":[121],"da":[122,278],"Costa":[123,159,279],"have":[124,225],"built":[125,161],"propositional":[126,165],"calculi":[127,166,239],"which":[128,142,198,211,268],"enable":[129],"us":[130,270],"to":[131,183,271],"overcome":[132],"difficulty.By":[134],"way":[136],"these":[137,222,273],"systems":[138],"laws":[141],"Hegelians":[143],"their":[147],"famous":[148],"rejection":[149],"acknowledge":[156],"valid.Da":[158],"has":[160,176],"hierarchy":[163,197,229],"C":[167,247],"n":[168,171,205,231,234],"(l":[169,232],"^":[170,172,204,206,233],"\u03c9)":[173,207,236],"whose":[174],"decidability":[175],"been":[178],"settled":[179],"yet.We":[180],"tried":[181],"first":[182],"solve":[184],"problem":[186],"constructing":[187],"equivalent":[188],"sequence-calculi":[189],"proving":[191],"corresponding":[193],"cut-theorems.But":[194],"new":[196,228],"called":[200],"CG":[201],"W":[202],"(1":[203],"showed":[208],"some":[209],"restrictions":[210,223],"only":[213],"justified":[214],"an":[216],"intuitionistic":[217],"point":[218],"view.By":[220],"dropping":[221],"constructed":[226],"WG":[230],"<":[235],"decidable":[238],"with":[240],"same":[242],"essential":[243],"properties":[244],"w":[248],".**We":[249],"thank":[250,275],"\"Fundacao":[252],"de":[253,259],"Amaparo":[254],"Pesquisa":[256],"do":[257],"Estado":[258],"Sao":[260],"Paulo\"":[261],"(FAPESP,":[262],"Brazil)":[263],"for":[264,280],"research":[266],"grant":[267],"enabled":[269],"start":[272],"investigations.We":[274],"Prof,":[277],"his":[281],"interest.":[282]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}