{"id":"https://openalex.org/W2011948182","doi":"https://doi.org/10.1305/ndjfl/1093888213","title":"An automatic theorem prover for substitution and detachment systems.","display_name":"An automatic theorem prover for substitution and detachment systems.","publication_year":1978,"publication_date":"1978-01-01","ids":{"openalex":"https://openalex.org/W2011948182","doi":"https://doi.org/10.1305/ndjfl/1093888213","mag":"2011948182"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093888213","is_oa":false,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093888213","pdf_url":null,"source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal 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/A5069774589","display_name":"Jeremy George Peterson","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jeremy George Peterson","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069774589"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3178,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85413005,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"19","issue":"1","first_page":null,"last_page":null},"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.9979000091552734,"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.9979000091552734,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9829999804496765,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/substitution","display_name":"Substitution (logic)","score":0.8112003803253174},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.6755735874176025},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.5094297528266907},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.41603603959083557},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41439634561538696},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3893794119358063},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32441410422325134},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.3234111964702606},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.29647621512413025},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09538698196411133},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.04816603660583496},{"id":"https://openalex.org/keywords/medicine","display_name":"Medicine","score":0.04551273584365845}],"concepts":[{"id":"https://openalex.org/C2778220771","wikidata":"https://www.wikidata.org/wiki/Q1522579","display_name":"Substitution (logic)","level":2,"score":0.8112003803253174},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.6755735874176025},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.5094297528266907},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.41603603959083557},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41439634561538696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3893794119358063},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32441410422325134},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3234111964702606},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29647621512413025},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09538698196411133},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.04816603660583496},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.04551273584365845},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093888213","is_oa":false,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093888213","pdf_url":null,"source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1093888213","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093888213","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1969967043","https://openalex.org/W2041659040","https://openalex.org/W4255921169"],"related_works":["https://openalex.org/W4246350535","https://openalex.org/W3083050876","https://openalex.org/W1875958796","https://openalex.org/W1780472831","https://openalex.org/W1976200187","https://openalex.org/W1561644379","https://openalex.org/W2969536091","https://openalex.org/W2060759735","https://openalex.org/W783488073","https://openalex.org/W4387323780"],"abstract_inverted_index":{"As":[0],"mentioned":[1],"in":[2,7,98,124,190,265,308],"[3],":[3],"the":[4,13,26,63,78,81,119,144,178,191,198,280,300,309,322],"proofs":[5],"exhibited":[6],"that":[8,107,193,215,274,324],"paper":[9,20],"were":[10],"found":[11],"with":[12],"aid":[14],"of":[15,25,51,74,83,117,121,135,154,157,181,197,204,230,236,256,288],"a":[16,22,31,48,54,71,122,126,201,228,233,237,250,266,317],"theorem-proving":[17],"computer":[18],"program.This":[19],"is":[21,102,169,187,200,232,258,295,327],"short":[23],"summary":[24],"algorithms":[27],"and":[28,33,47,90,147,225,268],"heuristics":[29],"used.By":[30],"substitution":[32,155,202,226,234,267,286,301],"detachment":[34,110,175,245,260,269,331],"system":[35,40],"we":[36,59,176,247,272,313],"mean":[37],"any":[38,263],"formal":[39],"whose":[41,253],"language":[42],"contains":[43],"denumerably":[44],"many":[45],"variables":[46],"finite":[49],"set":[50,73,153,165,199,229],"connectives,":[52],"including":[53],"distinguished":[55],"binary":[56],"connective":[57],"which":[58,66,186,218,239],"callC.The":[60],"theorems":[61,304],"are":[62,305],"well-formed":[64,75],"formulae":[65,95,145],"may":[67,149,240,248],"be":[68,97,150,161,171,220,241],"derived":[69,221,242,282],"from":[70,227,321],"given":[72],"formulae,":[76],"called":[77],"axioms,":[79],"by":[80,222,243],"rules":[82],"modus":[84,137,167,223],"ponens":[85,138,168,224],"(with":[86,139],"respect":[87],"to":[88,96,143,170,261,298],"C)":[89],"substitution.We":[91],"will":[92],"assume":[93],"all":[94,285],"Polish":[99],"prefix":[100],"notation.It":[101],"known":[103,328],"(cf.[7],":[104],"p.":[105,207],"4)":[106],"Meredith's":[108],"condensed":[109,174,244,259,330],"operator":[111],"D":[112],"provides":[113],"an":[114,151,325],"efficient":[115],"method":[116],"presenting":[118],"proof":[120],"theorem":[123,217,238,251,264,281,318],"such":[125,316],"system,":[127,270],"but":[128,283],"it":[129,205,289,294],"does":[130],"more":[131],"than":[132],"this.The":[133],"result":[134],"applying":[136],"some":[140],"appropriate":[141],"substitutions)":[142],"Ca\u03b2":[146],"\u03b3":[148],"infinite":[152],"instances":[156,287,302],"\u03b2.Some":[158],"restriction":[159],"must":[160],"placed":[162],"on":[163],"this":[164,182],"if":[166,271],"mechanised.In":[172],"using":[173],"choose":[177],"one":[179],"member":[180,196],"set,":[183],"namely":[184],"DCa\u03b2.\u03b3,":[185],"most":[188],"general":[189],"sense":[192],"every":[194,216],"other":[195],"instance":[203,235],"[7],":[206],"4,":[208],"as":[209],"our":[210],"result.J.":[211],"Kalman":[212],"has":[213],"proved":[214],"can":[219,314],"axioms":[231],"alone.Thus":[246],"use":[249],"prover":[252,319],"only":[254,279],"rule":[255],"inference":[257],"prove":[262],"consider":[273,299],"at":[275],"each":[276],"step":[277],"not":[278],"also":[284],"have":[290],"been":[291],"proved.In":[292],"practice":[293],"rarely":[296],"necessary":[297],"since":[303],"usually":[306],"required":[307],"strongest":[310],"possible":[311],"form.That":[312],"construct":[315],"follows":[320],"fact":[323],"algorithm":[326],"for":[329],"[l].":[332]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}