{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T05:15:18Z","timestamp":1735881318660,"version":"3.32.0"},"reference-count":15,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["The Review of Symbolic Logic"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this note we study a counterpart in predicate logic of the notion of <jats:italic>logical friendliness<\/jats:italic>, introduced into propositional logic in [15]. The result is a new consequence relation for predicate languages with equality using first-order models. While compactness, interpolation and axiomatizability fail dramatically, several other properties are preserved from the propositional case. Divergence is diminished when the language does not contain equality with its standard interpretation.<\/jats:p>","DOI":"10.1017\/s175502032300014x","type":"journal-article","created":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T07:27:04Z","timestamp":1686122824000},"page":"1055-1069","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["FIRST-ORDER FRIENDLINESS"],"prefix":"10.1017","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5597-6794","authenticated-orcid":false,"given":"GUILLERMO","family":"BADIA","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7435-9433","authenticated-orcid":false,"given":"DAVID","family":"MAKINSON","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2023,6,7]]},"reference":[{"key":"S175502032300014X_r4","doi-asserted-by":"publisher","DOI":"10.2307\/2272253"},{"volume-title":"Introduction to Metamathematics","year":"1952","author":"Kleene","key":"S175502032300014X_r11"},{"key":"S175502032300014X_r9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511551574"},{"key":"S175502032300014X_r8","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/7.6.717"},{"volume-title":"Solvable Cases of the Decision Problem","year":"1954","author":"Ackermann","key":"S175502032300014X_r1"},{"key":"S175502032300014X_r12","first-page":"812","article-title":"What is a resplendent structure?","volume":"58","author":"Kossak","year":"2011","journal-title":"Notices of the American Mathematical Society"},{"key":"S175502032300014X_r13","doi-asserted-by":"publisher","DOI":"10.1111\/j.1755-2567.1969.tb00356.x"},{"key":"S175502032300014X_r14","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71100-5"},{"volume-title":"Beginning Model Theory: The Completeness Theorem and some Consequences","year":"1977","author":"Bridge","key":"S175502032300014X_r5"},{"key":"S175502032300014X_r3","doi-asserted-by":"publisher","DOI":"10.1017\/jsl.2023.2"},{"key":"S175502032300014X_r15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7643-8354-1_11"},{"volume-title":"A Method in Proofs of Undefinability","year":"1959","author":"de Bouv\u00e8re","key":"S175502032300014X_r7"},{"key":"S175502032300014X_r6","doi-asserted-by":"publisher","DOI":"10.2307\/2963593"},{"key":"S175502032300014X_r10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00660898"},{"key":"S175502032300014X_r2","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19750210153"}],"container-title":["The Review of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S175502032300014X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T10:53:36Z","timestamp":1735815216000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S175502032300014X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,7]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["S175502032300014X"],"URL":"https:\/\/doi.org\/10.1017\/s175502032300014x","relation":{},"ISSN":["1755-0203","1755-0211"],"issn-type":[{"type":"print","value":"1755-0203"},{"type":"electronic","value":"1755-0211"}],"subject":[],"published":{"date-parts":[[2023,6,7]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. Published by Cambridge University Press on behalf of The Association for Symbolic Logic","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}