default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArchive for Mathematical Logic, Volume 54
Volume 54, Numbers 1-2, February 2015
- Albert Atserias, Moritz Müller:
Partially definable forcing and bounded arithmetic. 1-33 - Milos S. Kurilic:
Isomorphic and strongly connected components. 35-48 - Jeffry L. Hirst, Noah A. Hughes:
Reverse mathematics and marriage problems with unique solutions. 49-57 - Serikzhan A. Badaev
, Manat Mustafa, Andrea Sorbi:
Friedberg numberings in the Ershov hierarchy. 59-73 - Kentaro Sato:
Full and hat inductive definitions are equivalent in NBG. 75-112 - Samuel A. Alexander:
Arithmetical algorithms for elementary patterns. 113-132 - Luz María García-Ávila:
A forcing notion related to Hindman's theorem. 133-159 - John Krueger:
Adding a club with finite conditions, Part II. 161-172 - Daniel W. Cunningham:
Strong partition cardinals and determinacy in $${K(\mathbb{R})}$$ K ( R ). 173-192 - Jeroen Van der Meeren, Michael Rathjen, Andreas Weiermann:
Well-partial-orderings and the big Veblen number. 193-230 - Andrea Medini, Lyubomyr Zdomskyy:
Between Polish and completely Baire. 231-245 - Juan Felipe Carmona:
Forking geometry on theories with an independent predicate. 247-255
Volume 54, Numbers 3-4, May 2015
- Norman Lewis Perlmutter:
The large cardinals between supercompact and almost-huge. 257-289 - Pierre Matet:
Ideals on Pκ(λ) associated with games of uncountable length. 291-328 - Takayuki Kihara, Kenshi Miyabe:
Unified characterizations of lowness properties via Kolmogorov complexity. 329-358 - Emil Jerábek:
Open induction in a bounded arithmetic for TC0. 359-394 - Pierre Matet:
Two-cardinal diamond and games of uncountable length. 395-412 - Michal Garlík:
A new proof of Ajtai's completeness theorem for nonstandard finite structures. 413-424 - Carl Mummert, Alaeddine Saadaoui, Sean Sovine:
The modal logic of Reverse Mathematics. 425-437 - William Chen, Itay Neeman:
Square principles with tail-end agreement. 439-452 - Peter Holy:
Σ 1-wellorders without collapsing. 453-462 - Arthur W. Apter:
A universal indestructibility theorem compatible with level by level equivalence. 463-470 - Toshiyasu Arai:
Predicatively computable functions on sets. 471-485 - Paola D'Aquino, Julia F. Knight, Karen M. Lange:
Erratum to: Limit computable integer parts. 487-489
Volume 54, Numbers 5-6, August 2015
- Brent Cody, Moti Gitik, Joel David Hamkins, Jason A. Schanker:
The least weakly compact cardinal can be unfoldable, weakly measurable and nearly θ-supercompact. 491-510 - Domenico Zambella:
Elementary classes of finite VC-dimension. 511-520 - Achilles Beros:
A DNC function that computes no effectively bi-immune set. 521-530 - Toshiyasu Arai:
Intuitionistic fixed point theories over set theories. 531-553 - Michal Machura, Andrzej Starosolski:
How high can Baumgartner's I-ultrafilters lie in the P-hierarchy? 555-569 - Vera Koponen:
Typical automorphism groups of finite nonrigid structures. 571-586 - Laura R. Phillips:
Positive primitive formulae of modules over rings of semi-algebraic functions on a curve. 587-614 - Bruno Bauwens:
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs. 615-629 - Alf Dolich, Julia F. Knight, Karen M. Lange, David Marker:
Representing Scott sets in algebraic settings. 631-637 - Hiroshi Sakai:
Simple proofs of SCH from reflection principles without using better scales. 639-647 - Robert Ralowski:
Families of sets with nonmeasurable unions with respect to ideals defined by trees. 649-658 - Yann Pequignot:
A Wadge hierarchy for second countable spaces. 659-683 - Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the parameterized complexity of non-monotonic logics. 685-710 - Vladimir Kanovei, Vassily A. Lyubetsky:
A definable E 0 class containing no definable elements. 711-723 - Gunter Fuchs:
The stationarity of the collection of the locally regulars. 725-739
Volume 54, Numbers 7-8, November 2015
- Vedran Cacic, Vjekoslav Kovac:
On the share of closed IL formulas which are also in GL. 741-767 - Pavel Pudlák:
On the complexity of finding falsifying assignments for Herbrand disjunctions. 769-783 - Radim Belohlávek, Vilém Vychodil:
A logic of graded attributes. 785-802 - Miroslav Repický:
Sets of points of symmetric continuity. 803-824 - Michal Deco:
Strongly unbounded and strongly dominating sets of reals generalized. 825-838 - Milos S. Kurilic:
Different similarities. 839-859 - Makoto Fujiwara, Hajime Ishihara, Takako Nemoto:
Some principles weaker than Markov's principle. 861-870 - Wesley Calvert:
PAC learning, VC dimension, and the arithmetic hierarchy. 871-883 - Mohsen Khani:
The field of reals with a predicate for the real algebraic numbers and a predicate for the integer powers of two. 885-898 - Ludovic Patey:
Ramsey-type graph coloring and diagonal non-computability. 899-914 - Isaac Goldbring, Henry Towsner:
Dividing and weak quasi-dimensions in arbitrary theories. 915-920 - Annika Siders:
Normalization proof for Peano Arithmetic. 921-940 - Roland Sh. Omanadze:
Some properties of r-maximal sets and Q 1, N -reducibility. 941-959 - Yong Cheng, Victoria Gitman:
Indestructibility properties of remarkable cardinals. 961-984
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 2025-12-04 01:27 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:
