{"id":"https://openalex.org/W1965171814","doi":"https://doi.org/10.1305/ndjfl/1040248461","title":"Decidability and Completeness for Open Formulas of Membership Theories","display_name":"Decidability and Completeness for Open Formulas of Membership Theories","publication_year":1995,"publication_date":"1995-04-01","ids":{"openalex":"https://openalex.org/W1965171814","doi":"https://doi.org/10.1305/ndjfl/1040248461","mag":"1965171814"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1040248461","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040248461","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-2/Decidability-and-Completeness-for-Open-Formulas-of-Membership-Theories/10.1305/ndjfl/1040248461.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-36/issue-2/Decidability-and-Completeness-for-Open-Formulas-of-Membership-Theories/10.1305/ndjfl/1040248461.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072832124","display_name":"Dorella Bell\u00e9","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dorella Bell\u00e8","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055139955","display_name":"Franco Parlamento","orcid":"https://orcid.org/0000-0003-1430-960X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Franco Parlamento","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072832124"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.521,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.60150678,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"36","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9991999864578247,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9991999864578247,"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.9975000023841858,"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.9771000146865845,"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/decidability","display_name":"Decidability","score":0.8346710801124573},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8121707439422607},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.7877209186553955},{"id":"https://openalex.org/keywords/extensionality","display_name":"Extensionality","score":0.7631898522377014},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.646241307258606},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.5398880839347839},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47084781527519226},{"id":"https://openalex.org/keywords/axiom-of-choice","display_name":"Axiom of choice","score":0.4677655100822449},{"id":"https://openalex.org/keywords/zermelo\u2013fraenkel-set-theory","display_name":"Zermelo\u2013Fraenkel set theory","score":0.43778547644615173},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.42013880610466003},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.4156104624271393},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.34481263160705566},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.14269721508026123},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08724555373191833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08148038387298584}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8346710801124573},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8121707439422607},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.7877209186553955},{"id":"https://openalex.org/C150355047","wikidata":"https://www.wikidata.org/wiki/Q965432","display_name":"Extensionality","level":2,"score":0.7631898522377014},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.646241307258606},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.5398880839347839},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47084781527519226},{"id":"https://openalex.org/C151797676","wikidata":"https://www.wikidata.org/wiki/Q179692","display_name":"Axiom of choice","level":4,"score":0.4677655100822449},{"id":"https://openalex.org/C51460","wikidata":"https://www.wikidata.org/wiki/Q191849","display_name":"Zermelo\u2013Fraenkel set theory","level":5,"score":0.43778547644615173},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.42013880610466003},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.4156104624271393},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.34481263160705566},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.14269721508026123},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08724555373191833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08148038387298584},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1040248461","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040248461","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-2/Decidability-and-Completeness-for-Open-Formulas-of-Membership-Theories/10.1305/ndjfl/1040248461.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/1040248461","is_oa":false,"landing_page_url":"https://projecteuclid.org/euclid.ndjfl/1040248461","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/1040248461","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1040248461","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-36/issue-2/Decidability-and-Completeness-for-Open-Formulas-of-Membership-Theories/10.1305/ndjfl/1040248461.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":[{"id":"https://metadata.un.org/sdg/10","score":0.6000000238418579,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1965171814.pdf","grobid_xml":"https://content.openalex.org/works/W1965171814.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1538623678","https://openalex.org/W1975061069","https://openalex.org/W1977107423","https://openalex.org/W1999607653","https://openalex.org/W2005661612","https://openalex.org/W2026387431","https://openalex.org/W2077162222","https://openalex.org/W2087640143","https://openalex.org/W2101118111"],"related_works":["https://openalex.org/W4233243512","https://openalex.org/W1574825745","https://openalex.org/W2082808755","https://openalex.org/W2016661762","https://openalex.org/W2280660603","https://openalex.org/W4287555623","https://openalex.org/W3112595056","https://openalex.org/W1587633197","https://openalex.org/W2152801202","https://openalex.org/W1529641503"],"abstract_inverted_index":{"We":[0],"establish":[1,67],"the":[2,10,17,21,25,43,54,58,68,77,85,90,96,108],"decidability,":[3],"with":[4,14,70],"respect":[5,71],"to":[6,35,51,72,102],"open":[7],"formulas":[8],"in":[9],"first":[11],"order":[12],"language":[13],"equality":[15],"=,":[16],"membership":[18],"relation":[19],"$\\in$,":[20],"constant":[22],"$\\emptyset$":[23,62],"for":[24,61],"empty":[26],"set,":[27],"and":[28,40,63,89,94],"a":[29],"binary":[30],"operation":[31],"w":[32],"which,":[33],"applied":[34],"any":[36],"two":[37],"sets":[38],"x":[39],"y,":[41],"yields":[42],"results":[44],"of":[45,53,76,95],"adding":[46,84,101],"y":[47],"as":[48],"an":[49],"element":[50],"x,":[52],"theory":[55,78,97],"NW":[56,82,103],"having":[57],"obvious":[59],"axioms":[60],"w.":[64],"Furthermore":[65],"we":[66],"completeness":[69],"purely":[73],"universal":[74],"sentences":[75],"$\\mbox{NW}+\\mbox{E}+\\mbox{R}$,":[79],"obtained":[80,99],"from":[81],"by":[83,100],"Extensionality":[86],"Axiom":[87,92,110],"E":[88],"Regularity":[91],"R,":[93],"$\\mbox{NW}+\\mbox{AFA}'$":[98],"(a":[104],"slight":[105],"variant":[106],"of)":[107],"Antifoundation":[109],"AFA.":[111]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}