{"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":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"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.25264644,"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":[{"score":0.5899999737739563,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"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,15,42,67,74,109,116,142,158],"beginning":[5],"and":[6,24,123],"end":[9],"of":[10,17,41,45,54,71,76,111,153,157,160],"a":[11,22,37,72,77,102],"theoretical":[12],"construction.":[13],"If":[14,59],"meaning":[16],"words":[18],"is":[19,34,64,85],"not":[20],"fixed":[21],"proposition":[23,84],"its":[25,46,52,80],"negation":[26,110],"can":[27,105],"both":[28],"be":[29],"true.":[30],"And,":[31],"as":[32,66,164],"it":[33,108],"well":[35],"known,":[36],"theory":[38,73],"in":[39,87,107,151],"spite":[40,152],"axiomatic":[43],"fixation":[44],"concepts":[47],"must":[48,162],"contain":[49,146],"inconsistencies":[50],"if":[51],"means":[53],"expression":[55],"are":[56],"sufficiently":[57],"rich.":[58],"classical-but":[60],"also":[61],"intuitionistic-propositional":[62],"logic":[63,95,118],"used":[65],"basic":[68],"logical":[69,98,147],"frame":[70],"deduction":[75],"contradiction":[78,103,161],"produces":[79],"complete":[81],"trivialization:":[82],"every":[83,112],"deducible":[86],"it,":[88],"ex":[89],"falso":[90],"sequitur":[91],"quodlbet.":[92],"The":[93],"minimal":[94],"avoids":[96],"this":[97,139],"principle":[99,159],"but":[100],"from":[101],"we":[104],"deduce":[106],"proposition.":[113],"By":[114,141],"weakening":[115],"classical":[117],"S.":[119],"Jaskowski":[120],"(c/.":[121],"[6])":[122],"specially":[124],"Newton":[125],"C.":[126],"A.":[127],"da":[128],"Costa":[129],"have":[130],"built":[131],"propositional":[132],"calculi":[133],"which":[134,149],"enable":[135],"us":[136],"to":[137],"overcome":[138],"difficulty.":[140],"way":[143],"these":[144],"systems":[145],"laws":[148],"Hegelians":[150],"their":[154],"famous":[155],"rejection":[156],"acknowledge":[163],"valid.":[165]},"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":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}