{"id":"https://openalex.org/W7155046864","doi":"https://doi.org/10.48550/arxiv.2604.18403","title":"Nested Sequents for Horn-Characterizable Quantified Modal Logics with Equality via Reachability Rules","display_name":"Nested Sequents for Horn-Characterizable Quantified Modal Logics with Equality via Reachability Rules","publication_year":2026,"publication_date":"2026-04-20","ids":{"openalex":"https://openalex.org/W7155046864","doi":"https://doi.org/10.48550/arxiv.2604.18403"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.18403","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.18403","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.18403","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045993299","display_name":"Tim S. Lyon","orcid":"https://orcid.org/0000-0003-3214-0828"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lyon, Tim S.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5080616827","display_name":"Eugenio Orlandelli","orcid":"https://orcid.org/0000-0002-4021-8667"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Orlandelli, Eugenio","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045993299"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.7935000061988831,"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.7935000061988831,"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.10670000314712524,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.029500000178813934,"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/sequent","display_name":"Sequent","score":0.7878999710083008},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6262000203132629},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.45170000195503235},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.4287000000476837},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.4239000082015991},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.42239999771118164},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.41040000319480896},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.3822999894618988},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.37940001487731934}],"concepts":[{"id":"https://openalex.org/C89421646","wikidata":"https://www.wikidata.org/wiki/Q843632","display_name":"Sequent","level":2,"score":0.7878999710083008},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6262000203132629},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5256999731063843},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.45170000195503235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43059998750686646},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.4287000000476837},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4239000082015991},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.42239999771118164},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.41040000319480896},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3905999958515167},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.3822999894618988},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3804999887943268},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.37940001487731934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36570000648498535},{"id":"https://openalex.org/C103000020","wikidata":"https://www.wikidata.org/wiki/Q1978426","display_name":"Nested set model","level":3,"score":0.35499998927116394},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.3490000069141388},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.3294000029563904},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.32510000467300415},{"id":"https://openalex.org/C2777680557","wikidata":"https://www.wikidata.org/wiki/Q7259417","display_name":"Pullback","level":2,"score":0.31790000200271606},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.30880001187324524},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C111404639","wikidata":"https://www.wikidata.org/wiki/Q376166","display_name":"Cut-elimination theorem","level":4,"score":0.2897000014781952},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C114092440","wikidata":"https://www.wikidata.org/wiki/Q840226","display_name":"Normal modal logic","level":4,"score":0.2766999900341034},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.25940001010894775}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.18403","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.18403","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.18403","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.18403","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,66,166,194],"introduce":[1],"cut-free":[2],"nested":[3,72,97,129,152,205,214],"sequent":[4,73,98],"systems":[5,99,153,206,215],"for":[6,154],"a":[7,128,139,175,189],"broad":[8],"class":[9],"of":[10,43,71,79,95,103,171,177,184],"quantified":[11],"modal":[12],"logics":[13],"(QMLs).":[14],"The":[15],"QMLs":[16,45,155,218],"we":[17],"consider":[18],"are":[19,133],"semantically":[20,156],"defined":[21],"using":[22,160],"relational":[23],"models":[24,159],"that":[25,197],"assign":[26],"both":[27,161],"an":[28],"inner":[29,162],"and":[30,55,64,150,163,187],"outer":[31,164,221],"domain":[32,90],"to":[33,74,147,216],"each":[34],"world.":[35],"This":[36,142],"rich":[37],"model":[38],"structure":[39],"enables":[40],"the":[41,68,88,101,145,168,182,198,208],"specification":[42],"various":[44],"by":[46,108,117,138,158],"enforcing":[47],"different":[48],"frame":[49],"conditions,":[50],"including":[51],"increasing,":[52],"decreasing,":[53],"constant,":[54],"empty":[56],"domains,":[57],"as":[58,60,135],"well":[59],"general":[61],"path":[62],"conditions":[63],"seriality.":[65],"extend":[67],"usual":[69],"notion":[70],"include":[75],"signatures,":[76],"i.e.,":[77],"multisets":[78],"terms,":[80],"which":[81,212],"let":[82],"us":[83],"naturally":[84],"define":[85],"rules":[86,106,115],"capturing":[87],"aforementioned":[89],"conditions.":[91],"A":[92],"distinctive":[93],"feature":[94],"our":[96],"is":[100,144],"use":[102],"reachability":[104],"rules--inference":[105],"parameterized":[107],"formal":[109],"grammars":[110],"(viz.,":[111],"semi-Thue":[112],"systems).":[113],"These":[114],"operate":[116],"propagating":[118],"or":[119,122],"consuming":[120],"formulae":[121],"terms":[123],"along":[124],"certain":[125],"paths":[126,132],"within":[127],"sequent,":[130],"where":[131],"encoded":[134],"strings":[136],"generated":[137],"parameterizing":[140],"grammar.":[141],"paper":[143],"first":[146],"provide":[148],"sound":[149],"complete":[151],"characterized":[157],"domains.":[165,222],"analyze":[167],"proof-theoretic":[169],"properties":[170],"these":[172],"systems,":[173],"identify":[174],"number":[176],"admissible":[178],"structural":[179],"rules,":[180,186],"establish":[181],"invertibility":[183],"all":[185],"prove":[188],"non-trivial":[190],"syntactic":[191],"cut-elimination":[192],"theorem.":[193],"also":[195],"observe":[196],"standard":[199],"universal":[200],"quantifier":[201],"rule":[202],"used":[203],"in":[204],"subsumes":[207],"Extended":[209],"Barcan":[210],"Rule,":[211],"forces":[213],"capture":[217],"with":[219],"constant":[220]},"counts_by_year":[],"updated_date":"2026-04-29T09:16:38.111599","created_date":"2026-04-22T00:00:00"}