{"id":"https://openalex.org/W2078603002","doi":"https://doi.org/10.2307/2272395","title":"On deciding the truth of certain statements involving the notion of consistency","display_name":"On deciding the truth of certain statements involving the notion of consistency","publication_year":1976,"publication_date":"1976-12-01","ids":{"openalex":"https://openalex.org/W2078603002","doi":"https://doi.org/10.2307/2272395","mag":"2078603002"},"language":"en","primary_location":{"id":"doi:10.2307/2272395","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272395","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","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/A5008053802","display_name":"George Boolos","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"George Boolos","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, Massachusetts 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008053802"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.3224,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.82256298,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"41","issue":"4","first_page":"779","last_page":"781"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994000196456909,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sentence","display_name":"Sentence","score":0.6763214468955994},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6100499629974365},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.5705304145812988},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.5250794291496277},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.524215579032898},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5104226469993591},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5019409656524658},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.49887800216674805},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4493268132209778},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39755165576934814},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.18237847089767456},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.17792579531669617},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1552644670009613},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0964420735836029},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08114299178123474}],"concepts":[{"id":"https://openalex.org/C2777530160","wikidata":"https://www.wikidata.org/wiki/Q41796","display_name":"Sentence","level":2,"score":0.6763214468955994},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6100499629974365},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.5705304145812988},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.5250794291496277},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.524215579032898},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5104226469993591},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5019409656524658},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.49887800216674805},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4493268132209778},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39755165576934814},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.18237847089767456},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.17792579531669617},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1552644670009613},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0964420735836029},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08114299178123474}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2307/2272395","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272395","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1183739864","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183739864","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":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1540715591","https://openalex.org/W2028227692","https://openalex.org/W2081160992","https://openalex.org/W4210783718"],"related_works":["https://openalex.org/W2059922809","https://openalex.org/W2377185541","https://openalex.org/W2378553216","https://openalex.org/W2462900308","https://openalex.org/W2171044983","https://openalex.org/W2096992842","https://openalex.org/W2362026785","https://openalex.org/W2914151043","https://openalex.org/W2619749483","https://openalex.org/W2358573072"],"abstract_inverted_index":{"Friedman":[0],"has":[1],"posed":[2],"(see":[3],"[F,":[4],"p.":[5],"117])":[6],"the":[7,12,133,139,146,154,166,170,173,179,183,207,211,220,225,273,276],"following":[8],"problem:":[9],"\u201c35.":[10],"Define":[11],"set":[13,99],"E":[14,45,104],"of":[15,100,136,141,148,156,168,176,213,222,278],"expressions":[16,28,101],"by":[17,55],"(i)":[18],"Con":[19,131,230,307,315,318,320],"is":[20,62,96,108,110,202,271,282,286,289,304],"an":[21],"expression;":[22],"(ii)":[23],"if":[24,262],"A,":[25],"B":[26,82,159,250,260,267],"are":[27,30],"so":[29],"(~":[31],"A":[32,39,66,73,80,86,94,145,149,157,164,177,192,197,200,216,236,243,248,256,265],"),":[33,36],"(":[34,64,72,75,151,238],"A&B":[35,76,152,239],"and":[37,84,158,162,231,241,249,298,319],"Con(":[38,85,191,242],").":[40,198,327],"Each":[41],"expression":[42],"\u03d5":[43,49,102],"in":[44,50,182,204],"determines":[46],"a":[47,296,299,305],"sentence":[48,135,209,306],"PA":[51,61,91,137,142,188,205,214,254,264],"[classical":[52],"first-order":[53],"arithmetic]":[54],"taking":[56],"Con*":[57],"to":[58,69,78,88,121,206],"be":[59,70,79,89,132,224],"\u201c":[60,90],"consistent,\u201d":[63],"~":[65,71,144,195,235],")":[67,153,165,193,201,240,244,257,261],"*":[68],"*),":[74],")*":[77,87],"*&":[81],"*,":[83],"+":[92,215,322],"\u2018":[93],"*\u2019":[95],"consistent.\u201d":[97],"The":[98,113,284],"\u2208":[103],"such":[105],"that":[106,287],"\u03d5*":[107],"true":[109,279],"recursive":[111],".":[112,189,251],"formalized":[114],"second":[115],"incompleteness":[116],"theorem":[117],"reads":[118],"In":[119],"order":[120],"simplify":[122],"notation,":[123],"we":[124,294],"will":[125],"reformulate":[126],"Friedman's":[127,269],"problem":[128,270],"slightly.":[129],"Let":[130,190],"usual":[134,184,208],"expressing":[138,210],"consistency":[140,212],",":[143,150,160,237,268],"negation":[147],"conjunction":[155],"etc.,":[161],"Bew(":[163,255,259],"result":[167],"substituting":[169],"numeral":[171],"for":[172,178,187,309],"G\u00f6del":[174],"number":[175],"free":[180],"variable":[181],"provability":[185],"predicate":[186],"=":[194,317,324],"Bew(~":[196],"(Con(":[199],"equivalent":[203],".)":[217],"And":[218],"let":[219],"class":[221,227,277],"F-sentences":[223],"smallest":[226],"which":[228,232],"contains":[229,234,247],"also":[233],"whenever":[245],"it":[246,288],"Since":[252],"\u22a6":[253,263],"\u2194":[258,266],"then":[272],"question":[274],"whether":[275],"F":[280],"-sentences":[281],"recursive.":[283,290],"answer":[285],"To":[291],"see":[292],"why,":[293],"need":[295],"definition":[297],"theorem.":[300],"Definition.":[301],"An":[302],"atom":[303],"n":[308,311,321,326],"some":[310],"\u2265":[312],"1,":[313],"where":[314],"t":[316],"1":[323],"Con(Con":[325]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}