{"id":"https://openalex.org/W4379467978","doi":"https://doi.org/10.1017/s1755020323000138","title":"NON-CONTRACTIVE LOGICS, PARADOXES, AND MULTIPLICATIVE QUANTIFIERS","display_name":"NON-CONTRACTIVE LOGICS, PARADOXES, AND MULTIPLICATIVE QUANTIFIERS","publication_year":2023,"publication_date":"2023-06-05","ids":{"openalex":"https://openalex.org/W4379467978","doi":"https://doi.org/10.1017/s1755020323000138"},"language":"en","primary_location":{"id":"doi:10.1017/s1755020323000138","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1755020323000138","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/662293F9A418DFE382C5875BC43AC533/S1755020323000138a.pdf/div-class-title-non-contractive-logics-paradoxes-and-multiplicative-quantifiers-div.pdf","source":{"id":"https://openalex.org/S24077076","display_name":"The Review of Symbolic Logic","issn_l":"1755-0203","issn":["1755-0203","1755-0211"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Review of Symbolic Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/662293F9A418DFE382C5875BC43AC533/S1755020323000138a.pdf/div-class-title-non-contractive-logics-paradoxes-and-multiplicative-quantifiers-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027062828","display_name":"Carlo Nicolai","orcid":"https://orcid.org/0009-0003-1027-5294"},"institutions":[{"id":"https://openalex.org/I4210119896","display_name":"King's College School","ror":"https://ror.org/02bbqcn27","country_code":"GB","type":"education","lineage":["https://openalex.org/I4210119896"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"CARLO NICOLAI","raw_affiliation_strings":["DEPARTMENT OF PHILOSOPHY KING\u2019S COLLEGE, LONDON, UK E-mail:","DEPARTMENT OF PHILOSOPHY KING'S COLLEGE, LONDON, UK E-mail:"],"affiliations":[{"raw_affiliation_string":"DEPARTMENT OF PHILOSOPHY KING\u2019S COLLEGE, LONDON, UK E-mail:","institution_ids":["https://openalex.org/I4210119896"]},{"raw_affiliation_string":"DEPARTMENT OF PHILOSOPHY KING'S COLLEGE, LONDON, UK E-mail:","institution_ids":["https://openalex.org/I4210119896"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033012426","display_name":"Mario Piazza","orcid":null},"institutions":[{"id":"https://openalex.org/I157210198","display_name":"Scuola Normale Superiore","ror":"https://ror.org/03aydme10","country_code":"IT","type":"education","lineage":["https://openalex.org/I157210198"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"MARIO PIAZZA","raw_affiliation_strings":["SCUOLA NORMALE SUPERIORE DI PISA CLASSE DI LETTERE E FILOSOFIA PISA, ITALY E-mail:"],"affiliations":[{"raw_affiliation_string":"SCUOLA NORMALE SUPERIORE DI PISA CLASSE DI LETTERE E FILOSOFIA PISA, ITALY E-mail:","institution_ids":["https://openalex.org/I157210198"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051511391","display_name":"M Tesi","orcid":"https://orcid.org/0000-0001-8773-395X"},"institutions":[{"id":"https://openalex.org/I157210198","display_name":"Scuola Normale Superiore","ror":"https://ror.org/03aydme10","country_code":"IT","type":"education","lineage":["https://openalex.org/I157210198"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"MATTEO TESI","raw_affiliation_strings":["SCUOLA NORMALE SUPERIORE DI PISA CLASSE DI LETTERE E FILOSOFIA PISA, ITALY E-mail:"],"affiliations":[{"raw_affiliation_string":"SCUOLA NORMALE SUPERIORE DI PISA CLASSE DI LETTERE E FILOSOFIA PISA, ITALY E-mail:","institution_ids":["https://openalex.org/I157210198"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033012426"],"corresponding_institution_ids":["https://openalex.org/I157210198"],"apc_list":null,"apc_paid":null,"fwci":0.1777,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54026916,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"17","issue":"4","first_page":"996","last_page":"1017"},"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.9994999766349792,"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.9994999766349792,"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.9984999895095825,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9961000084877014,"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/multiplicative-function","display_name":"Multiplicative function","score":0.7670766115188599},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5599826574325562},{"id":"https://openalex.org/keywords/truth-function","display_name":"Truth function","score":0.5373180508613586},{"id":"https://openalex.org/keywords/logical-connective","display_name":"Logical connective","score":0.5123687982559204},{"id":"https://openalex.org/keywords/quantifier","display_name":"Quantifier (linguistics)","score":0.49008095264434814},{"id":"https://openalex.org/keywords/truth-value","display_name":"Truth value","score":0.4277816414833069},{"id":"https://openalex.org/keywords/zeroth-order-logic","display_name":"Zeroth-order logic","score":0.4159027934074402},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4149141311645508},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3743990659713745},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36886894702911377},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3445082902908325},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.3063586354255676},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2442232370376587},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.22759118676185608},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21840113401412964},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.1649942696094513},{"id":"https://openalex.org/keywords/multimodal-logic","display_name":"Multimodal logic","score":0.06674826145172119},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06556308269500732}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.7670766115188599},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5599826574325562},{"id":"https://openalex.org/C37754750","wikidata":"https://www.wikidata.org/wiki/Q913874","display_name":"Truth function","level":3,"score":0.5373180508613586},{"id":"https://openalex.org/C194989596","wikidata":"https://www.wikidata.org/wiki/Q211790","display_name":"Logical connective","level":2,"score":0.5123687982559204},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.49008095264434814},{"id":"https://openalex.org/C46274116","wikidata":"https://www.wikidata.org/wiki/Q185521","display_name":"Truth value","level":2,"score":0.4277816414833069},{"id":"https://openalex.org/C110039528","wikidata":"https://www.wikidata.org/wiki/Q8069651","display_name":"Zeroth-order logic","level":4,"score":0.4159027934074402},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4149141311645508},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3743990659713745},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36886894702911377},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3445082902908325},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.3063586354255676},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2442232370376587},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.22759118676185608},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21840113401412964},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.1649942696094513},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.06674826145172119},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06556308269500732},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s1755020323000138","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1755020323000138","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/662293F9A418DFE382C5875BC43AC533/S1755020323000138a.pdf/div-class-title-non-contractive-logics-paradoxes-and-multiplicative-quantifiers-div.pdf","source":{"id":"https://openalex.org/S24077076","display_name":"The Review of Symbolic Logic","issn_l":"1755-0203","issn":["1755-0203","1755-0211"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Review of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:ricerca.sns.it:11384/131386","is_oa":true,"landing_page_url":"https://hdl.handle.net/11384/131386","pdf_url":"https://ricerca.sns.it/bitstream/11384/131386/3/Non-contractive%20logics.pdf","source":{"id":"https://openalex.org/S7407050981","display_name":"Scuola Normale Superiore di Pisa","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:openaire/aabd5f9c-0331-451e-b584-561f0563b122","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/aabd5f9c-0331-451e-b584-561f0563b122","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nicolai, C, Piazza, M & Tesi, M 2023, 'Non-contractive logics, paradoxes, and multiplicative quantifiers', Review Of Symbolic Logic. https://doi.org/10.1017/S1755020323000138","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/aabd5f9c-0331-451e-b584-561f0563b122","is_oa":true,"landing_page_url":"https://www.scopus.com/pages/publications/85162143329","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nicolai, C, Piazza, M & Tesi, M 2023, 'Non-contractive logics, paradoxes, and multiplicative quantifiers', Review Of Symbolic Logic. https://doi.org/10.1017/S1755020323000138","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1017/s1755020323000138","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1755020323000138","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/662293F9A418DFE382C5875BC43AC533/S1755020323000138a.pdf/div-class-title-non-contractive-logics-paradoxes-and-multiplicative-quantifiers-div.pdf","source":{"id":"https://openalex.org/S24077076","display_name":"The Review of Symbolic Logic","issn_l":"1755-0203","issn":["1755-0203","1755-0211"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Review of Symbolic Logic","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4379467978.pdf"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1489876977","https://openalex.org/W1570665400","https://openalex.org/W1793763201","https://openalex.org/W1994285343","https://openalex.org/W1996605832","https://openalex.org/W2005982978","https://openalex.org/W2014459135","https://openalex.org/W2024711502","https://openalex.org/W2078225254","https://openalex.org/W2134788346","https://openalex.org/W2623826822","https://openalex.org/W2911865844","https://openalex.org/W2980259917","https://openalex.org/W3168223309","https://openalex.org/W4281696559","https://openalex.org/W4285796864"],"related_works":["https://openalex.org/W2116215193","https://openalex.org/W2368297593","https://openalex.org/W2383907964","https://openalex.org/W2022239108","https://openalex.org/W1504036030","https://openalex.org/W2341651163","https://openalex.org/W1593621129","https://openalex.org/W2130737103","https://openalex.org/W1986625420","https://openalex.org/W4388372734"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"paper":[2],"investigates":[3],"from":[4],"a":[5,58,100,106,110,149],"proof-theoretic":[6],"perspective":[7],"various":[8],"non-contractive":[9],"logical":[10,14],"systems,":[11],"which":[12],"circumvent":[13],"and":[15,27,67],"semantic":[16],"paradoxes.":[17],"Until":[18],"recently,":[19],"such":[20,99],"systems":[21],"only":[22],"displayed":[23],"additive":[24,65],"quantifiers":[25,32,66,124],"(Gri\u0161in":[26],"Cantini).":[28],"Systems":[29],"with":[30,46,64,70,112,159],"multiplicative":[31,84,113,123],"were":[33],"proposed":[34],"in":[35,90],"the":[36,47,77,80,88,119,138,146,153],"2010s":[37],"(Zardini),":[38],"but":[39],"they":[40],"turned":[41],"out":[42],"to":[43,148,152],"be":[44,103,142],"inconsistent":[45],"naive":[48],"rules":[49],"for":[50,61,121],"truth":[51,63],"or":[52],"comprehension.":[53],"We":[54,74],"start":[55],"by":[56,131],"presenting":[57],"first-order":[59],"system":[60,111],"disquotational":[62,127],"compare":[68],"it":[69],"Gri\u0161in":[71],"set":[72],"theory.":[73],"then":[75],"analyze":[76],"reasons":[78],"behind":[79],"inconsistency":[81],"phenomenon":[82],"affecting":[83],"quantifiers.":[85,114],"After":[86],"interpreting":[87],"exponentials":[89],"affine":[91],"logic":[92,101,120,158],"as":[93],"vacuous":[94],"quantifiers,":[95],"we":[96,116],"show":[97],"how":[98],"can":[102,141],"simulated":[104],"within":[105],"truth-free":[107],"fragment":[108],"of":[109,137,156],"Finally,":[115],"establish":[117],"that":[118,133],"these":[122],"(but":[125],"without":[126],"truth)":[128],"is":[129],"consistent,":[130],"proving":[132],"an":[134],"infinitary":[135,157],"version":[136],"cut":[139],"rule":[140],"eliminated.":[143],"This":[144],"paves":[145],"way":[147],"syntactic":[150],"approach":[151],"proof":[154],"theory":[155],"infinite":[160],"sequents.":[161]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}