{"id":"https://openalex.org/W4231938111","doi":"https://doi.org/10.1109/lics.2004.1319627","title":"A computational interpretation of open induction","display_name":"A computational interpretation of open induction","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W4231938111","doi":"https://doi.org/10.1109/lics.2004.1319627"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2004.1319627","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2004.1319627","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","raw_type":"proceedings-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/A5005999573","display_name":"Ulrich Berger","orcid":"https://orcid.org/0000-0002-7677-3582"},"institutions":[{"id":"https://openalex.org/I39586589","display_name":"Swansea University","ror":"https://ror.org/053fq8t95","country_code":"GB","type":"education","lineage":["https://openalex.org/I39586589"]},{"id":"https://openalex.org/I97429440","display_name":"University of Wales","ror":"https://ror.org/01se4f844","country_code":"GB","type":"education","lineage":["https://openalex.org/I97429440"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"U. Berger","raw_affiliation_strings":["Department of Computer Science, University of Wales, Swansea, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Wales, Swansea, UK","institution_ids":["https://openalex.org/I39586589","https://openalex.org/I97429440"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005999573"],"corresponding_institution_ids":["https://openalex.org/I39586589","https://openalex.org/I97429440"],"apc_list":null,"apc_paid":null,"fwci":1.7988,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.88401393,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"306","issue":null,"first_page":"326","last_page":"334"},"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.9998999834060669,"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.9998999834060669,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9995999932289124,"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.9984999895095825,"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/realizability","display_name":"Realizability","score":0.8321095705032349},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.7791815996170044},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7346993088722229},{"id":"https://openalex.org/keywords/interpretation","display_name":"Interpretation (philosophy)","score":0.6428232192993164},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6083075404167175},{"id":"https://openalex.org/keywords/mathematical-induction","display_name":"Mathematical induction","score":0.5251407623291016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5135843753814697},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4716067910194397},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4339603781700134},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36581239104270935},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3259761333465576},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2924577593803406},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.22336071729660034},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10984379053115845}],"concepts":[{"id":"https://openalex.org/C2776378722","wikidata":"https://www.wikidata.org/wiki/Q3454417","display_name":"Realizability","level":2,"score":0.8321095705032349},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.7791815996170044},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7346993088722229},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.6428232192993164},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6083075404167175},{"id":"https://openalex.org/C206743973","wikidata":"https://www.wikidata.org/wiki/Q178377","display_name":"Mathematical induction","level":2,"score":0.5251407623291016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5135843753814697},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4716067910194397},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4339603781700134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36581239104270935},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3259761333465576},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2924577593803406},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.22336071729660034},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10984379053115845},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lics.2004.1319627","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2004.1319627","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.66.5911","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.5911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-compsci.swan.ac.uk/~csulrich/ftp/open-ieee.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W8088060","https://openalex.org/W162931075","https://openalex.org/W209350518","https://openalex.org/W1484625174","https://openalex.org/W1485672136","https://openalex.org/W1512502927","https://openalex.org/W1525064220","https://openalex.org/W1541955821","https://openalex.org/W1560570506","https://openalex.org/W1608084331","https://openalex.org/W1608607427","https://openalex.org/W1966245774","https://openalex.org/W2004000165","https://openalex.org/W2007270285","https://openalex.org/W2041461531","https://openalex.org/W2079521728","https://openalex.org/W2107359728","https://openalex.org/W2134419104","https://openalex.org/W2162849813","https://openalex.org/W2163841074","https://openalex.org/W2468719830","https://openalex.org/W2529297474","https://openalex.org/W2600009487","https://openalex.org/W4236347697","https://openalex.org/W6630654809","https://openalex.org/W6728639818","https://openalex.org/W6735412686"],"related_works":["https://openalex.org/W2156140706","https://openalex.org/W2101752691","https://openalex.org/W2079125094","https://openalex.org/W2140392112","https://openalex.org/W1547864995","https://openalex.org/W182723225","https://openalex.org/W2094354112","https://openalex.org/W1799042098","https://openalex.org/W2067699663","https://openalex.org/W3023460505"],"abstract_inverted_index":{"We":[0,32,97],"study":[1],"the":[2,58,101],"proof-theoretic":[3],"and":[4,20,38,53,55],"computational":[5,102],"properties":[6],"of":[7,89,104],"open":[8,36,47,95],"induction,":[9],"a":[10,79],"principle":[11],"which":[12],"is":[13,49],"classically":[14],"equivalent":[15],"to":[16,22],"Nash-Williams'":[17],"minimal-bad-sequence":[18],"argument":[19],"also":[21,98],"(countable)":[23],"dependent":[24,39,45],"choice":[25,40,107],"(and":[26],"hence":[27],"contains":[28],"full":[29],"classical":[30,70,87,105],"analysis).":[31],"show":[33,99],"that,":[34],"intuitionistically,":[35],"induction":[37,48],"are":[41],"quite":[42],"different:":[43],"Unlike":[44],"choice,":[46],"closed":[50],"under":[51],"negative-":[52],"A-translation,":[54],"therefore":[56],"proves":[57],"same":[59],"/spl":[60,90],"pi//sub":[61,91],"2//sup":[62,92],"0/-formulas":[63,93],"(over":[64],"not":[65],"necessarily":[66],"decidable,":[67],"basic-predicates)":[68],"with":[69],"or":[71],"intuitionistic":[72],"arithmetic.":[73],"Via":[74],"modified":[75],"realizability":[76],"we":[77],"obtain":[78],"new":[80],"direct":[81],"method":[82],"for":[83],"extracting":[84],"programs":[85],"from":[86,118],"proofs":[88],"using":[94],"induction.":[96],"that":[100],"interpretation":[103],"countable":[106],"given":[108],"by":[109],"S.":[110],"Berardi":[111],"et":[112],"al.":[113],"(1998)":[114],"can":[115],"be":[116],"derived":[117],"our":[119],"results.":[120]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
