{"id":"https://openalex.org/W2080979186","doi":"https://doi.org/10.2307/2275216","title":"Extending the first-order theory of combinators with self-referential truth","display_name":"Extending the first-order theory of combinators with self-referential truth","publication_year":1993,"publication_date":"1993-06-01","ids":{"openalex":"https://openalex.org/W2080979186","doi":"https://doi.org/10.2307/2275216","mag":"2080979186"},"language":"en","primary_location":{"id":"doi:10.2307/2275216","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2275216","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/A5009435902","display_name":"Andrea Cantini","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andrea Cantini","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5009435902"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.517,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.67060159,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"58","issue":"2","first_page":"477","last_page":"513"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9987999796867371,"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.9980999827384949,"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/T10258","display_name":"Philosophy and Theoretical Science","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/3205","display_name":"Experimental and Cognitive Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatory-logic","display_name":"Combinatory logic","score":0.8989050984382629},{"id":"https://openalex.org/keywords/predicate-abstraction","display_name":"Predicate abstraction","score":0.7344563007354736},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.7122360467910767},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6816627979278564},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.677259087562561},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.6757140159606934},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4533230662345886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38745129108428955},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2463027536869049},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1903703808784485},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.13377612829208374},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.09124395251274109},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.0576130747795105}],"concepts":[{"id":"https://openalex.org/C79678938","wikidata":"https://www.wikidata.org/wiki/Q1481571","display_name":"Combinatory logic","level":2,"score":0.8989050984382629},{"id":"https://openalex.org/C2779907942","wikidata":"https://www.wikidata.org/wiki/Q7239630","display_name":"Predicate abstraction","level":3,"score":0.7344563007354736},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.7122360467910767},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6816627979278564},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.677259087562561},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.6757140159606934},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4533230662345886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38745129108428955},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2463027536869049},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1903703808784485},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.13377612829208374},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.09124395251274109},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.0576130747795105},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2307/2275216","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2275216","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"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1183744244","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183744244","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"},{"id":"pmh:oai:flore.unifi.it:2158/205067","is_oa":false,"landing_page_url":"http://hdl.handle.net/2158/205067","pdf_url":null,"source":{"id":"https://openalex.org/S4306402033","display_name":"Florence Research (University of Florence)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45084792","host_organization_name":"University of Florence","host_organization_lineage":["https://openalex.org/I45084792"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W4861723","https://openalex.org/W45464644","https://openalex.org/W46517763","https://openalex.org/W123923308","https://openalex.org/W126568045","https://openalex.org/W174270456","https://openalex.org/W388162888","https://openalex.org/W622364012","https://openalex.org/W1505605712","https://openalex.org/W1523047387","https://openalex.org/W1537390618","https://openalex.org/W1587614821","https://openalex.org/W1591825827","https://openalex.org/W1768328756","https://openalex.org/W1971623432","https://openalex.org/W2003017965","https://openalex.org/W2025127850","https://openalex.org/W2029847850","https://openalex.org/W2035004935","https://openalex.org/W2048205189","https://openalex.org/W2114374802","https://openalex.org/W2125432900","https://openalex.org/W2154273644","https://openalex.org/W2209681999","https://openalex.org/W2317107785","https://openalex.org/W2562830775","https://openalex.org/W3147717808","https://openalex.org/W4237353415","https://openalex.org/W4253690505","https://openalex.org/W4255243718","https://openalex.org/W6793303256","https://openalex.org/W7030278172"],"related_works":["https://openalex.org/W1531204343","https://openalex.org/W2522501807","https://openalex.org/W2120526551","https://openalex.org/W4232099822","https://openalex.org/W1780369767","https://openalex.org/W191072716","https://openalex.org/W105381148","https://openalex.org/W1981858926","https://openalex.org/W2125274893","https://openalex.org/W1973192438"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"aim":[2],"of":[3,13,22,38,74],"this":[4],"paper":[5],"is":[6],"to":[7],"introduce":[8],"a":[9,26,43,61,65],"formal":[10],"system":[11],"STW":[12,33,63],"self-referential":[14],"truth,":[15],"which":[16],"extends":[17],"the":[18,36],"classical":[19],"first-order":[20],"theory":[21],"pure":[23],"combinators":[24],"with":[25,45,72],"truth":[27],"predicate":[28,40],"and":[29],"certain":[30],"approximation":[31],"axioms.":[32],"naturally":[34],"embodies":[35],"mechanisms":[37],"general":[39],"application/abstraction":[41,47],"on":[42],"par":[44],"function":[46],";":[48],"in":[49],"addition,":[50],"it":[51],"allows":[52],"non-trivial":[53],"constructions,":[54],"inspired":[55],"by":[56],"generalized":[57],"recursion":[58],"theory.":[59],"As":[60],"consequence,":[62],"provides":[64],"smooth":[66],"inner":[67],"model":[68],"for":[69],"Myhill's":[70],"systems":[71],"levels":[73],"implication.":[75]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}