{"id":"https://openalex.org/W1484825648","doi":"https://doi.org/10.2307/2272162","title":"On an extension of Hilbert's second \u03b5-theorem","display_name":"On an extension of Hilbert's second \u03b5-theorem","publication_year":1975,"publication_date":"1975-09-01","ids":{"openalex":"https://openalex.org/W1484825648","doi":"https://doi.org/10.2307/2272162","mag":"1484825648"},"language":"en","primary_location":{"id":"doi:10.2307/2272162","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272162","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/A5109842705","display_name":"T. B. Flannagan","orcid":null},"institutions":[{"id":"https://openalex.org/I124357947","display_name":"University of London","ror":"https://ror.org/04cw6st05","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947"]},{"id":"https://openalex.org/I4210160447","display_name":"Universidad de Londres","ror":"https://ror.org/054v4yq51","country_code":"MX","type":"education","lineage":["https://openalex.org/I4210160447"]},{"id":"https://openalex.org/I98640878","display_name":"Bedford College","ror":"https://ror.org/01aa0nz04","country_code":"GB","type":"education","lineage":["https://openalex.org/I4405252469","https://openalex.org/I98640878"]}],"countries":["GB","MX"],"is_corresponding":true,"raw_author_name":"T. B. Flannagan","raw_affiliation_strings":["Bedford College, University of London, London, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bedford College, University of London, London, England","institution_ids":["https://openalex.org/I124357947","https://openalex.org/I4210160447","https://openalex.org/I98640878"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109842705"],"corresponding_institution_ids":["https://openalex.org/I124357947","https://openalex.org/I4210160447","https://openalex.org/I98640878"],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.09571492,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"40","issue":"3","first_page":"393","last_page":"397"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9976000189781189,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9976000189781189,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9962999820709229,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9958999752998352,"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/mathematics","display_name":"Mathematics","score":0.6756299734115601},{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.6221643686294556},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5916541218757629},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5359348654747009},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.49231278896331787},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4722670316696167},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4238743782043457},{"id":"https://openalex.org/keywords/axiom-of-choice","display_name":"Axiom of choice","score":0.41230806708335876},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.3677406907081604},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.09972947835922241},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.076510488986969},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.05970624089241028}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6756299734115601},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.6221643686294556},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5916541218757629},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5359348654747009},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.49231278896331787},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4722670316696167},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4238743782043457},{"id":"https://openalex.org/C151797676","wikidata":"https://www.wikidata.org/wiki/Q179692","display_name":"Axiom of choice","level":4,"score":0.41230806708335876},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3677406907081604},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.09972947835922241},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.076510488986969},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.05970624089241028},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2307/2272162","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272162","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1480405493","https://openalex.org/W1536240750","https://openalex.org/W1975810242","https://openalex.org/W2587962973","https://openalex.org/W4231621694"],"related_works":["https://openalex.org/W2076743759","https://openalex.org/W4235144492","https://openalex.org/W4388435768","https://openalex.org/W2756792282","https://openalex.org/W2756744637","https://openalex.org/W2759493398","https://openalex.org/W3111457560","https://openalex.org/W3112295066","https://openalex.org/W4210343663","https://openalex.org/W2373903136"],"abstract_inverted_index":{"The":[0,59,79],"aim":[1],"of":[2,15,19,30,41,56,65,72,87,107,118,139,147,161,168,191,202],"this":[3],"paper":[4],"is":[5,91,97,117,126,142,155,164,176,180,182,197],"to":[6,133],"correct":[7],"an":[8,145],"error":[9,80],"in":[10,13,69,81,84,195],"the":[11,31,51,85,98,119,134,148,156,159,166,189,200],"proof":[12,86,201],"[2]":[14,82,196],"a":[16,127,184],"strengthened":[17],"version":[18,61],"Hilbert's":[20,23],"second":[21],"\u03b5-theorem.":[22],"original":[24],"theorem":[25],"says":[26,67],"(effectively)":[27],"that":[28],"formulae":[29],"form":[32,120],"\u2203xA":[33],"\u2192":[34],"A(\u03b5xA)":[35],"can":[36,75],"be":[37,77],"eliminated":[38],"from":[39,53,101],"deductions":[40],"\u2208-free":[42],"sentences":[43],"B":[44,116,175],"(i.e.":[45],"those":[46],"which":[47,181],"do":[48],"not":[49,143,183],"contain":[50],"\u03b5-symbol)":[52],"collections":[54],"X":[55],"\u03b5-free":[57],"sentences.":[58],"extended":[60],"(Theorem":[62],"III.":[63],"11":[64],"[2])":[66],"that,":[68],"addition,":[70],"instances":[71],"Ackermann's":[73],"schema":[74],"also":[76],"eliminated.":[78],"occurs":[83],"Theorem":[88,203],"III.7":[89],"and":[90,123,173],"described":[92],"as":[93,193],"follows.":[94],"If":[95],"A\u2032":[96,141,179],"formula":[99],"obtained":[100],"A":[102,125,154],"by":[103,109,113],"replacing":[104],"every":[105],"occurrence":[106],"\u2203yB":[108],"B(\u03b5yB)":[110],"(or":[111],"\u2200yC":[112],"C(\u03b5yB)":[114],"if":[115,124,153],"\u00ac":[121],"C),":[122],"Q3":[128],"or":[129],"Q4-axiom":[130],"then,":[131],"contrary":[132],"claim":[135],"on":[136],"p.":[137,171],"73":[138],"[2],":[140],"necessarily":[144],"axiom":[146],"same":[149],"form.":[150],"For":[151],"example,":[152],"Q3-axiom":[157],"where":[158,174],"rank":[160,167,192],"\u03b5x\u2203yD(x,":[162],"y)":[163],"\u2264":[165],"\u03b5yB":[169],"(see":[170],"70)":[172],"D(t,y),":[177],"then":[178],"Q3-axiom.":[185],"In":[186],"other":[187],"words,":[188],"notion":[190],"defined":[194],"inadequate":[198],"for":[199],"III.11.":[204]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}