Остановите войну!
for scientists:
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 24 matches
- 1997
- Yoshihiro Abe:
A hierarchy of filters smaller than CFkappalambda. Arch. Math. Log. 36(6): 385-397 (1997) - Colin G. Bailey:
Relativized projecta and b\beta-r.e. sets. Arch. Math. Log. 36(4-5): 289-296 (1997) - Stefano Baratella, Stefano Berardi:
A parallel game semantics for Linear Logic. Arch. Math. Log. 36(3): 189-217 (1997) - Maxim R. Burke:
A proof of Hechler's theorem on embedding Aleph1-directed sets cofinally into (ww, <*). Arch. Math. Log. 36(6): 399-403 (1997) - Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows:
On the parameterized complexity of short computation and factorization. Arch. Math. Log. 36(4-5): 321-337 (1997) - Haim Judah, Otmar Spinas:
Large cardinals and projective sets. Arch. Math. Log. 36(2): 137-155 (1997) - Makoto Kikuchi:
Kolmogorov complexity and the second incompleteness theorem. Arch. Math. Log. 36(6): 437-443 (1997) - Lill Kristiansen, Dag Normann:
Total objects in inductively defined types. Arch. Math. Log. 36(6): 405-436 (1997) - Steffen Lempp, Manuel Lerman:
Iterated trees of strategies and priority arguments. Arch. Math. Log. 36(4-5): 297-312 (1997) - V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Nonmonotonic rule systems with recursive sets of restraints. Arch. Math. Log. 36(4-5): 339-384 (1997) - Dag Normann:
Hereditarily effective typestreams. Arch. Math. Log. 36(3): 219-225 (1997) - Dag Normann:
Closing the gap between the continuous functionals and recursion in 3E. Arch. Math. Log. 36(4-5): 269-287 (1997) - Karim Nour:
La valeur d'un entier classique en lm\lambda\mu-calcul. Arch. Math. Log. 36(6): 461-473 (1997) - Jim Owings:
Rank, join, and Cantor singletons. Arch. Math. Log. 36(4-5): 313-320 (1997) - Søren Riis:
Count( qq) versus the pigeon-hole principle. Arch. Math. Log. 36(3): 157-188 (1997) - Joachim Schmid:
Existentially closed fields with holomorphy rings. Arch. Math. Log. 36(2): 127-135 (1997) - Saharon Shelah:
Set theory without choice: not everything on cofinality is possible. Arch. Math. Log. 36(2): 81-125 (1997) - Richard A. Shore:
Conjectures and questions from Gerald Sacks's Degrees of Unsolvability. Arch. Math. Log. 36(4-5): 233-253 (1997) - Theodore A. Slaman, W. Hugh Woodin:
Definability in the enumeration degrees. Arch. Math. Log. 36(4-5): 255-267 (1997) - Andreas Weiermann:
A proof of strongly uniform termination for Gödel's TT by methods from local predicativity. Arch. Math. Log. 36(6): 445-460 (1997) - 1996
- Arnold Beckmann, Andreas Weiermann:
A term rewriting characterization of the polytime functions and related complexity classes. Arch. Math. Log. 36(1): 11-30 (1996) - Decheng Ding, Lei Qian:
Isolated d.r.e. degrees are dense in r.e. degree structure. Arch. Math. Log. 36(1): 1-10 (1996) - Ulrich Kohlenbach:
Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals. Arch. Math. Log. 36(1): 31-71 (1996) - Roman Kossak, Nicholas Bamber:
On two questions concerning the automorphism groups of countable recursively saturated models of PA. Arch. Math. Log. 36(1): 73-79 (1996)
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-06-07 01:02 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