default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArchive for Mathematical Logic, Volume 50
Volume 50, Numbers 1-2, February 2011
- Arnold W. Miller:
A dedekind finite borel set. 1-17 - Mário J. Edmundo
, Gareth O. Jones, Nicholas J. Peatfield:
Invariance results for definable extensions of groups. 19-31 - Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu, Guohua Wu:
A superhigh diamond in the c.e. tt-degrees. 33-44 - José Gil-Férez:
Representations of structural closure operators. 45-73 - Gido Scharfenberger-Fabian:
Souslin algebra embeddings. 75-113 - Carmi Merimovich:
The short extenders gap three forcing using a morass. 115-135 - Hajime Ishihara, Peter Schuster:
On the contrapositive of countable choice. 137-143 - Anatolij Dvurecenskij:
Subdirectly irreducible state-morphism BL-algebras. 145-160 - Franco Montagna:
Completeness with respect to a chain and universal models in fuzzy logic. 161-183 - Giovanna D'Agostino, Giacomo Lenzi:
Deciding the existence of uniform interpolants over transitive models. 185-196 - Dick de Jongh, Rineke Verbrugge, Albert Visser:
Intermediate Logics and the de Jongh property. 197-213 - Samuel Coskey, Paul Ellis, Scott Schneider:
The conjugacy problem for the automorphism group of the random graph. 215-221 - Moti Gitik, Liad Tal:
On the strength of no normal precipitous filter. 223-243 - Jan Krajícek:
A note on propositional proof complexity of some Ramsey-type statements. 245-255
Volume 50, Numbers 3-4, May 2011
- Matteo Bianchi, Franco Montagna:
n-Contractive BL-logics. 257-285 - Guram Bezhanishvili, David Gabelaia:
Connected modal logics. 287-317 - Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi:
Topological aspects of the Medvedev lattice. 319-340 - Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi:
Immunity properties and strong positive reducibilities. 341-352 - Gareth Boxall:
NIP for some pair-like theories. 353-359 - Bernard A. Anderson:
Relatively computably enumerable reals. 361-365 - Chris Pollett:
Conservative fragments of S12 and R12. 367-393 - Toshiyasu Arai:
Nested PLS. 395-409 - Taras O. Banakh, Dusan Repovs, Lyubomyr Zdomskyy:
On the length of chains of proper subgroups covering a topological group. 411-421 - Szymon Zeberski:
Inscribing nonmeasurable sets. 423-430 - Morteza Moniri, Mostafa Zaare:
Homomorphisms and chains of Kripke models. 431-443 - Toshiyasu Arai:
Exact bounds on epsilon processes. 445-458 - Thomas Blossier:
Sous-groupes additifs de rangs dénombrables dans un corps séparablement clos. 459-476 - Jakob Kellner, Saharon Shelah:
More on the pressing down game. 477-501 - Paul Bankston:
On the first-order expressibility of lattice properties related to unicoherence in continua. 503-512 - Athanassios Tzouvaras:
Erratum to: Localizing the axioms. 513
Volume 50, Numbers 5-6, July 2011
- Andrew D. Brooke-Taylor:
Indestructibility of Vopěnka's Principle. 515-529 - Paul Bankston:
Base-free formulas in the lattice-theoretic study of compacta. 531-542 - Alberto Marcone, Richard A. Shore:
The maximal linear extension theorem in second order arithmetic. 543-564 - Vincenzo Dimonte:
Totally non-proper ordinals beyond L(Vλ+1). 565-584 - Arthur W. Apter:
A remark on the tree property in a choiceless context. 585-590 - Carmi Merimovich:
Supercompact extender based Prikry forcing. 591-602 - Antongiulio Fornasiero:
Definably complete structures are not pseudo-enumerable. 603-615 - Ján Komara:
On nested simple recursion. 617-624 - Marco Cerami, Francesc Esteva:
Strict core fuzzy logics and quasi-witnessed models. 625-641 - Dieter Probst, Thomas Strahm:
Admissible closures of polynomial time computable arithmetic. 643-660 - Alexey Ostrovsky:
σ-Homogeneity of Borel sets. 661-664
Volume 50, Numbers 7-8, November 2011
- Neil Thapen:
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem. 665-680 - Paola D'Aquino, Julia F. Knight, Karen M. Lange:
Limit computable integer parts. 681-695 - Shahram Mohsenipour:
Model theory of the inaccessibility scheme. 697-706 - Arthur W. Apter:
Level by level inequivalence beyond measurability. 707-712 - Miguel Campercholi, Diego Vaggione:
Axiomatizability by forall-exists-sentences. 713-725 - Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof complexity of propositional default logic. 727-742 - Davide Penazzi:
One-basedness and groups of the form G/G 00. 743-758 - Sean D. Cox:
Consistency strength of higher chang's conjecture, without CH. 759-775 - Timothy J. Carlson:
On the conservativity of the axiom of choice over set theory. 777-790 - Tristan Bice:
MAD families of projections on l 2 and real-valued functions on ω. 791-801
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-12-19 22:13 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:
