default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Bulletin of Symbolic Logic, Volume 23
Volume 23, Number 1, March 2017
- W. Hugh Woodin:
In Search of ultimate-l the 19th Midrasha Mathematicae Lectures. 1-109
- Sean D. Cox:
Omer Ben-Neria, The structure of the Mitchell order-I. Israel Journal of Mathematics vol. 214 (2016), no. 2, pp. 945-982. - Omer Ben-Neria, The structure of the Mitchell order-II. Annals of Pure and Applied Logic, vol. 166 (2015), no. 12, pp. 1407-1432. - Sy-David Friedman and Menachem Magidor, The number of normal measures. Journal of Symbolic Logic, vol. 74 (2009), no. 3, pp. 1069-1080. 110-112 - Damir D. Dzhafarov
:
Robert I. Soare, Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, xxxvi + 263 pp. 113-115 - Antoine Chambert-Loir:
G.O. Jones and A.J. Wilkie, editors, O-Minimality and Diophantine Geometry. London Mathematical Society Lecture Note Series, vol. 421, Cambridge University Press, 2015. xii + 221 pp. 115-117 - H. Jerome Keisler:
Maryanthe Malliaris and Saharon Shelah, Cofinality spectrum problems in model theory, set theory and general topology . Journal of the American Mathematical Society, vol. 29 (2016), pp. 237-297. - Maryanthe Malliaris and Saharon Shelah, Existence of optimal ultrafilters and the fundamental complexity of simple theories. Advances in Mathematics, vol. 290 (2016), pp. 614-681. - Maryanthe Malliaris and Saharon Shelah, Keisler's order has infinitely many classes. Israel Journal of Mathematics, to appear, https://math.uchicago.edu/∼mem/. 117-121
- Wim Veldman:
In Memoriam: Walter (Wouter) van Stigt (1927-2015). 122-123
Volume 23, Number 2, June 2017
- Omar León Sánchez, Anand Pillay:
Some Definable Galois Theory and Examples. 145-159 - Mushfeq Khan, Joseph S. Miller:
Forcing with Bushy Trees. 160-180 - Davide Rinaldi, Peter Schuster, Daniel Misselbeck-Wessel:
Eliminating Disjunctions by Disjunction Elimination. 181-200
- Martino Lupini:
I. Ben Yaacov, J. Melleray, and T. Tsankov, Metrizable universal minimal flows of Polish groups have a comeagre orbit.Geometric and Functional Analysis, vol. 27 (2017), no. 1, pp. 67-77. - J. Melleray, L. Nguyen Van Thé, and T. Tsankov, Polish groups with metrizable universal minimal flows. International Mathematics Research Notices, vol. 2016, no. 5, pp. 1285-1307. 201-203 - Kamal Lodaya:
Stéphane Demri, Valentin Goranko, and Martin Lange, Temporal Logics in Computer Science: Finite-state Systems, Cambridge Tracts in Theoretical Computer Science, vol. 58, Cambridge University Press, Cambridge, 2016, viii + 744 pp. 203-204
Volume 23, Number 3, September 2017
- Joan Rand Moschovakis:
Intuitionistic Analysis at the End of Time. 279-295 - Ross T. Brady:
Metavaluations. 296-323 - Dusan Repovs, Lyubomyr Zdomskyy:
Products of Hurewicz Spaces in the Laver Model. 324-333
- Anush Tserunyan:
C. T. Conley and B. D. Miller, A bound on measurable chromatic numbers of locally finite Borel graphs . Mathematical Research Letters, vol. 23, no. 6 (2016), pp. 1633-1644. 334-336
- Charles Parsons, Wilfried Sieg:
In Memoriam: Solomon Feferman (1928-2016). 337-344
Volume 23, Number 4, December 2017
- Zlatan Damnjanovic:
Mutual interpretability of Robinson Arithmetic and Adjunctive Set Theory with Extensionality. 381-404 - Pavel Pudlák:
Incompleteness in the finite Domain. 405-441 - Timo Beringer, Thomas Schindler:
A Graph-Theoretic Analysis of the Semantic Paradoxes. 442-492
- Luc Segoufin:
M. Grohe, Descriptive Complexity, Canonisation, and Definable Graph Structure Theory, Cambridge University Press, Cambridge, 2017, x + 544 pp. 493-494
- Owen Griffiths, Alexander C. Paseau:
Isomorphism invariance and Overgeneration - Corrigendum. 546
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 2026-05-20 23:13 CEST 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:
