![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 44 matches
- 2008
- Maria L. Affatato, Thomas F. Kent, Andrea Sorbi:
Branching in the S02{Sigma02}-enumeration degrees: a new perspective. Arch. Math. Log. 47(3): 221-231 (2008) - Arthur W. Apter:
Indestructibility and measurable cardinals with few and many measures. Arch. Math. Log. 47(2): 101-110 (2008) - Arthur W. Apter, James Cummings
:
An L-like model containing very large cardinals. Arch. Math. Log. 47(1): 65-78 (2008) - Arthur W. Apter, Peter Koepke:
Making all cardinals almost Ramsey. Arch. Math. Log. 47(7-8): 769-783 (2008) - Arthur W. Apter, Grigor Sargsyan:
Universal indestructibility for degrees of supercompactness and strongly compact cardinals. Arch. Math. Log. 47(2): 133-142 (2008) - Vincent Astier:
Elementary equivalence of some rings of definable functions. Arch. Math. Log. 47(4): 327-340 (2008) - Steven Awodey, Andrej Bauer:
Sheaf toposes for realizability. Arch. Math. Log. 47(5): 465-478 (2008) - Andrey Bovykin:
Resplendent models and S11{\Sigma_11} -definability with an oracle. Arch. Math. Log. 47(6): 607-623 (2008) - S. Barry Cooper, Angsheng Li:
On Lachlan's major sub-degree problem. Arch. Math. Log. 47(4): 341-434 (2008) - Charalampos Cornaros, Costas Dimitracopoulos:
On two problems concerning end extensions. Arch. Math. Log. 47(1): 1-14 (2008) - Rumen D. Dimitrov:
A class of S30{Sigmas30} modular lattices embeddable as principal filters in L*(VJPY)L{\ast}(Vinfinity). Arch. Math. Log. 47(2): 111-132 (2008) - Natasha Dobrinen, Sy D. Friedman:
Homogeneous iteration and measure one covering relative to HOD. Arch. Math. Log. 47(7-8): 711-718 (2008) - Kosta Dosen, Zoran Petric:
Equality of proofs for linear equality. Arch. Math. Log. 47(6): 549-565 (2008) - Ali Enayat, Shahram Mohsenipour:
Model theory of the regularity and reflection schemes. Arch. Math. Log. 47(5): 447-464 (2008) - Fernando Ferreira
, Gilda Ferreira
:
Harrington's conservation theorem redone. Arch. Math. Log. 47(2): 91-100 (2008) - Olivier Finkel:
Topological complexity of locally finite omega -languages. Arch. Math. Log. 47(6): 625-651 (2008) - Hector Freytes:
Pavelka-style completeness in expansions of Lukasiewicz logic. Arch. Math. Log. 47(1): 15-23 (2008) - George Georgescu:
Fuzzy power structures. Arch. Math. Log. 47(3): 233-261 (2008) - Stefan Geschke:
Potential continuity of colorings. Arch. Math. Log. 47(6): 567-578 (2008) - Matthew B. Giorgi:
A high noncuppable S02e-degree. Arch. Math. Log. 47(3): 181-191 (2008) - Jakub Gismatullin
, Ludomir Newelski:
G-compactness and groups. Arch. Math. Log. 47(5): 479-501 (2008) - Moti Gitik:
On a question of Pereira. Arch. Math. Log. 47(1): 53-64 (2008) - Michael Hrusák
, Manuel Sanchis
, Á. Tamariz-Mascarúa:
Ultrafilters and non-Cantor minimal sets in linearly ordered dynamical systems. Arch. Math. Log. 47(3): 193-203 (2008) - Michael Hrusák
, Jindrich Zapletal
:
Forcing with quotients. Arch. Math. Log. 47(7-8): 719-739 (2008) - Asher M. Kach:
Computable shuffle sums of ordinals. Arch. Math. Log. 47(3): 211-219 (2008) - Jakob Kellner
:
Even more simple cardinal invariants. Arch. Math. Log. 47(5): 503-515 (2008) - Laurence Kirby:
A hierarchy of hereditarily finite sets. Arch. Math. Log. 47(2): 143-157 (2008) - Peter Koepke, Ryan Siders:
Register computations on ordinals. Arch. Math. Log. 47(6): 529-548 (2008) - Masahiro Kumabe, Toshio Suzuki, Takeshi Yamazaki:
Does truth-table of linear norm reduce the one-query tautologies to a random oracle? Arch. Math. Log. 47(2): 159-180 (2008) - Vincenzo Marra
:
A characterization of MV-algebras free over finite distributive lattices. Arch. Math. Log. 47(3): 263-276 (2008)
skipping 14 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.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-06-14 20:58 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