Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Mathematical Logic, Volume 21
Volume 21, Number 1, April 2021
- Daniela A. Amato, Gregory L. Cherlin, H. Dugald Macpherson:
Metrically homogeneous graphs of diameter 3. 2050020:1-2050020:106 - Vassilios Gregoriades, Takayuki Kihara
, Keng Meng Ng:
Turing degrees in Polish spaces and decomposability of Borel functions. 2050021:1-2050021:41 - Tingxiang Zou:
Pseudofinite difference fields and counting dimensions. 2050022:1-2050022:28 - Mohammad Golshani, Saharon Shelah:
Specializing trees and answer to a question of Williams. 2050023:1-2050023:20 - Will Boney, Michael J. Lieberman:
Tameness, powerful images, and large cardinals. 2050024:1-2050024:18 - Francesco Mangraviti, Luca Motto Ros:
A descriptive Main Gap Theorem. 2050025:1-2050025:40 - William Chan:
Bounds on Scott ranks of some polish metric spaces. 2150001:1-2150001:23 - Chris Lambie-Hanson, Assaf Rinot:
Knaster and friends II: The C-sequence number. 2150002:1-2150002:54
Volume 21, Number 2, August 2021
- Rahman Mohammadpour, Boban Velickovic:
Guessing models and the approachability ideal. 2150003:1-2150003:35 - Artem Chernikov, Sergei Starchenko:
Model-theoretic Elekes-Szabó in the strongly minimal case. 2150004:1-2150004:20 - Raphaël Carroy, Benjamin D. Miller, Zoltán Vidnyánszky:
On the existence of small antichains for definable quasi-orders. 2150005:1-2150005:10 - Paul McKenney, Alessandro Vignati:
Forcing axioms and coronas of C∗-algebras. 2150006:1-2150006:73 - Antongiulio Fornasiero, Elliot Kaplan:
Generic derivations on o-minimal structures. 2150007:1-2150007:45 - Farmer Schlutzenberg:
Iterability for (transfinite) stacks. 2150008:1-2150008:117 - Gabriel Conant, Anand Pillay:
Pseudofinite groups and VC-dimension. 2150009:1-2150009:23 - Alex Kruckman, Chieu-Minh Tran, Erik Walsberg:
Interpolative fusions. 2150010:1-2150010:38 - Friedrich Wehrung:
From noncommutative diagrams to anti-elementary classes. 2150011:1-2150011:56 - Juliette Kennedy, Menachem Magidor, Jouko Väänänen:
Inner models from extended logics: Part 1. 2150012:1-2150012:53
- Libor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker:
Erratum: Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures. 2192001:1
Volume 21, Number 3, December 2021
- Benoit Monin, Ludovic Patey:
The weakness of the pigeonhole principle under hyperarithmetical reductions. 2150013:1-2150013:41 - Ali Enayat, Vladimir Kanovei:
An unpublished theorem of Solovay on OD partitions of reals into two non-OD parts, revisited. 2150014:1-2150014:22 - Shlomo Eshel, Itay Kaplan:
On uniform definability of types over finite sets for NIP formulas. 2150015:1-2150015:13 - Christian d'Elbée:
Generic expansions by a reduct. 2150016:1-2150016:44 - Gabriel Goldberg:
The Ultrapower Axiom and the GCH. 2150017:1-2150017:22 - Martin Goldstern, Jakob Kellner, Diego Alejandro Mejía, Saharon Shelah:
Controlling cardinal characteristics without adding reals. 2150018:1-2150018:29 - Manuel Bodirsky, Thomas Quinn-Gregson:
Solving equation systems in ω-categorical algebras. 2150020:1-2150020:31 - Uri Andrews, Matthew Harrison-Trainor, Noah Schweber:
The property "arithmetic-is-recursive" on a cone. 2150021:1-2150021:18 - Márk Poór:
Answer to a question of Rosłanowski and Shelah. 2150022:1-2150022:42 - Gunter Fuchs:
Canonical fragments of the strong reflection principle. 2150023:1-2150023:58
a service of 
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-06-18 21:18 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:
