![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 14 matches
- 2000
- Noriko H. Arai
:
Relative efficency of propositional proof systems: resolution vs. cut-free LK. Ann. Pure Appl. Log. 104(1-3): 3-16 (2000) - Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg:
Higher type recursion, ramification and polynomial time. Ann. Pure Appl. Log. 104(1-3): 17-30 (2000) - Wolfgang Burr:
Functional interpretation of Aczel's constructive set theory. Ann. Pure Appl. Log. 104(1-3): 31-73 (2000) - Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel:
Preface. Ann. Pure Appl. Log. 104(1-3): 1-2 (2000) - Solomon Feferman, Thomas Strahm:
The unfolding of non-finitist arithmetic. Ann. Pure Appl. Log. 104(1-3): 75-96 (2000) - Lex Hendriks:
Doing logic b computer: interpolation in fragments ofinstuitionistic propositional logic. Ann. Pure Appl. Log. 104(1-3): 97-112 (2000) - Martin Hofmann:
Safe recursion with higher types and BCK-algebra. Ann. Pure Appl. Log. 104(1-3): 113-166 (2000) - Grigori Mints:
Reduction of finite and infinite derivations. Ann. Pure Appl. Log. 104(1-3): 167-188 (2000) - Ieke Moerdijk, Erik Palmgren:
Wellfounded trees in categories. Ann. Pure Appl. Log. 104(1-3): 189-218 (2000) - Hans de Nivelle:
Deciding the E+ - class by an a posteriori, liftable order. Ann. Pure Appl. Log. 104(1-3): 219-232 (2000) - Jaap van Oosten, Alex K. Simpson:
Axioms and (counter) examples in synthetic domain theory. Ann. Pure Appl. Log. 104(1-3): 233-278 (2000) - Chris Pollett:
Multifunction algebras and the provability of PH. Ann. Pure Appl. Log. 104(1-3): 279-302 (2000) - Thomas Strahm:
The non-constructive mu operator, fixed point theories with ordinals, and the bar rule. Ann. Pure Appl. Log. 104(1-3): 305-324 (2000) - Luca Trevisan
:
Interactive and probabilistic proof-checking. Ann. Pure Appl. Log. 104(1-3): 325-342 (2000)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-10 02:43 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