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
- 2011
- Uri Andrews:
New spectra of strongly minimal theories in finite languages. Ann. Pure Appl. Log. 162(5): 367-372 (2011) - Toshiyasu Arai:
Quick cut-elimination for strictly positive cuts. Ann. Pure Appl. Log. 162(10): 807-815 (2011) - Sergey Babenyshev, Vladimir V. Rybakov:
Unification in linear temporal logic LTL. Ann. Pure Appl. Log. 162(12): 991-1000 (2011) - Joan Bagaria, Yiannis N. Moschovakis, Margarita Otero, Ivan N. Soskov:
Preface. Ann. Pure Appl. Log. 162(7): 489 (2011) - George Barmpalias, André Nies:
Upper bounds on ideals in the computably enumerable Turing degrees. Ann. Pure Appl. Log. 162(6): 465-473 (2011) - Olivia Caramello:
A characterization theorem for geometric logic. Ann. Pure Appl. Log. 162(4): 318-321 (2011) - Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Σ01 and Π01 equivalence structures. Ann. Pure Appl. Log. 162(7): 490-503 (2011) - Barbara F. Csima, Reed Solomon:
The complexity of central series in nilpotent computable groups. Ann. Pure Appl. Log. 162(8): 667-678 (2011) - Paola D'Aquino, Angus Macintyre:
Quadratic forms in models of IΔ0+Ω1, Part II: Local equivalence. Ann. Pure Appl. Log. 162(6): 447-456 (2011) - Longyun Ding:
Borel reducibility and finitely Hölder(α) embeddability. Ann. Pure Appl. Log. 162(12): 970-980 (2011) - David M. Evans, Marco S. Ferreira:
The geometry of Hrushovski constructions, I: The uncollapsed case. Ann. Pure Appl. Log. 162(6): 474-488 (2011) - Yun Fan, Liang Yu:
Maximal pairs of c.e. reals in the computably Lipschitz degrees. Ann. Pure Appl. Log. 162(5): 357-366 (2011) - Vera Fischer, Sy-David Friedman, Lyubomyr Zdomskyy:
Projective wellorders and mad families with large continuum. Ann. Pure Appl. Log. 162(11): 853-862 (2011) - Antongiulio Fornasiero:
Dimensions, matroids, and dense pairs of first-order structures. Ann. Pure Appl. Log. 162(7): 514-543 (2011) - Gunter Fuchs:
lambda-structures and s-structures: Translating the models. Ann. Pure Appl. Log. 162(4): 257-317 (2011) - Gunter Fuchs:
λ-structures and s-structures: Translating the iteration strategies. Ann. Pure Appl. Log. 162(9): 710-751 (2011) - Stefan Hetzl, Alexander Leitsch, Daniel Weller:
CERES in higher-order logic. Ann. Pure Appl. Log. 162(12): 1001-1034 (2011) - Gerhard Jäger, Dieter Probst:
The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories. Ann. Pure Appl. Log. 162(8): 647-660 (2011) - Emil Jerábek:
On theories of bounded arithmetic for NC1. Ann. Pure Appl. Log. 162(4): 322-340 (2011) - Emil Jerábek:
A sorting network in bounded arithmetic. Ann. Pure Appl. Log. 162(4): 341-355 (2011) - Norihiro Kamide, Heinrich Wansing:
Completeness and cut-elimination theorems for trilattice logics. Ann. Pure Appl. Log. 162(10): 816-835 (2011) - Byunghan Kim, Hyeung-Joon Kim:
Notions around tree property 1. Ann. Pure Appl. Log. 162(9): 698-709 (2011) - Peter Koepke, Philip D. Welch:
Global square and mutual stationarity at the alephn. Ann. Pure Appl. Log. 162(10): 787-806 (2011) - Leszek Aleksander Kolodziejczyk:
Independence results for variants of sharply bounded induction. Ann. Pure Appl. Log. 162(12): 981-990 (2011) - Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Neil Thapen:
The provably total NP search problems of weak second order bounded arithmetic. Ann. Pure Appl. Log. 162(6): 419-446 (2011) - Antonín Kucera, André Nies:
Demuth randomness and computational complexity. Ann. Pure Appl. Log. 162(7): 504-513 (2011) - Chuck C. Liang, Dale Miller:
A focused approach to combining logics. Ann. Pure Appl. Log. 162(9): 679-697 (2011) - Michael J. Lieberman:
Category-theoretic aspects of abstract elementary classes. Ann. Pure Appl. Log. 162(11): 903-915 (2011) - Jana Maríková:
O-minimal residue fields of o-minimal fields. Ann. Pure Appl. Log. 162(6): 457-464 (2011) - Benjamin D. Miller:
Dichotomy theorems for countably infinite dimensional analytic hypergraphs. Ann. Pure Appl. Log. 162(7): 561-565 (2011)
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-03 05:24 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