default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArchive for Mathematical Logic, Volume 65
Volume 65, Number 1, January 2026
- Francisco Santiago Nieto-de la Rosa
, Ulises Ariet Ramos-García, Ana Lucia Vargas Sandoval, Dick de Jongh:
Extending antichains in the poset $\langle [\omega ]^{<\omega },\subseteq \rangle $. 1-12 - Hannes Jakob:
Slender trees and the approximation property. 13-40 - Serhii Bardyla, Jaroslav Supina, Lyubomyr Zdomskyy:
Open filters and measurable cardinals. 41-70 - Brian Tyrrell-Nic Dhonncha:
On Hilbert's "geometric" tenth problem for odd characteristic function fields. 71-97 - Eilon Bilinsky, Moti Gitik:
On ultrafilters in ZF models and indecomposable ultrafilters. 99-108 - Gunter Fuchs, Benjamin Goodman:
Bounded forcing axioms and weak genericity. 109-129 - Samuel Zamour:
Correction: Symétrons et K-boucles ømega-stables. 131
Volume 65, Number 2, February 2026
- Masato Fujita:
Constructible structures and constructible open cores. 133-149 - Krzysztof Kowitz, Jacek Tryba:
Homogeneity, P-like properties of ideals and orders between ideals. 151-175 - Matteo Casarosa:
Nonvanishing derived limits without scales. 177-191 - Marcin Michalski, Robert Ralowski, Szymon Zeberski:
Around the Eggleston Theorem. 193-212 - Sirun Song, Liang Yu:
On the hausdorff dimension of maximal chains and antichains of turing and hyperarithmetic degrees. 213-238 - Stefano Baratella:
Results in model theory for Riesz-valued structures. 239-273 - Dag Normann, Sam Sanders:
On sequential theorems in Reverse Mathematics. 275-295
Volume 65, Number 3, March 2026
- Benno van den Berg:
Apartness and the elimination of strong forms of extensionality. 297-317 - Makoto Fujiwara:
On the hierarchy of linearity axioms. 319-331 - Kenji Saotome, Koji Nakazawa, Daisuke Kimura, Ayumu Kawasaki:
Failure of cut-elimination in cyclic-proof systems of logic of bunched implications with inductive propositions. 333-362 - Vera Koponen, Felix Weitkämper:
A general approach to asymptotic elimination of aggregation functions and generalized quantifiers. 363-390 - Carles Cardó:
Logical complexity of reducts of elementary algebraic classes. 391-409 - Stevo Todorcevic, Shihao Xiong:
Limits on forcing axioms at ømega 2 compatible with the continuum hypothesis. 411-423 - Federico Almiñana, Gustavo Pelaitay:
Characterization of subdirectly irreducible heyting algebras with negative tense operators. 425-449
Volume 65, Number 4, April 2026
- Bruno Fernando Aceves-Martínez, David J. Fernández-Bretón, L. F. Romero-García, Luis F. Villagómez-Canela:
The adjacent Hindman's Theorem and the ℤ-Ramsey's Theorem. 451-463 - Yair Hayut, Asaf Karagila:
Small measurable cardinals. 465-475 - Michael C. Laskowski, Danielle S. Ulrich:
Borel complexity of families of finite equivalence relations via large cardinals. 477-508 - Moti Gitik, Sittinon Jirattikansakul:
Another method to add a closed unbounded set of former regulars. 509-529 - Yusuke Hayashi:
Dominating numbers at singular cardinals. 531-544 - Toshimichi Usuba:
Monotonicity of the ultrafilter number function. 545-568
Volume 65, Number 5, June 2026
- Anna De Mase:
Relative model completeness of henselian valued fields with finite ramification and various value groups. 569-591 - Satoru Niki:
Correspondence of Contradictions in the Constructive Connexive Calculus C. 593-629 - Lorenz Halbeisen, Silvan Horvath, Tan Özalp:
There may be exactly nQ-points. 631-643 - Jorge Antonio Cruz Chapital, Tatsuya Goto, Yusuke Hayashi, Takashi Yamazoe:
Game-theoretic variants of splitting number. 645-663 - Juan P. Aguilera, Thibaut Kouptchinsky:
Binary choice games and arithmetical comprehension. 665-674 - Makoto Fujiwara:
On the Σ 01-fragments of the Kreisel-Putnam axiom and two variants of the linearity axiom in intuitionistic arithmetic and analysis. 675-690
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-08-17 23:44 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
