<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:admin="http://webns.net/mvcb/" xmlns:prism="http://prismstandard.org/namespaces/basic/2.0/"><channel rdf:about="https://cambridge.org/core/rss/product/id/F7268973893D3981F1B17A2E10347229"><title><![CDATA[Bulletin of Symbolic Logic]]></title><description><![CDATA[&lt;i&gt;The Bulletin of Symbolic Logic&lt;/i&gt; was established in 1995 by the Association for Symbolic Logic to provide a journal of high standards that would be both accessible and of interest to as wide an audience as possible. It is designed to cover all areas within the purview of the ASL: mathematical logic and its applications, philosophical and non-classical logic and its applications, history and philosophy of logic, and philosophy and methodology of mathematics.&lt;br&gt;&lt;i&gt;The Bulletin of Symbolic Logic&lt;/i&gt; primarily publishes two types of papers: Articles presenting topics of broad interest in a way that is accessible to a large audience; and Communications which are announcements of important new results and ideas in any aspect of logic.&lt;br&gt;&lt;i&gt;The Bulletin&lt;/i&gt; also publishes a Reviews Section (edited by Graham Leach-Kouse), a Thesis Abstract Section (edited by Christian Rosendal) and reports of ASL meetings, Notices of interest to logicians, and the annual listing of ASL officers, Council members, committee members, and individual and institutional members of the Association.]]></description><link>https://www.cambridge.org/core/journals/bulletin-of-symbolic-logic/latest-issue</link><prism:publicationName>Bulletin of Symbolic Logic</prism:publicationName><prism:issn>10798986</prism:issn><prism:eissn>19435894</prism:eissn><admin:generatorAgent rdf:resource="https://www.cambridge.org/core"/><dc:publisher>Cambridge University Press</dc:publisher><image rdf:resource="https://www.cambridge.org/core/cambridge-core/public/images/favicon.ico"/><items><rdf:Seq><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.27?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.26?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.30?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.24?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.31?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.32?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.33?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.40?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.29?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.46?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.42?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.49?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.47?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.48?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.44?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.41?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2024.61?rft_dat=source%3Ddrss"/><rdf:li rdf:resource="https://dx.doi.org/10.1017/bsl.2025.4?rft_dat=source%3Ddrss"/></rdf:Seq></items></channel><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.27?rft_dat=source%3Ddrss"><title><![CDATA[A CLUB GUESSING TOOLBOX I]]></title><description><![CDATA[<div class="abstract" data-abstract-type="normal"><p>Club guessing principles were introduced by Shelah as a weakening of Jensen’s diamond. Most spectacularly, they were used to prove Shelah’s <span class='inlineFormula'><span class='alternatives'><img class='inline-graphic mathjax-alternative mathjax-alt-graphic mathjax-off' data-mimesubtype='png' data-type='' src='http://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121002348354-0512:S1079898624000271:S1079898624000271_inline1.png'><span class='mathjax-tex-wrapper' data-mathjax-type='texmath'></span></span></span> bound on <span class='inlineFormula'><span class='alternatives'><img class='inline-graphic mathjax-alternative mathjax-alt-graphic mathjax-off' data-mimesubtype='png' data-type='' src='http://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250121002348354-0512:S1079898624000271:S1079898624000271_inline2.png'><span class='mathjax-tex-wrapper' data-mathjax-type='texmath'></span></span></span>. These principles have found many other applications: in cardinal arithmetic and PCF theory; in the construction of combinatorial objects on uncountable cardinals such as Jónsson algebras, strong colourings, Souslin trees, and pathological graphs; to the non-existence of universals in model theory; to the non-existence of forcing axioms at higher uncountable cardinals; and many more.</p><p>In this paper, the first part of a series, we survey various forms of club guessing that have appeared in the literature, and then systematically study the various ways in which a club guessing sequence can be improved, especially in the way the frequency of guessing is calibrated.</p><p>We include an expository section intended for those unfamiliar with club guessing and which can be read independently of the rest of the article.</p></div>]]></description><link>https://dx.doi.org/10.1017/bsl.2024.27?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.27</dc:identifier><dc:title>A CLUB GUESSING TOOLBOX I</dc:title><prism:startingPage>303</prism:startingPage><prism:endingPage>361</prism:endingPage><prism:doi>10.1017/bsl.2024.27</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.27?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date><dc:creator>INAMDAR, TANMAY</dc:creator><dc:creator>RINOT, ASSAF</dc:creator></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.26?rft_dat=source%3Ddrss"><title><![CDATA[POUR-EL’S LANDSCAPE]]></title><description><![CDATA[<div class="abstract" data-abstract-type="normal"><p>We study the effective versions of several notions related to incompleteness, undecidability, and inseparability along the lines of Pour-El’s insights. Firstly, we strengthen Pour-El’s theorem on the equivalence between effective essential incompleteness and effective inseparability. Secondly, we compare the notions obtained by restricting that of effective essential incompleteness to intensional finite extensions and extensional finite extensions. Finally, we study the combination of effectiveness and hereditariness, and prove an adapted version of Pour-El’s result for this combination.</p></div>]]></description><link>https://dx.doi.org/10.1017/bsl.2024.26?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.26</dc:identifier><dc:title>POUR-EL’S LANDSCAPE</dc:title><prism:startingPage>362</prism:startingPage><prism:endingPage>397</prism:endingPage><prism:doi>10.1017/bsl.2024.26</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.26?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2024-05-09</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2024-05-09</dc:date><dc:creator>KURAHASHI, TAISHI</dc:creator><dc:creator>VISSER, ALBERT</dc:creator></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.30?rft_dat=source%3Ddrss"><title><![CDATA[A NOTE ON CONTINUOUS FUNCTIONS ON METRIC SPACES]]></title><description><![CDATA[<div class="abstract" data-abstract-type="normal"><p>Continuous functions on the unit interval are relatively <span class='italic'>tame</span> from the logical and computational point of view. A similar behaviour is exhibited by continuous functions on compact metric spaces <span class='italic'>equipped with a countable dense subset</span>. It is then a natural question what happens if we omit the latter ‘extra data’, i.e., work with ‘unrepresented’ compact metric spaces. In this paper, we study basic third-order statements about continuous functions on such unrepresented compact metric spaces in Kohlenbach’s higher-order Reverse Mathematics. We establish that some (very specific) statements are classified in the (second-order) Big Five of Reverse Mathematics, while most variations/generalisations are not provable from the latter, and much stronger systems. Thus, continuous functions on unrepresented metric spaces are ‘wild’, though ‘more tame’ than (slightly) discontinuous functions on the reals.</p></div>]]></description><link>https://dx.doi.org/10.1017/bsl.2024.30?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.30</dc:identifier><dc:title>A NOTE ON CONTINUOUS FUNCTIONS ON METRIC SPACES</dc:title><prism:startingPage>398</prism:startingPage><prism:endingPage>420</prism:endingPage><prism:doi>10.1017/bsl.2024.30</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.30?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date><dc:creator>SANDERS, SAM</dc:creator></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.24?rft_dat=source%3Ddrss"><title><![CDATA[Johnathan Kirby. An Invitation to Model Theory. Cambridge University Press, Cambridge, UK, 2019, xiv + 182 pp.]]></title><link>https://dx.doi.org/10.1017/bsl.2024.24?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.24</dc:identifier><dc:title>Johnathan Kirby. An Invitation to Model Theory. Cambridge University Press, Cambridge, UK, 2019, xiv + 182 pp.</dc:title><prism:startingPage>421</prism:startingPage><prism:endingPage>422</prism:endingPage><prism:doi>10.1017/bsl.2024.24</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.24?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date><dc:creator>Martin-Pizarro, A.</dc:creator></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.31?rft_dat=source%3Ddrss"><title><![CDATA[Edwin Mares. The Logic of Entailment and its History. Cambridge University Press, Cambridge, UK, 2024, xv + 264 pp.]]></title><link>https://dx.doi.org/10.1017/bsl.2024.31?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.31</dc:identifier><dc:title>Edwin Mares. The Logic of Entailment and its History. Cambridge University Press, Cambridge, UK, 2024, xv + 264 pp.</dc:title><prism:startingPage>422</prism:startingPage><prism:endingPage>424</prism:endingPage><prism:doi>10.1017/bsl.2024.31</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.31?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date><dc:creator>Øgaard, Tore Fjetland</dc:creator></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.32?rft_dat=source%3Ddrss"><title><![CDATA[Samuele Iaquinto and Giuliano Torrengo. Fragmenting Reality: An Essay on Passage, Causality and Time. Bloomsbury Academic, London, 2022, x + 208 pp.]]></title><link>https://dx.doi.org/10.1017/bsl.2024.32?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.32</dc:identifier><dc:title>Samuele Iaquinto and Giuliano Torrengo. Fragmenting Reality: An Essay on Passage, Causality and Time. Bloomsbury Academic, London, 2022, x + 208 pp.</dc:title><prism:startingPage>424</prism:startingPage><prism:endingPage>427</prism:endingPage><prism:doi>10.1017/bsl.2024.32</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.32?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date><dc:creator>Azzano, Lorenzo</dc:creator></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.33?rft_dat=source%3Ddrss"><title><![CDATA[Thomas Piecha and Peter Schroeder-Heister. Incompleteness of Intuitionistic Propositional Logic with Respect to Proof-Theoretic Semantics. Studia Logica, vol. 107 (2019), no. 1, pp. 233–246. - Alexander V. Gheorghiu, Tao Gu and David J. Pym. Proof-Theoretic Semantics for Intuitionistic Multiplicative Linear Logic. Automated Reasoning with Analytic Tableaux and Related Methods, Revantha Ramanayake and Josef Urban, Lecture Notes in Computer Science, vol. 14278, Springer, Cham, pp. 367–385. - Hermógenes Oliveira. On Dummett’s Pragmatist Justification Procedure. Erkenntnis, vol. 86 (2021), no. 2, pp. 429–455.]]></title><link>https://dx.doi.org/10.1017/bsl.2024.33?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.33</dc:identifier><dc:title>Thomas Piecha and Peter Schroeder-Heister. Incompleteness of Intuitionistic Propositional Logic with Respect to Proof-Theoretic Semantics. Studia Logica, vol. 107 (2019), no. 1, pp. 233–246. - Alexander V. Gheorghiu, Tao Gu and David J. Pym. Proof-Theoretic Semantics for Intuitionistic Multiplicative Linear Logic. Automated Reasoning with Analytic Tableaux and Related Methods, Revantha Ramanayake and Josef Urban, Lecture Notes in Computer Science, vol. 14278, Springer, Cham, pp. 367–385. - Hermógenes Oliveira. On Dummett’s Pragmatist Justification Procedure. Erkenntnis, vol. 86 (2021), no. 2, pp. 429–455.</dc:title><prism:startingPage>427</prism:startingPage><prism:endingPage>431</prism:endingPage><prism:doi>10.1017/bsl.2024.33</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.33?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date><dc:creator>Stafford, Will</dc:creator></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.40?rft_dat=source%3Ddrss"><title><![CDATA[Manuel Bodirsky. Complexity of Infinite-Domain Constraint Satisfaction. Lecture Notes in Logic, vol. 52. Cambridge University Press, 2021]]></title><link>https://dx.doi.org/10.1017/bsl.2024.40?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.40</dc:identifier><dc:title>Manuel Bodirsky. Complexity of Infinite-Domain Constraint Satisfaction. Lecture Notes in Logic, vol. 52. Cambridge University Press, 2021</dc:title><prism:startingPage>431</prism:startingPage><prism:endingPage>432</prism:endingPage><prism:doi>10.1017/bsl.2024.40</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.40?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date><dc:creator>Krokhin, Andrei</dc:creator></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.29?rft_dat=source%3Ddrss"><title><![CDATA[SAUL KRIPKE (1940–2022)]]></title><description><![CDATA[<div class="abstract" data-abstract-type="normal"><p>Saul Aaron Kripke, the most influential philosopher and logician of his generation, died on September 15, 2022, at the age of 81.</p></div>]]></description><link>https://dx.doi.org/10.1017/bsl.2024.29?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.29</dc:identifier><dc:title>SAUL KRIPKE (1940–2022)</dc:title><prism:startingPage>433</prism:startingPage><prism:endingPage>442</prism:endingPage><prism:doi>10.1017/bsl.2024.29</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.29?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date><dc:creator>ARTEMOV, SERGEI</dc:creator><dc:creator>BURGESS, JOHN P.</dc:creator><dc:creator>FITTING, MELVIN</dc:creator><dc:creator>HATTIANGADI, ANANDI</dc:creator></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.46?rft_dat=source%3Ddrss"><title><![CDATA[THE SECOND INTERNATIONAL CONFERENCE ON HOMOTOPY TYPE THEORY (HoTT 2023) SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Pittsburgh, USA May 22–25, 2023]]></title><link>https://dx.doi.org/10.1017/bsl.2024.46?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.46</dc:identifier><dc:title>THE SECOND INTERNATIONAL CONFERENCE ON HOMOTOPY TYPE THEORY (HoTT 2023) SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Pittsburgh, USA May 22–25, 2023</dc:title><prism:startingPage>443</prism:startingPage><prism:endingPage>443</prism:endingPage><prism:doi>10.1017/bsl.2024.46</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.46?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.42?rft_dat=source%3Ddrss"><title><![CDATA[MODEL THEORY CONFERENCE IN SEOUL CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Seoul, South Korea August 28–30, 2023]]></title><link>https://dx.doi.org/10.1017/bsl.2024.42?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.42</dc:identifier><dc:title>MODEL THEORY CONFERENCE IN SEOUL CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Seoul, South Korea August 28–30, 2023</dc:title><prism:startingPage>444</prism:startingPage><prism:endingPage>444</prism:endingPage><prism:doi>10.1017/bsl.2024.42</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.42?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.49?rft_dat=source%3Ddrss"><title><![CDATA[MODEL THEORY WORKSHOP AND CONFERENCE 2023 CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Wrocław, Poland September 15–23, 2023]]></title><link>https://dx.doi.org/10.1017/bsl.2024.49?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.49</dc:identifier><dc:title>MODEL THEORY WORKSHOP AND CONFERENCE 2023 CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Wrocław, Poland September 15–23, 2023</dc:title><prism:startingPage>445</prism:startingPage><prism:endingPage>445</prism:endingPage><prism:doi>10.1017/bsl.2024.49</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.49?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.47?rft_dat=source%3Ddrss"><title><![CDATA[CONFERENCE: MODEL THEORY AND GROUPS A conference on the occasion of Katrin Tent’s 60th birthday CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Münster, Germany September 25–29, 2023]]></title><link>https://dx.doi.org/10.1017/bsl.2024.47?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.47</dc:identifier><dc:title>CONFERENCE: MODEL THEORY AND GROUPS A conference on the occasion of Katrin Tent’s 60th birthday CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Münster, Germany September 25–29, 2023</dc:title><prism:startingPage>446</prism:startingPage><prism:endingPage>446</prism:endingPage><prism:doi>10.1017/bsl.2024.47</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.47?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.48?rft_dat=source%3Ddrss"><title><![CDATA[THE FOURTEENTH PHD’S-IN-LOGIC INTERNATIONAL CONFERENCE (PHD’S IN LOGIC 2023) CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Granada, Spain October 4–6, 2023]]></title><link>https://dx.doi.org/10.1017/bsl.2024.48?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.48</dc:identifier><dc:title>THE FOURTEENTH PHD’S-IN-LOGIC INTERNATIONAL CONFERENCE (PHD’S IN LOGIC 2023) CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Granada, Spain October 4–6, 2023</dc:title><prism:startingPage>447</prism:startingPage><prism:endingPage>447</prism:endingPage><prism:doi>10.1017/bsl.2024.48</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.48?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.44?rft_dat=source%3Ddrss"><title><![CDATA[AUSTRALASIAN LOGIC COLLOQUIUM CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Brisbane, Australia 6–8 November 2023]]></title><link>https://dx.doi.org/10.1017/bsl.2024.44?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.44</dc:identifier><dc:title>AUSTRALASIAN LOGIC COLLOQUIUM CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Brisbane, Australia 6–8 November 2023</dc:title><prism:startingPage>448</prism:startingPage><prism:endingPage>448</prism:endingPage><prism:doi>10.1017/bsl.2024.44</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.44?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.41?rft_dat=source%3Ddrss"><title><![CDATA[NOTICES]]></title><link>https://dx.doi.org/10.1017/bsl.2024.41?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.41</dc:identifier><dc:title>NOTICES</dc:title><prism:startingPage>449</prism:startingPage><prism:endingPage>454</prism:endingPage><prism:doi>10.1017/bsl.2024.41</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.41?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2024.61?rft_dat=source%3Ddrss"><title><![CDATA[BSL volume 30 issue 3 Cover and Front matter]]></title><link>https://dx.doi.org/10.1017/bsl.2024.61?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2024.61</dc:identifier><dc:title>BSL volume 30 issue 3 Cover and Front matter</dc:title><prism:startingPage>1</prism:startingPage><prism:endingPage>4</prism:endingPage><prism:doi>10.1017/bsl.2024.61</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2024.61?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date></item><item rdf:about="https://dx.doi.org/10.1017/bsl.2025.4?rft_dat=source%3Ddrss"><title><![CDATA[BSL volume 30 issue 3 Cover and Back matter]]></title><link>https://dx.doi.org/10.1017/bsl.2025.4?rft_dat=source%3Ddrss</link><dc:identifier>doi:10.1017/bsl.2025.4</dc:identifier><dc:title>BSL volume 30 issue 3 Cover and Back matter</dc:title><prism:startingPage>1</prism:startingPage><prism:endingPage>2</prism:endingPage><prism:doi>10.1017/bsl.2025.4</prism:doi><prism:url>https://dx.doi.org/10.1017/bsl.2025.4?rft_dat=source%3Ddrss</prism:url><prism:publicationDate>2025-01-21</prism:publicationDate><prism:volume></prism:volume><prism:number></prism:number><prism:publicationTitle>Bulletin of Symbolic Logic</prism:publicationTitle><dc:date>2025-01-21</dc:date></item></rdf:RDF>