{"id":"https://openalex.org/W2146907658","doi":"https://doi.org/10.1093/logcom/exs041","title":"Complexity for probability logic with quantifiers over propositions","display_name":"Complexity for probability logic with quantifiers over propositions","publication_year":2012,"publication_date":"2012-09-18","ids":{"openalex":"https://openalex.org/W2146907658","doi":"https://doi.org/10.1093/logcom/exs041","mag":"2146907658"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exs041","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exs041","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006401614","display_name":"Stanislav O. Speranski","orcid":"https://orcid.org/0000-0001-6386-5632"},"institutions":[{"id":"https://openalex.org/I188973947","display_name":"Novosibirsk State University","ror":"https://ror.org/04t2ss102","country_code":"RU","type":"education","lineage":["https://openalex.org/I188973947"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"S. O. Speranski","raw_affiliation_strings":["Novosibirsk State University, 2 Pirogova St., 630090, Novosibirsk, Russian FederationE-mail: katze.tail@gmail.com"],"affiliations":[{"raw_affiliation_string":"Novosibirsk State University, 2 Pirogova St., 630090, Novosibirsk, Russian FederationE-mail: katze.tail@gmail.com","institution_ids":["https://openalex.org/I188973947"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006401614"],"corresponding_institution_ids":["https://openalex.org/I188973947"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":1.2844,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.84091789,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"23","issue":"5","first_page":"1035","last_page":"1055"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9983999729156494,"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.9983999729156494,"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.9973000288009644,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9887999892234802,"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/undecidable-problem","display_name":"Undecidable problem","score":0.8237264156341553},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6031249165534973},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.601090133190155},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5650181770324707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5558086633682251},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38244345784187317},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3691655993461609},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3144683539867401},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.14941629767417908}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8237264156341553},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6031249165534973},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.601090133190155},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5650181770324707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5558086633682251},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38244345784187317},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3691655993461609},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3144683539867401},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.14941629767417908},{"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/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.1093/logcom/exs041","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exs041","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W40029885","https://openalex.org/W251225716","https://openalex.org/W983961703","https://openalex.org/W1526328753","https://openalex.org/W1540715591","https://openalex.org/W1551616634","https://openalex.org/W1553142094","https://openalex.org/W1556453281","https://openalex.org/W1565385188","https://openalex.org/W1822097810","https://openalex.org/W1965552673","https://openalex.org/W1972643432","https://openalex.org/W1974802461","https://openalex.org/W1978292968","https://openalex.org/W1980102547","https://openalex.org/W1999428129","https://openalex.org/W2015376829","https://openalex.org/W2038868921","https://openalex.org/W2062879749","https://openalex.org/W2105505307","https://openalex.org/W2107308446","https://openalex.org/W2126239092","https://openalex.org/W2129318326","https://openalex.org/W2169250070","https://openalex.org/W2530006810","https://openalex.org/W2798461040","https://openalex.org/W4205973993","https://openalex.org/W4206797071"],"related_works":["https://openalex.org/W2120230527","https://openalex.org/W1536365843","https://openalex.org/W2125797022","https://openalex.org/W1490819493","https://openalex.org/W1802268423","https://openalex.org/W1993963635","https://openalex.org/W4252689011","https://openalex.org/W1497573972","https://openalex.org/W2071659383","https://openalex.org/W1846253165"],"abstract_inverted_index":{"In":[0],"the":[1,4,12,19,27,40,43,49,53,57],"present":[2],"article,":[3],"quantifiers":[5],"over":[6],"propositions":[7],"are":[8,33],"first":[9],"introduced":[10],"into":[11],"language":[13],"for":[14,22,42,55],"reasoning":[15],"about":[16],"probability,":[17],"then":[18],"complexity":[20],"issues":[21],"validity":[23,45,58],"problems":[24],"dealing":[25],"with":[26],"corresponding":[28],"hierarchy":[29,54],"of":[30],"probabilistic":[31],"sentences":[32],"investigated.":[34],"We":[35],"prove,":[36],"among":[37],"other":[38],"things,":[39],"\u03a011-completeness":[41],"general":[44],"and":[46],"also":[47],"indicate":[48],"least":[50],"level":[51],"in":[52],"which":[56],"problem":[59],"is":[60],"undecidable.":[61]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}