{"id":"https://openalex.org/W2252339295","doi":"https://doi.org/10.4230/lipics.csl.2015.648","title":"Binding Forms in First-Order Logic","display_name":"Binding Forms in First-Order Logic","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2252339295","doi":"https://doi.org/10.4230/lipics.csl.2015.648","mag":"2252339295"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5444","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.648","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.648","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052215915","display_name":"Fabio Mogavero","orcid":"https://orcid.org/0000-0002-5140-5783"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Mogavero, Fabio","raw_affiliation_strings":["University of Naples Federico II, Naples, Italy"],"affiliations":[{"raw_affiliation_string":"University of Naples Federico II, Naples, Italy","institution_ids":["https://openalex.org/I71267560"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066350298","display_name":"Giuseppe Perelli","orcid":"https://orcid.org/0000-0002-8687-6323"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Perelli, Giuseppe","raw_affiliation_strings":["University of Naples Federico II, Naples, Italy"],"affiliations":[{"raw_affiliation_string":"University of Naples Federico II, Naples, Italy","institution_ids":["https://openalex.org/I71267560"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052215915"],"corresponding_institution_ids":["https://openalex.org/I71267560"],"apc_list":null,"apc_paid":null,"fwci":1.7258,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.88832581,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"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.9998000264167786,"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.9998000264167786,"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.9993000030517578,"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.9984999895095825,"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/decidability","display_name":"Decidability","score":0.6937633752822876},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6010375022888184},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.5723355412483215},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.5419940948486328},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.5235016942024231},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.5151985287666321},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4282896816730499},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4250005781650543},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4227692484855652},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4191182851791382},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.41631802916526794},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4131048619747162},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.41284799575805664},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.398686945438385},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3581255078315735},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.35664576292037964},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.1782025694847107},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16464892029762268},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.1310880482196808},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1301577389240265}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6937633752822876},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6010375022888184},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.5723355412483215},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.5419940948486328},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.5235016942024231},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.5151985287666321},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4282896816730499},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4250005781650543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4227692484855652},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4191182851791382},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.41631802916526794},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4131048619747162},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.41284799575805664},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.398686945438385},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3581255078315735},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.35664576292037964},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.1782025694847107},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16464892029762268},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.1310880482196808},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1301577389240265},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:5444","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.648","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:iris.uniroma1.it:11573/1403141","is_oa":true,"landing_page_url":"http://hdl.handle.net/11573/1403141","pdf_url":"http://hdl.handle.net/11573/1403141","source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":"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/conferenceObject"},{"id":"doi:10.4230/lipics.csl.2015.648","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.csl.2015.648","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5444","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.648","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.46000000834465027}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309590","display_name":"Universit\u00e0 degli Studi di Napoli Federico II","ror":"https://ror.org/05290cv24"},{"id":"https://openalex.org/F4320311030","display_name":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","ror":"https://ror.org/01vx64p53"},{"id":"https://openalex.org/F4320334079","display_name":"Gruppo Nazionale per il Calcolo Scientifico","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W42015762","https://openalex.org/W97887531","https://openalex.org/W117467870","https://openalex.org/W143925898","https://openalex.org/W155864463","https://openalex.org/W193724012","https://openalex.org/W304604758","https://openalex.org/W313985849","https://openalex.org/W1482193060","https://openalex.org/W1483892218","https://openalex.org/W1484845602","https://openalex.org/W1502739147","https://openalex.org/W1503647529","https://openalex.org/W1524668325","https://openalex.org/W1525083854","https://openalex.org/W1535051955","https://openalex.org/W1549008998","https://openalex.org/W1558081775","https://openalex.org/W1558832481","https://openalex.org/W1566513654","https://openalex.org/W1572719204","https://openalex.org/W1600958215","https://openalex.org/W1606726879","https://openalex.org/W1960494084","https://openalex.org/W1968968780","https://openalex.org/W1989783863","https://openalex.org/W1991981864","https://openalex.org/W1996065564","https://openalex.org/W2033647831","https://openalex.org/W2043507528","https://openalex.org/W2048905609","https://openalex.org/W2083030304","https://openalex.org/W2086470346","https://openalex.org/W2088094394","https://openalex.org/W2108947407","https://openalex.org/W2123817118","https://openalex.org/W2123858323","https://openalex.org/W2124580444","https://openalex.org/W2151784388","https://openalex.org/W2168868617","https://openalex.org/W2173945384","https://openalex.org/W2261579031","https://openalex.org/W2263859483","https://openalex.org/W2325116448","https://openalex.org/W2337480916","https://openalex.org/W2559113132","https://openalex.org/W2913682003","https://openalex.org/W2914576081","https://openalex.org/W2963093365","https://openalex.org/W2988119170","https://openalex.org/W3037251419"],"related_works":["https://openalex.org/W3037251419","https://openalex.org/W2914576081","https://openalex.org/W2996054020","https://openalex.org/W3100064989","https://openalex.org/W2240048967","https://openalex.org/W1971727793","https://openalex.org/W1708959509","https://openalex.org/W2045554431","https://openalex.org/W2971036089","https://openalex.org/W2103653758","https://openalex.org/W2991296087","https://openalex.org/W2098086155","https://openalex.org/W1549008998","https://openalex.org/W2530320023","https://openalex.org/W2626086289","https://openalex.org/W110471801","https://openalex.org/W2625290595","https://openalex.org/W3101316517","https://openalex.org/W2992863903","https://openalex.org/W3042291487"],"abstract_inverted_index":{"Aiming":[0],"to":[1,51],"pinpoint":[2],"the":[3,6,30,41,43,65,73,86,89,107,116],"reasons":[4],"behind":[5],"decidability":[7],"of":[8,12,23,32,45,60,68],"some":[9],"complex":[10],"extensions":[11],"modal":[13],"logic,":[14,25],"we":[15,56],"propose":[16],"a":[17,46,52,58,99],"new":[18],"classification":[19],"criterion":[20],"for":[21],"sentences":[22],"first-order":[24,82],"which":[26],"is":[27,77],"based":[28],"on":[29,40,64],"kind":[31],"binding":[33],"forms":[34],"admitted":[35],"in":[36,85,124],"their":[37],"expressions,":[38],"i.e.,":[39],"way":[42],"arguments":[44],"relation":[47],"can":[48],"be":[49],"bound":[50],"variable.":[53],"In":[54],"particular,":[55],"describe":[57],"hierarchy":[59],"four":[61],"fragments":[62],"focused":[63],"Boolean":[66],"combinations":[67],"these":[69],"forms,":[70],"showing":[71],"that":[72,103],"less":[74],"expressive":[75],"one":[76],"already":[78],"incomparable":[79],"with":[80],"several":[81],"limitations":[83],"proposed":[84],"literature,":[87],"as":[88],"guarded":[90],"and":[91,112,119,126],"unary":[92],"negation":[93],"fragments.":[94],"We":[95],"also":[96],"prove,":[97],"via":[98],"novel":[100],"model-theoretic":[101],"technique,":[102],"our":[104],"logic":[105],"enjoys":[106],"finite-model":[108],"property,":[109],"Craig's":[110],"interpolation,":[111],"Beth's":[113],"definability.":[114],"Furthermore,":[115],"associated":[117],"model-checking":[118],"satisfiability":[120],"problems":[121],"are":[122],"solvable":[123],"PTime":[125],"Sigma_3^P,":[127],"respectively.":[128]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":4}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}