{"id":"https://openalex.org/W4247769970","doi":"https://doi.org/10.1017/bsl.2017.29","title":"METAVALUATIONS","display_name":"METAVALUATIONS","publication_year":2017,"publication_date":"2017-09-01","ids":{"openalex":"https://openalex.org/W4247769970","doi":"https://doi.org/10.1017/bsl.2017.29"},"language":"en","primary_location":{"id":"doi:10.1017/bsl.2017.29","is_oa":false,"landing_page_url":"https://doi.org/10.1017/bsl.2017.29","pdf_url":null,"source":{"id":"https://openalex.org/S130801046","display_name":"Bulletin of Symbolic Logic","issn_l":"1079-8986","issn":["1079-8986","1943-5894"],"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":"The Bulletin 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/A5112409645","display_name":"Ross T. Brady","orcid":null},"institutions":[{"id":"https://openalex.org/I196829312","display_name":"La Trobe University","ror":"https://ror.org/01rxfrp27","country_code":"AU","type":"education","lineage":["https://openalex.org/I196829312"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"ROSS T. BRADY","raw_affiliation_strings":["PHILOSOPHY LA TROBE UNIVERSITY MELBOURNE, VICTORIA 3086, AUSTRALIA E-mail:","PHILOSOPHY LA TROBE UNIVERSITY MELBOURNE, VICTORIA3086, AUSTRALIAE-mail:"],"affiliations":[{"raw_affiliation_string":"PHILOSOPHY LA TROBE UNIVERSITY MELBOURNE, VICTORIA 3086, AUSTRALIA E-mail:","institution_ids":["https://openalex.org/I196829312"]},{"raw_affiliation_string":"PHILOSOPHY LA TROBE UNIVERSITY MELBOURNE, VICTORIA3086, AUSTRALIAE-mail:","institution_ids":["https://openalex.org/I196829312"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5112409645"],"corresponding_institution_ids":["https://openalex.org/I196829312"],"apc_list":null,"apc_paid":null,"fwci":0.2078,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.69704767,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"23","issue":"3","first_page":"296","last_page":"323"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9991000294685364,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9991000294685364,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9983999729156494,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9925000071525574,"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/logical-consequence","display_name":"Logical consequence","score":0.6363153457641602},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.560466468334198},{"id":"https://openalex.org/keywords/syllogism","display_name":"Syllogism","score":0.48661670088768005},{"id":"https://openalex.org/keywords/rule-of-inference","display_name":"Rule of inference","score":0.47580820322036743},{"id":"https://openalex.org/keywords/peano-axioms","display_name":"Peano axioms","score":0.45795121788978577},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4466950595378876},{"id":"https://openalex.org/keywords/combinatory-logic","display_name":"Combinatory logic","score":0.44545626640319824},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.44008830189704895},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.3616936504840851},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3413984775543213},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.20224231481552124},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18268996477127075},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12212049961090088},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.12133380770683289}],"concepts":[{"id":"https://openalex.org/C134752490","wikidata":"https://www.wikidata.org/wiki/Q374182","display_name":"Logical consequence","level":2,"score":0.6363153457641602},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.560466468334198},{"id":"https://openalex.org/C131598440","wikidata":"https://www.wikidata.org/wiki/Q107342","display_name":"Syllogism","level":2,"score":0.48661670088768005},{"id":"https://openalex.org/C3746660","wikidata":"https://www.wikidata.org/wiki/Q1068763","display_name":"Rule of inference","level":2,"score":0.47580820322036743},{"id":"https://openalex.org/C97489613","wikidata":"https://www.wikidata.org/wiki/Q842755","display_name":"Peano axioms","level":2,"score":0.45795121788978577},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4466950595378876},{"id":"https://openalex.org/C79678938","wikidata":"https://www.wikidata.org/wiki/Q1481571","display_name":"Combinatory logic","level":2,"score":0.44545626640319824},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.44008830189704895},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.3616936504840851},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3413984775543213},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.20224231481552124},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18268996477127075},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12212049961090088},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.12133380770683289}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/bsl.2017.29","is_oa":false,"landing_page_url":"https://doi.org/10.1017/bsl.2017.29","pdf_url":null,"source":{"id":"https://openalex.org/S130801046","display_name":"Bulletin of Symbolic Logic","issn_l":"1079-8986","issn":["1079-8986","1943-5894"],"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":"The Bulletin of Symbolic Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1497143596","https://openalex.org/W1524655177","https://openalex.org/W1554516311","https://openalex.org/W1567142488","https://openalex.org/W1593617641","https://openalex.org/W1964110945","https://openalex.org/W1969421328","https://openalex.org/W1972572567","https://openalex.org/W1984344621","https://openalex.org/W1987181457","https://openalex.org/W2007371755","https://openalex.org/W2051198079","https://openalex.org/W2069450525","https://openalex.org/W2074803005","https://openalex.org/W2088847726","https://openalex.org/W2108737609","https://openalex.org/W2143219302","https://openalex.org/W2221549993","https://openalex.org/W2235317816","https://openalex.org/W2738657924","https://openalex.org/W4236840112","https://openalex.org/W4240400578","https://openalex.org/W6601011238","https://openalex.org/W6689621529","https://openalex.org/W6741657760"],"related_works":["https://openalex.org/W1981618715","https://openalex.org/W2183390669","https://openalex.org/W2002234876","https://openalex.org/W1508816930","https://openalex.org/W1490035312","https://openalex.org/W1578931304","https://openalex.org/W284752225","https://openalex.org/W2014841514","https://openalex.org/W2170952169","https://openalex.org/W1869822899"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"is":[2,62,194,228,235,283],"a":[3,64,250,254,262],"general":[4],"account":[5],"of":[6,40,58,75,77,92,107,249,253,261,265,293],"metavaluations":[7,69,287],"and":[8,48,86,103,121,142,152,158,177,180,184,187,199,216,308],"their":[9,171,324],"applications,":[10],"which":[11,31,61],"can":[12,202,277],"be":[13,168,203,278,312],"seen":[14],"as":[15,127,269],"an":[16,100],"alternative":[17],"to":[18,89,167,191,205,230],"standard":[19,305],"model-theoretic":[20,243,273],"methodology.":[21],"They":[22],"work":[23],"best":[24],"for":[25],"what":[26],"are":[27,170],"called":[28],"metacomplete":[29],"logics,":[30,36],"include":[32],"the":[33,49,55,72,108,128,143,196,207,213,224,232,242,272],"contraction-less":[34],"relevant":[35],"with":[37,150,164],"possible":[38],"additions":[39],"Conjunctive":[41],"Syllogism,":[42],"(A\u2192B)":[43],"&":[44],"(B\u2192C)":[45],"\u2192":[46],".A\u2192C,":[47],"irrelevant,":[50],"A\u2192":[51],".B\u2192A,":[52],"these":[53,294,321],"including":[54],"logic":[56],"MC":[57],"meaning":[59],"containment":[60],"arguably":[63],"good":[65],"entailment":[66,78,94],"logic.":[67],"Indeed,":[68],"focus":[70],"on":[71,173],"formula-inductive":[73],"properties":[74,91,299],"theorems":[76,95],"form":[79],"A\u2192B,":[80],"splintering":[81],"into":[82],"two":[83],"types,":[84],"M1-":[85,198],"M2-,":[87],"according":[88],"key":[90,217],"negated":[93],"(see":[96],"below).":[97],"Metavaluations":[98],"have":[99,105,301],"inductive":[101],"presentation":[102],"thus":[104,122,309],"some":[106],"advantages":[109],"that":[110,195,227,246,260,280,288,300,315],"model":[111,306,317],"theory":[112,176,307,318],"does,":[113],"but":[114],"they":[115],"represent":[116,123],"proof":[117,244],"rather":[118,258],"than":[119,238,259],"truth":[120],"proof-theoretic":[124],"properties,":[125,145],"such":[126,266,316],"priming":[129],"property,":[130],"if":[131],"\u251c":[132,137,140,153,156,159],"A":[133,138,157],"$\\vee$":[134],"B":[135,161],"then":[136],"or":[139],"B,":[141],"negated-entailment":[144],"not-\u251c":[146],"\u223c(A\u2192B)":[147,154],"(for":[148,162],"M1-logics,":[149,221],"M1-metavaluations)":[151],"iff":[155],"\u223c":[160],"M2-logics,":[163],"M2-metavaluations).":[165],"Topics":[166],"covered":[169],"impact":[172],"naive":[174],"set":[175],"paradox":[178],"solution,":[179],"also":[181],"Peano":[182,281],"arithmetic":[183],"Godel\u2019s":[185],"First":[186],"Second":[188],"Theorems.":[189],"Interesting":[190],"note":[192],"here":[193],"familiar":[197],"M2-metacomplete":[200],"logics":[201],"used":[204,229],"solve":[206],"set-theoretic":[208],"paradoxes":[209],"and,":[210],"by":[211],"inference,":[212],"Liar":[214],"Paradox":[215],"semantic":[218],"paradoxes.":[219],"For":[220],"in":[222,241,245,271,304,323],"particular,":[223],"final":[225,325],"metavaluation":[226],"prove":[231,320],"simple":[233],"consistency":[234],"far":[236],"simpler":[237],"its":[239],"correspondent":[240],"it":[247,276,310],"consists":[248],"limit":[251,267],"point":[252],"single":[255],"transfinite":[256,263],"sequence":[257,264],"points,":[268],"occurs":[270],"approach.":[274],"Additionally,":[275],"shown":[279],"Arithmetic":[282],"simply":[284],"consistent,":[285],"using":[286],"constitute":[289],"finitary":[290],"methods.":[291],"Both":[292],"results":[295,322],"use":[296],"specific":[297],"metavaluational":[298],"no":[302],"correspondents":[303],"would":[311],"highly":[313],"unlikely":[314],"could":[319],"forms.":[326]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-03T16:38:21.277918","created_date":"2022-05-12T00:00:00"}