default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 68 matches
- 2003
- Arthur W. Apter:
Characterizing strong compactness via strongness. Math. Log. Q. 49(4): 375-384 (2003) - Arthur W. Apter:
Failures of GCH and the level by level equivalence between strong compactness and supercompactness. Math. Log. Q. 49(6): 587-597 (2003) - Regina Aragón:
Some Boolean algebras with finitely many distinguished ideals II. Math. Log. Q. 49(3): 260-276 (2003) - Seyed Mohammad Bagheri:
On translations of complete first order theories. Math. Log. Q. 49(1): 87-91 (2003) - Seyed Mohammad Bagheri, Morteza Moniri:
Some results on Kripke models over an arbitrary fixed frame. Math. Log. Q. 49(5): 479-484 (2003) - Stefano Baratella, Siu-Ah Ng:
Consequences of neocompact quantifier elimination. Math. Log. Q. 49(2): 150-162 (2003) - George Barmpalias:
A transfinite hierarchy of reals. Math. Log. Q. 49(2): 163-172 (2003) - Teresa Bigorajska:
Strongly maximal subgroups determined by elements in interstices. Math. Log. Q. 49(1): 101-108 (2003) - Stephen Binns:
A splitting theorem for the Medvedev and Muchnik lattices. Math. Log. Q. 49(4): 327-335 (2003) - Andreas Blass, Victor Pambuccian:
Sperner spaces and first-order logic. Math. Log. Q. 49(2): 111-114 (2003) - Valeriy K. Bulitko, Vadim Bulitko:
On existence of complete sets for bounded reducibilities. Math. Log. Q. 49(6): 567-575 (2003) - Wojciech Buszkowski:
Sequent systems for compact bilinear logic. Math. Log. Q. 49(5): 467-474 (2003) - Enrique Casanovas:
Some remarks on indiscernible sequences. Math. Log. Q. 49(5): 475-478 (2003) - Omar De la Cruz, Eric J. Hall, Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin:
Products of compact spaces and the axiom of choice II. Math. Log. Q. 49(1): 57-71 (2003) - Omar De la Cruz, Eric J. Hall, Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin:
Metric spaces and the axiom of choice. Math. Log. Q. 49(5): 455-466 (2003) - Douglas A. Cenzer, Jeffrey B. Remmel:
Index sets for omega-languages. Math. Log. Q. 49(1): 22-33 (2003) - Kosta Dosen, Zoran Petric:
A Brauerian representation of split preorders. Math. Log. Q. 49(6): 579-586 (2003) - Jafar S. Eivazloo, Mojtaba Moniri:
Expansions of ordered fields without definable gaps. Math. Log. Q. 49(1): 72-82 (2003) - Olivier Esser:
On the axiom of extensionality in the positive set theory. Math. Log. Q. 49(1): 97-100 (2003) - Matthias Galota, Sven Kosub, Heribert Vollmer:
Generic separations and leaf languages. Math. Log. Q. 49(4): 353-362 (2003) - Rami P. Grossberg, Alexei Kolesnikov, Ivan Tomasic, Monica Van Dieren:
The equality S1 = D = R. Math. Log. Q. 49(2): 115-128 (2003) - Gonçalo Gutierres:
Sequential topological conditions in in the absence of the axiom of choice. Math. Log. Q. 49(3): 293-298 (2003) - Lorenz Halbeisen:
Making doughnuts of Cohen reals. Math. Log. Q. 49(2): 173-178 (2003) - Joel David Hamkins, Philip D. Welch:
Pf != NPf for almost all f. Math. Log. Q. 49(5): 536-540 (2003) - Armin Hemmerling:
Approximate decidability in euclidean spaces. Math. Log. Q. 49(1): 34-56 (2003) - Armin Hemmerling:
The discrete parts of approximately decidable sets in Euclidean spaces. Math. Log. Q. 49(4): 428-432 (2003) - Horst Herrlich:
The axiom of choice holds iff maximal closed filters exist. Math. Log. Q. 49(3): 323-324 (2003) - Tapani Hyttinen:
Finiteness of U-rank implies simplicity in homogeneous structures. Math. Log. Q. 49(6): 576-578 (2003) - Rosalie Iemhoff:
Preservativity logic: An analogue of interpretability logic for constructive theories. Math. Log. Q. 49(3): 230-249 (2003) - Katsumasa Ishii:
A note on the first incompleteness theorem. Math. Log. Q. 49(2): 214-216 (2003)
skipping 38 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-01 21:47 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint