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 65 matches
- 2015
- Zhi Yin:
Embeddings of P(ω)/fin into Borel Equivalence Relations between ℓP and ℓQ . J. Symb. Log. 80(3): 917-939 (2015) - Uri Andrews, H. Jerome Keisler:
Separable Models of Randomizations. J. Symb. Log. 80(4): 1149-1181 (2015) - Camilo Argoty:
Forking and stability in the Representations of a C*-Algebra. J. Symb. Log. 80(3): 785-796 (2015) - Albert Atserias, Moritz Müller, Sergi Oliva:
Lower Bounds for DNF-Refutations of a Relativized Weak Pigeonhole Principle. J. Symb. Log. 80(2): 450-476 (2015) - Logan M. Axon:
Martin-LöF Randomness in Spaces of Closed Sets. J. Symb. Log. 80(2): 359-383 (2015) - John T. Baldwin, Paul B. Larson, Saharon Shelah:
Almost Galois ω-Stable Classes. J. Symb. Log. 80(3): 763-784 (2015) - Arnold Beckmann, Samuel R. Buss, Sy-David Friedman:
Safe Recursive Set Functions. J. Symb. Log. 80(3): 730-762 (2015) - Luc Bélair, Françoise Point:
Separably Closed Fields and contractive Ore Modules. J. Symb. Log. 80(4): 1315-1338 (2015) - Omer Ben-Neria, Moti Gitik:
On the splitting number at Regular Cardinals. J. Symb. Log. 80(4): 1348-1360 (2015) - Guram Bezhanishvili, David Gabelaia, Joel Lucero-Bryan:
Topological Completeness of Logics above S4. J. Symb. Log. 80(2): 520-566 (2015) - Andreas Blass, Natasha Dobrinen, Dilip Raghavan:
The Next Best Thing to a P-Point. J. Symb. Log. 80(3): 866-900 (2015) - Piotr Borodulin-Nadzieja, Barnabás Farkas, Grzegorz Plebanek:
Representations of ideals in Polish Groups and in Banach Spaces. J. Symb. Log. 80(4): 1268-1289 (2015) - Merlin Carl:
Optimal Results on Recognizability for Infinite Time Register Machines. J. Symb. Log. 80(4): 1116-1130 (2015) - Juan Diego Caycedo, Martin Hils:
Bad Fields with torsion. J. Symb. Log. 80(1): 221-233 (2015) - Zoé Chatzidakis, Matthew Harrison-Trainor, Rahim Moosa:
Differential-Algebraic jet Spaces Preserve Internality to the Constants. J. Symb. Log. 80(3): 1022-1034 (2015) - Yong Cheng, Ralf Schindler:
Harrington's Principle in Higher order Arithmetic. J. Symb. Log. 80(2): 477-489 (2015) - Ellen S. Chih:
Non-splittings of Speedable Sets. J. Symb. Log. 80(2): 609-635 (2015) - David Chodounský, Dusan Repovs, Lyubomyr Zdomskyy:
Mathias forcing and Combinatorial Covering Properties of filters. J. Symb. Log. 80(4): 1398-1410 (2015) - Peter Cholak, Peter M. Gerdes, Karen M. Lange:
${\cal D}$-MAXIMAL SETS. J. Symb. Log. 80(4): 1182-1210 (2015) - Chi Tat Chong, Liang Yu:
Randomness in the Higher Setting. J. Symb. Log. 80(4): 1131-1148 (2015) - Karel Chvalovský:
Undecidability of Consequence Relation in Full non-Associative Lambek Calculus. J. Symb. Log. 80(2): 567-586 (2015) - Petr Cintula, Carles Noguera:
A Henkin-Style Proof of Completeness for First-order Algebraizable Logics. J. Symb. Log. 80(1): 341-358 (2015) - Paola D'Aquino, Salma Kuhlmann, Karen M. Lange:
A Valuation Theoretic Characterization of Recursively saturated Real Closed Fields. J. Symb. Log. 80(1): 194-206 (2015) - François G. Dorais, Jeffry L. Hirst, Paul Shafer:
Comparing the strength of diagonally Nonrecursive Functions in the Absence of ∑20 Induction. J. Symb. Log. 80(4): 1211-1235 (2015) - Clifton F. Ealy, Jana Maríková:
Model Completeness of O-Minimal Fields with Convex Valuations. J. Symb. Log. 80(1): 234-250 (2015) - Martín Escardó, Paulo Oliva:
Bar Recursion and Products of Selection Functions. J. Symb. Log. 80(1): 1-28 (2015) - Arno Fehm:
Existential ∅-Definability of Henselian Valuation Rings. J. Symb. Log. 80(1): 301-307 (2015) - Antongiulio Fornasiero, Philipp Hieronymi:
A Fundamental Dichotomy for definably Complete expansions of Ordered Fields. J. Symb. Log. 80(4): 1091-1115 (2015) - Sy-David Friedman, Peter Holy, Philipp Lücke:
Large Cardinals and Lightface Definable Well-Orders, without the GCH. J. Symb. Log. 80(1): 251-284 (2015) - Sy-David Friedman, Vadim Kulikov:
Failures of the Silver Dichotomy in the generalized Baire Space. J. Symb. Log. 80(2): 661-670 (2015)
skipping 35 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-11-25 03:53 CET 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