{"id":"https://openalex.org/W1967285306","doi":"https://doi.org/10.1007/s00165-004-0035-8","title":"Completeness of a combination of neighbourhood logic and temporal logic","display_name":"Completeness of a combination of neighbourhood logic and temporal logic","publication_year":2004,"publication_date":"2004-04-27","ids":{"openalex":"https://openalex.org/W1967285306","doi":"https://doi.org/10.1007/s00165-004-0035-8","mag":"1967285306"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-004-0035-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-004-0035-8","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-004-0035-8","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-004-0035-8","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055595860","display_name":"Rana Barua","orcid":null},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Rana Barua","raw_affiliation_strings":["Division of Theoretical Statistics and Mathematics, Indian Statistical Institute, 203 B.T. Road, 700 035, Calcutta, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Theoretical Statistics and Mathematics, Indian Statistical Institute, 203 B.T. Road, 700 035, Calcutta, India","institution_ids":["https://openalex.org/I6498739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055595860"],"corresponding_institution_ids":["https://openalex.org/I6498739"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09376179,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"2","first_page":"96","last_page":"103"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.9987999796867371,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/programming-language","display_name":"Programming language","score":0.5999670028686523},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5429584383964539},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5420639514923096},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5344884395599365},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.4545029103755951},{"id":"https://openalex.org/keywords/multimodal-logic","display_name":"Multimodal logic","score":0.44920647144317627},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.44361430406570435},{"id":"https://openalex.org/keywords/g\u00f6dels-completeness-theorem","display_name":"G\u00f6del's completeness theorem","score":0.4226047098636627},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.338487446308136},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3340085744857788},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.29150450229644775},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2374483048915863}],"concepts":[{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5999670028686523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5429584383964539},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5420639514923096},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5344884395599365},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.4545029103755951},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.44920647144317627},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.44361430406570435},{"id":"https://openalex.org/C200116569","wikidata":"https://www.wikidata.org/wiki/Q902052","display_name":"G\u00f6del's completeness theorem","level":2,"score":0.4226047098636627},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.338487446308136},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3340085744857788},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.29150450229644775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2374483048915863},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00165-004-0035-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-004-0035-8","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-004-0035-8","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00165-004-0035-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-004-0035-8","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-004-0035-8","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.699999988079071,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1967285306.pdf","grobid_xml":"https://content.openalex.org/works/W1967285306.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W95860231","https://openalex.org/W1503520919","https://openalex.org/W1506588809","https://openalex.org/W1593278247","https://openalex.org/W1823037702","https://openalex.org/W1978654873","https://openalex.org/W1985777976","https://openalex.org/W2000916035","https://openalex.org/W2024016985","https://openalex.org/W2038569232","https://openalex.org/W2092486735","https://openalex.org/W2093916942","https://openalex.org/W2139891885","https://openalex.org/W2167467151","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2155586249","https://openalex.org/W1507648666","https://openalex.org/W2548795765","https://openalex.org/W2265342114","https://openalex.org/W2146914143","https://openalex.org/W1980003032","https://openalex.org/W1980342609","https://openalex.org/W4253259087","https://openalex.org/W2963355213","https://openalex.org/W2385436975"],"abstract_inverted_index":{"Abstract.":[0],"This":[1,25],"paper":[2],"presents":[3],"a":[4,10,15,18,46],"completeness":[5],"result,":[6],"with":[7],"respect":[8],"to":[9,42],"possible":[11],"world":[12],"semantics,":[13],"for":[14],"combination":[16],"of":[17,35,45],"first-order":[19],"temporal":[20],"logic":[21,26],"and":[22,31],"neighbourhood":[23],"logic.":[24],"was":[27],"considered":[28],"by":[29],"Qiu":[30],"Zhou":[32],"(1998,":[33],"Proceedings":[34],"the":[36],"PROCOMET":[37],"\u201898":[38],",":[39],"pp":[40],"444\u2013461)":[41],"define":[43],"semantics":[44],"real-time":[47],"OCCAM-like":[48],"programming":[49],"language.":[50]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}