{"id":"https://openalex.org/W2025894783","doi":"https://doi.org/10.2168/lmcs-8(1:20)2012","title":"Theorem proving for prenex G\\\"odel logic with Delta: checking validity and unsatisfiability","display_name":"Theorem proving for prenex G\\\"odel logic with Delta: checking validity and unsatisfiability","publication_year":2012,"publication_date":"2012-03-06","ids":{"openalex":"https://openalex.org/W2025894783","doi":"https://doi.org/10.2168/lmcs-8(1:20)2012","mag":"2025894783"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-8(1:20)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:20)2012","pdf_url":"https://lmcs.episciences.org/833/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/833/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035315045","display_name":"Matthias Baaz","orcid":"https://orcid.org/0000-0002-7815-2501"},"institutions":[{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Matthias Baaz","raw_affiliation_strings":["Department of Discrete Mathematics and Geometry, TU Vienna"],"raw_orcid":"https://orcid.org/0000-0002-7815-2501","affiliations":[{"raw_affiliation_string":"Department of Discrete Mathematics and Geometry, TU Vienna","institution_ids":["https://openalex.org/I2799411422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086733054","display_name":"Agata Ciabattoni","orcid":"https://orcid.org/0000-0001-6947-8772"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Agata Ciabattoni","raw_affiliation_strings":["Department of Computer Languages, TU Vienna"],"raw_orcid":"https://orcid.org/0000-0001-6947-8772","affiliations":[{"raw_affiliation_string":"Department of Computer Languages, TU Vienna","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048207102","display_name":"Christian G. Ferm\u00fcller","orcid":"https://orcid.org/0000-0003-2932-5477"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Christian G Ferm\u00fcller","raw_affiliation_strings":["Department of Computer Languages, TU Vienna"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Languages, TU Vienna","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035315045"],"corresponding_institution_ids":["https://openalex.org/I2799411422"],"apc_list":null,"apc_paid":null,"fwci":0.8843,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79324454,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"Volume 8, Issue 1","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.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9988999962806702,"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/soundness","display_name":"Soundness","score":0.5268681645393372},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5175008773803711},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.5152831077575684},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5044430494308472},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.48233291506767273},{"id":"https://openalex.org/keywords/translation","display_name":"Translation (biology)","score":0.4563685953617096},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4532538056373596},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4410625696182251},{"id":"https://openalex.org/keywords/forward-chaining","display_name":"Forward chaining","score":0.4401005208492279},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.42076554894447327},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38461416959762573},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3402332067489624},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3298951983451843},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1141507625579834},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08846312761306763}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.5268681645393372},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5175008773803711},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.5152831077575684},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5044430494308472},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.48233291506767273},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.4563685953617096},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4532538056373596},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4410625696182251},{"id":"https://openalex.org/C142614401","wikidata":"https://www.wikidata.org/wiki/Q777433","display_name":"Forward chaining","level":3,"score":0.4401005208492279},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.42076554894447327},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38461416959762573},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3402332067489624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3298951983451843},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1141507625579834},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08846312761306763},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C58328972","wikidata":"https://www.wikidata.org/wiki/Q184609","display_name":"Expert system","level":2,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C105580179","wikidata":"https://www.wikidata.org/wiki/Q188928","display_name":"Messenger RNA","level":3,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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":"doi:10.2168/lmcs-8(1:20)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:20)2012","pdf_url":"https://lmcs.episciences.org/833/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1202.6352","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1202.6352","pdf_url":"https://arxiv.org/pdf/1202.6352","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:9edcb3f60c4b492086133bf1edba5e86","is_oa":true,"landing_page_url":"https://doaj.org/article/9edcb3f60c4b492086133bf1edba5e86","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 8, Issue 1 (2012)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-8(1:20)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:20)2012","pdf_url":"https://lmcs.episciences.org/833/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.4699999988079071,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G3304142654","display_name":null,"funder_award_id":"Y544-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G6002603989","display_name":null,"funder_award_id":"START Y544-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320338080","display_name":"European Social Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2025894783.pdf","grobid_xml":"https://content.openalex.org/works/W2025894783.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W114846694","https://openalex.org/W129461275","https://openalex.org/W1544409518","https://openalex.org/W1546296649","https://openalex.org/W1552843312","https://openalex.org/W1605633286","https://openalex.org/W1611875164","https://openalex.org/W1843829875","https://openalex.org/W1964353152","https://openalex.org/W1971043428","https://openalex.org/W1982983300","https://openalex.org/W1985274317","https://openalex.org/W1991500340","https://openalex.org/W1999997889","https://openalex.org/W2011526622","https://openalex.org/W2015175446","https://openalex.org/W2027752737","https://openalex.org/W2037330115","https://openalex.org/W2065869391","https://openalex.org/W2082736027","https://openalex.org/W2096482476","https://openalex.org/W2110182592","https://openalex.org/W2129156376","https://openalex.org/W2140826798","https://openalex.org/W2142202556","https://openalex.org/W2572761669","https://openalex.org/W2735780516","https://openalex.org/W4250746159","https://openalex.org/W6679021602"],"related_works":["https://openalex.org/W2272231869","https://openalex.org/W47107507","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W2963044240"],"abstract_inverted_index":{"G\\\"odel":[0],"logic":[1],"with":[2],"the":[3,22,25,77,84],"projection":[4],"operator":[5],"Delta":[6],"(G_Delta)":[7],"is":[8],"an":[9],"important":[10],"many-valued":[11],"as":[12,14],"well":[13],"intermediate":[15],"logic.":[16],"In":[17],"contrast":[18],"to":[19,34,63,75],"classical":[20],"logic,":[21],"validity":[23,67],"and":[24],"satisfiability":[26,83],"problems":[27,46],"of":[28,44,56,70,79],"G_Delta":[29],"are":[30],"not":[31],"directly":[32],"dual":[33],"each":[35],"other.":[36],"We":[37],"nevertheless":[38],"provide":[39],"a":[40,68,87],"uniform,":[41],"computational":[42],"treatment":[43],"both":[45],"for":[47],"prenex":[48],"formulas":[49],"by":[50],"describing":[51],"appropriate":[52],"translations":[53],"into":[54],"sets":[55],"order":[57],"clauses":[58],"that":[59],"can":[60],"be":[61],"subjected":[62],"chaining":[64],"resolution.":[65],"For":[66,82],"version":[69],"Herbrand's":[71],"Theorem":[72],"allows":[73],"us":[74],"show":[76],"soundness":[78],"standard":[80],"Skolemization.":[81],"translation":[85],"involves":[86],"novel,":[88],"extended":[89],"Skolemization":[90],"method.":[91]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}