default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Bulletin of Symbolic Logic, Volume 30
Volume 30, Number 1, 2024
- BSL volume 30 issue 1 Cover and Front matter. 1-
- BSL volume 30 issue 1 Cover and Back matter. 1-
- David Fernández-Duque
, Andreas Weiermann:
A Walk with Goodstein. 1-19 - Jan Krajícek:
On the existence of Strong Proof Complexity Generators. 20-40 - Arnon Avron:
Poincaré-Weyl's Predicativity: going beyond. 41-91 - Gabriel Uzquiano:
Sam Roberts. Pluralities as Nothing Over and Above. Journal of Philosophy, vol. CXIX (2022), no. 8, pp. 405-424. 92-93 - 2023 EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC LOGIC COLLOQUIUM 2023 University of Milan Milan, Italy June 5 - June 9, 2023. 94-139
- SEVENTEENTH ASIAN LOGIC CONFERENCE AN OFFICIAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC Nankai University Tianjin, China October 9-13, 2023. 140-151
- 2023 MEETING OF THE AUSTRALASIAN ASSOCIATION FOR LOGIC University of Queensland Brisbane, Australia 9-10 November, 2023. 152-165
- 2024 WINTER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC San Francisco, California Joint Mathematics Meeting January 3-6, 2024. 166-171
- 2024 SPRING MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC The Sheraton Times Square, New York, NY Eastern APA Meeting January 15-18, 2024. 172-175
- Association for Symbolic Logic. 176-180
Volume 30, Number 2, 2024
- Isaac Goldbring, Bradd Hart:
The Universal Theory of the Hyperfinite II $_1$ factor is not Computable. 181-198 - Adam R. Day, Noam Greenberg, Matthew Harrison-Trainor, Dan Turetsky:
Iterated Priority Arguments in Descriptive Set Theory. 199-226 - Constantin C. Brîncus:
Categorical Quantification. 227-252 - Petr Cintula, George Metcalfe, Naomi Tokuda:
One-variable Fragments of First-order Logics. 253-278 - Takehiko Gappo:
COMPACTNESS OF AND STRONG AXIOMS OF DETERMINACY - N. Trang, Structure theory ofand its applications.Journal of Symbolic Logic, vol. 80 (2015), no. 1, pp. 29-55. - N. Trang, Supercompactness can be equiconsistent with measurability. Notre Dame Journal of Formal Logic, vol. 62 (2021), no. 4, pp. 593-618. - N. Trang and T. Wilson, Determinacy from strong compactness of . Annals of Pure and Applied Logic, vol. 172 (2021), no. 6, Article no. 102944, 30pp. - D. Ikegami and N. Trang, On supercompactness of $\omega _1$, Advances in Mathematical Logic (T. Arai, M. Kikuchi, S. Kuroda, M. Okada, T. Yorioka, editors), Springer, Proceedings Mathematics & Statistics, Singapore, 369, 2021, pp. 27-45. 279-282 - Daniele Molinini:
Christopher Pincock. Mathematics and Explanation. Elements in the Philosophy of Mathematics. Cambridge University Press, Cambridge, UK, 2023, 80 pp. 282-284 - Martina Iannella:
From real-life to very strong axioms. Classification problems in Descriptive Set Theory and regularity properties in Generalized Descriptive Set Theory. 285-286 - Vittorio Cipriani:
Many problems, different frameworks: classification of problems in computable analysis and algorithmic learning theory. 287-288 - Nicholas Pischke:
Proof-Theoretical Aspects of Nonlinear and Set-Valued Analysis. 288-289 - PROOF SOCIETY AUTUMN SCHOOL AND WORKSHOP 2022 CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Utrecht, The Netherlands November 7-12, 2022. 290-291
- WORKSHOP: FINITE MODEL THEORY AND MANY-VALUED LOGIC: CHALLENGES AND INTERACTIONS CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Brisbane, Australia (online) November 10-12, 2022. 292
- MODEL THEORY CONFERENCE IN CELEBRATION OF LUDOMIR NEWELSKI'S 60TH BIRTHDAY CO-SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC Bedlewo, Poland December 17-21, 2022. 293
- Notices. 294-301
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-21 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
