![](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 49 matches
- 2000
- Mojtaba Aghaei, Mohammad Ardeshir:
A Bounded Translation of Intuitionistic Propositional Logic into Basic Propositional Logic. Math. Log. Q. 46(2): 199-206 (2000) - Arthur W. Apter:
Strong Compactness and a Global Version of a Theorem of Ben-David and Magidor. Math. Log. Q. 46(4): 453-459 (2000) - Marat M. Arslanov
, S. Barry Cooper, Angsheng Li:
There is No Low Maximal D.C.E. Degree. Math. Log. Q. 46(3): 409-416 (2000) - Arnold Beckmann, Andreas Weiermann:
Analyzing Gödel's T Via Expanded Head Reduction Trees. Math. Log. Q. 46(4): 517-536 (2000) - Loredana Biacino, Giangiacomo Gerla, Mingsheng Ying:
Approximate Reasoning Based on Similarity. Math. Log. Q. 46(1): 77-86 (2000) - Giacomo Bonanno, Klaus Nehring:
Common Belief with the Logic of Individual Belief. Math. Log. Q. 46(1): 49-52 (2000) - Bernd Borchert, Frank Stephan:
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. Math. Log. Q. 46(4): 489-504 (2000) - Jörg Brendle
:
Martin's Axiom and the Dual Distributivity Number. Math. Log. Q. 46(2): 241-248 (2000) - Douglas S. Bridges, Ayan Mahalanobis:
Sequential Continuity of Functions in Constructive Analysis. Math. Log. Q. 46(1): 139-143 (2000) - Norbert Brunner
, H. Reiju Mihara:
Arrow's Theorem, Weglorz' Models and the Axiom of Choice. Math. Log. Q. 46(3): 335-359 (2000) - Andrea Cantini:
Feasible Operations and Applicative Theories Based on lambda-eta. Math. Log. Q. 46(3): 291-312 (2000) - Wolfgang Degen:
Pigeonhole and Choice Principles. Math. Log. Q. 46(3): 313-334 (2000) - Wolfgang Degen, Jan Johannsen:
Cumulative Higher-Order Logic as a Foundation for Set Theory. Math. Log. Q. 46(2): 147-170 (2000) - Karl-Heinz Diener:
On kappa-hereditary Sets and Consequences of the Axiom of Choice. Math. Log. Q. 46(4): 563-568 (2000) - Jana Dietel, Hans-Dietrich Hecker:
A P-Completeness Result for Visibility Graphs of Simple Polygons. Math. Log. Q. 46(3): 361-375 (2000) - Ivo Düntsch, Ewa Orlowska:
Logics of Complementarity in Information Systems. Math. Log. Q. 46(2): 267-288 (2000) - Daniel Dzierzgowski, Olivier Esser, Roland Hinnion:
Fixed-points of Set-continuous Operators. Math. Log. Q. 46(2): 183-198 (2000) - Olivier Esser, Roland Hinnion:
Large Cardinals and Ramifiability for Directed Sets. Math. Log. Q. 46(1): 25-34 (2000) - Volker Halbach, Leon Horsten:
Two Proof-Theoretic Remarks on EA + ECT. Math. Log. Q. 46(4): 461-466 (2000) - Horst Herrlich, Kyriakos Keremedis:
On Countable Products of Finite Hausdorff Spaces. Math. Log. Q. 46(4): 537-542 (2000) - Lu Hong, Decheng Ding, Lei Qian:
A Splitting with Infimum in the d-c. e. Degrees. Math. Log. Q. 46(1): 53-76 (2000) - Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin, Adrienne Stanley:
Compactness in Countable Tychonoff Products and Choice. Math. Log. Q. 46(1): 3-16 (2000) - Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin, Adrienne Stanley:
Paracompactness of Metric Spaces and the Axiom of Multiple Choice. Math. Log. Q. 46(2): 219-232 (2000) - Paul E. Howard, Jean E. Rubin, Adrienne Stanley:
Von Rimscha's Transitivity Conditions. Math. Log. Q. 46(4): 549-554 (2000) - Hajime Ishihara:
A Note on the Gödel-Gentzen Translation. Math. Log. Q. 46(1): 135-137 (2000) - Vladimir Kanovei, Michael Reeken:
On Baire Measurable Homomorphisms of Quotients of the Additive Group of the Reals. Math. Log. Q. 46(3): 377-384 (2000) - Richard Kaye, Henryk Kotlarski:
On Models Constructed by Means of the Arithmetized Completeness Theorem. Math. Log. Q. 46(4): 505-516 (2000) - Kyriakos Keremedis:
The Compactness of 2R and the Axiom of Choice. Math. Log. Q. 46(4): 569-571 (2000) - Kyriakos Keremedis, Eleftherios Tachtsis:
On Lindelöf Metric Spaces and Weak Forms of the Axiom of Choice. Math. Log. Q. 46(1): 35-44 (2000) - Bakhadyr Khoussainov:
On Computability Theoretic Properties of Structures and Their Cartesian Products. Math. Log. Q. 46(4): 467-475 (2000)
skipping 19 more matches
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-20 08:06 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