{"id":"https://openalex.org/W2057628701","doi":"https://doi.org/10.1305/ndjfl/1093883516","title":"The $n$-adic first-order undefinability of the Geach formula.","display_name":"The $n$-adic first-order undefinability of the Geach formula.","publication_year":1981,"publication_date":"1981-10-01","ids":{"openalex":"https://openalex.org/W2057628701","doi":"https://doi.org/10.1305/ndjfl/1093883516","mag":"2057628701"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093883516","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093883516","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-22/issue-4/The-n-adic-first-order-undefinability-of-the-Geach-formula/10.1305/ndjfl/1093883516.pdf","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":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-22/issue-4/The-n-adic-first-order-undefinability-of-the-Geach-formula/10.1305/ndjfl/1093883516.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108559612","display_name":"R. E. Jennings","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"R. E. Jennings","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057761355","display_name":"D. K. Johnston","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. K. Johnston","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5062983076","display_name":"Peter \u039a. Schotch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. K. Schotch","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108559612"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5578,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.64512547,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"22","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.973800003528595,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.973800003528595,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9682999849319458,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9483000040054321,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.7507228851318359},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.6626022458076477},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6213228106498718},{"id":"https://openalex.org/keywords/sentence","display_name":"Sentence","score":0.5394481420516968},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5305889844894409},{"id":"https://openalex.org/keywords/deontic-logic","display_name":"Deontic logic","score":0.4912835955619812},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.47496339678764343},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.46725699305534363},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38845446705818176},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35799285769462585},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.33575379848480225},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20875298976898193},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.2005361020565033},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.1802503764629364},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.04452008008956909}],"concepts":[{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.7507228851318359},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.6626022458076477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6213228106498718},{"id":"https://openalex.org/C2777530160","wikidata":"https://www.wikidata.org/wiki/Q41796","display_name":"Sentence","level":2,"score":0.5394481420516968},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5305889844894409},{"id":"https://openalex.org/C6377922","wikidata":"https://www.wikidata.org/wiki/Q302542","display_name":"Deontic logic","level":2,"score":0.4912835955619812},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.47496339678764343},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.46725699305534363},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38845446705818176},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35799285769462585},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.33575379848480225},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20875298976898193},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.2005361020565033},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.1802503764629364},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.04452008008956909},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093883516","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093883516","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-22/issue-4/The-n-adic-first-order-undefinability-of-the-Geach-formula/10.1305/ndjfl/1093883516.pdf","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/1093883516","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093883516","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":{"id":"doi:10.1305/ndjfl/1093883516","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093883516","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-22/issue-4/The-n-adic-first-order-undefinability-of-the-Geach-formula/10.1305/ndjfl/1093883516.pdf","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"},"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2057628701.pdf","grobid_xml":"https://content.openalex.org/works/W2057628701.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W2019891739","https://openalex.org/W2068608086","https://openalex.org/W2078695050","https://openalex.org/W6655369177","https://openalex.org/W6670354915"],"related_works":["https://openalex.org/W95169359","https://openalex.org/W2965429290","https://openalex.org/W2005488736","https://openalex.org/W3022720326","https://openalex.org/W17021890","https://openalex.org/W4381280559","https://openalex.org/W2391090893","https://openalex.org/W2607436957","https://openalex.org/W3021433804","https://openalex.org/W1501413178"],"abstract_inverted_index":{"By":[0],"adopting":[1],"natural":[2],"generalizations":[3],"of":[4],"relational":[5,8],"frame":[6,35],"and":[7],"model":[9],"we":[10,15],"showed":[11,16],"in":[12,41],"In":[13],"effect,":[14],"there":[17,23],"that":[18,31],"for":[19,32],"n":[20],">":[21],"2,":[22],"is":[24],"no":[25],"n-adic":[26],"first-order":[27,43],"sentence":[28],"p":[29],"such":[30],"every":[33],"n-ary":[34],"F,F":[36],"^D":[37],"iff":[38],"F":[39],"^(3":[40],"the":[42],"sense.":[44]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}