{"id":"https://openalex.org/W2049714341","doi":"https://doi.org/10.1137/0213026","title":"Recursive Programs as Definitions in First-Order Logic","display_name":"Recursive Programs as Definitions in First-Order Logic","publication_year":1984,"publication_date":"1984-05-01","ids":{"openalex":"https://openalex.org/W2049714341","doi":"https://doi.org/10.1137/0213026","mag":"2049714341"},"language":"en","primary_location":{"id":"doi:10.1137/0213026","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213026","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5068157052","display_name":"Robert Cartwright","orcid":null},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Robert Cartwright","raw_affiliation_strings":["Rice University (Houston, TX)"],"affiliations":[{"raw_affiliation_string":"Rice University (Houston, TX)","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068157052"],"corresponding_institution_ids":["https://openalex.org/I74775410"],"apc_list":null,"apc_paid":null,"fwci":3.0577,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.92118506,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"13","issue":"2","first_page":"374","last_page":"408"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":1.0,"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":1.0,"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/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9990000128746033,"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/logic-programming","display_name":"Logic programming","score":0.491676390171051},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4915328919887543},{"id":"https://openalex.org/keywords/abstract-interpretation","display_name":"Abstract interpretation","score":0.4854500889778137},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.476913183927536},{"id":"https://openalex.org/keywords/least-fixed-point","display_name":"Least fixed point","score":0.46735480427742004},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4573097229003906},{"id":"https://openalex.org/keywords/domain-theory","display_name":"Domain theory","score":0.45621222257614136},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.44821423292160034},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.4459802806377411},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4353381097316742},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4347504675388336},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.4150002598762512},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.41311225295066833},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38694193959236145},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3143283724784851},{"id":"https://openalex.org/keywords/fixed-point-theorem","display_name":"Fixed-point theorem","score":0.14548498392105103},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.14214429259300232}],"concepts":[{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.491676390171051},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4915328919887543},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.4854500889778137},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.476913183927536},{"id":"https://openalex.org/C27333817","wikidata":"https://www.wikidata.org/wiki/Q6134913","display_name":"Least fixed point","level":5,"score":0.46735480427742004},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4573097229003906},{"id":"https://openalex.org/C29585364","wikidata":"https://www.wikidata.org/wiki/Q1079166","display_name":"Domain theory","level":2,"score":0.45621222257614136},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.44821423292160034},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.4459802806377411},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4353381097316742},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4347504675388336},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.4150002598762512},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.41311225295066833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38694193959236145},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3143283724784851},{"id":"https://openalex.org/C45962547","wikidata":"https://www.wikidata.org/wiki/Q1422068","display_name":"Fixed-point theorem","level":2,"score":0.14548498392105103},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.14214429259300232},{"id":"https://openalex.org/C28642324","wikidata":"https://www.wikidata.org/wiki/Q656176","display_name":"Schauder fixed point theorem","level":4,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C206929604","wikidata":"https://www.wikidata.org/wiki/Q530152","display_name":"Picard\u2013Lindel\u00f6f theorem","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0213026","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213026","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.423.4367","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.423.4367","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rice.edu/~javaplt/311/Readings/RecPrograms.pdf","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":11,"referenced_works":["https://openalex.org/W109993195","https://openalex.org/W1977571320","https://openalex.org/W1988651604","https://openalex.org/W2046213250","https://openalex.org/W2056239109","https://openalex.org/W2063809508","https://openalex.org/W2075052434","https://openalex.org/W2105505307","https://openalex.org/W2499474130","https://openalex.org/W4211265583","https://openalex.org/W4256371891"],"related_works":["https://openalex.org/W1507069282","https://openalex.org/W1592042765","https://openalex.org/W2062233055","https://openalex.org/W1603485317","https://openalex.org/W7943451","https://openalex.org/W2009579760","https://openalex.org/W1606129265","https://openalex.org/W1483744219","https://openalex.org/W2142848950","https://openalex.org/W2010663699"],"abstract_inverted_index":{"Despite":[0],"the":[1,81,106,146,150,154,157,166,183,205,217,224,257,261,288],"reputed":[2],"limitations":[3],"of":[4,19,86,141,149,170,187,195,204,226,260,284],"first":[5,25,46,87,132,167,188,196,272],"order":[6,26,35,40,47,88,133,168,189,197,273],"logic,":[7],"it":[8,267],"is":[9,50,145,161,200,212,268,276],"easy":[10],"to":[11,58,153,208,222,279],"state":[12],"and":[13,74],"prove":[14,280],"almost":[15,281],"all":[16],"interesting":[17],"properties":[18],"recursive":[20,143,210,243,248,292],"programs":[21,122],"within":[22,80],"a":[23,99,131,142,162,173,209,235,252],"simple":[24],"theory,":[27],"by":[28,291],"using":[29],"an":[30,213,241,246],"approach":[31],"we":[32,233],"call":[33],"\u201cfirst":[34],"programming":[36,48,89,198,274],"logic\u201d.":[37],"Unlike":[38],"higher":[39],"logics":[41],"based":[42],"on":[43,52],"fixed-point":[44,148,203],"induction,":[45],"logic":[49,90,199,220,275],"founded":[51],"deductive":[53],"principles":[54],"that":[55,103,201,250,271],"are":[56,125],"familiar":[57],"most":[59],"programmers.":[60],"Informal":[61],"structural":[62,174],"induction":[63,175],"arguments":[64],"(such":[65],"as":[66,114,116,127,182],"termination":[67],"proofs":[68],"for":[69,216,239],"LISP":[70],"append,":[71],"McCarthy\u2019s":[72],"91-function,":[73],"Ackermann\u2019s":[75],"function)":[76],"have":[77],"direct":[78],"formalizations":[79],"system.":[82],"The":[83,93,139,192,219],"essential":[84],"elements":[85],"are:":[91],"(1)":[92],"data":[94,118,136,158],"domain":[95,159],"D":[96,124,160,171],"must":[97],"be":[98],"finitely":[100,163],"generated":[101,164],"set":[102],"explicitly":[104],"includes":[105,172],"\u201cundefined\u201d":[107],"object":[108],"$":[109,111],"\\bot":[110],"(representing":[112],"nontermination)":[113],"well":[115],"ordinary":[117],"objects.":[119],"(2)":[120],"Recursive":[121],"over":[123],"treated":[126],"logical":[128,258],"definitions":[129],"augmenting":[130],"theory":[134],"ofthe":[135],"domain.":[137],"(3)":[138],"interpretation":[140,215],"program":[144,211,244,249],"least":[147,227],"functional":[151,206],"corresponding":[152,207],"program.":[155,218],"Since":[156],"set,":[165],"axiomatization":[169],"axiom":[176,179],"scheme.":[177],"This":[178],"scheme":[180],"serves":[181],"fundamental":[184],"\u201cproof":[185],"rule\u201d":[186],"program-ming":[190],"logic.":[191],"major":[193],"limitation":[194],"every":[202],"acceptable":[214],"fails":[221],"capture":[223],"notion":[225],"fixed-point.":[228],"To":[229],"overcome":[230],"this":[231,264],"limitation,":[232],"present":[234],"simple,":[236],"effective":[237],"procedure":[238],"transforming":[240],"arbitrary":[242],"into":[245],"equivalent":[247],"has":[251],"unique":[253],"fixed-point,":[254],"yet":[255],"retains":[256],"structure":[259],"original.":[262],"Given":[263],"transformation":[265],"technique,":[266],"our":[269],"experience":[270],"sufficiently":[277],"powerful":[278],"any":[282],"property":[283],"practical":[285],"interest":[286],"about":[287],"functions":[289],"computed":[290],"programs.":[293]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}