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 51 matches
- 2020
- Andrei Alexandru, Gabriel Ciobanu:
Properties of the atoms in finitely supported structures. Arch. Math. Log. 59(1-2): 229-256 (2020) - Uri Andrews, Isaac Goldbring, Sherwood Hachtman, H. Jerome Keisler, David Marker:
Scattered sentences have few separable randomizations. Arch. Math. Log. 59(5-6): 743-754 (2020) - Toshiyasu Arai:
Proof-theoretic strengths of the well-ordering principles. Arch. Math. Log. 59(3-4): 257-275 (2020) - Leandro Aurichi, Lyubomyr Zdomskyy:
Covering properties of ømega-mad families. Arch. Math. Log. 59(3-4): 445-452 (2020) - Saeideh Bahrami:
Tanaka's theorem revisited. Arch. Math. Log. 59(7-8): 865-877 (2020) - Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Andrea Sorbi, Mars M. Yamaleev:
Classifying equivalence relations in the Ershov hierarchy. Arch. Math. Log. 59(7-8): 835-864 (2020) - Alexander Berenstein, Evgueni Vassiliev:
Fields with a dense-codense linearly independent multiplicative subgroup. Arch. Math. Log. 59(1-2): 197-228 (2020) - Özlem Beyarslan, Daniel Max Hoffmann, Gönenç Onay, David Pierce:
Fields with automorphism and valuation. Arch. Math. Log. 59(7-8): 997-1008 (2020) - Matteo Bianchetti:
Weaker variants of infinite time Turing machines. Arch. Math. Log. 59(3-4): 335-365 (2020) - Iva Bilanovic, Jennifer Chubb, Sam Roven:
Detecting properties from descriptions of groups. Arch. Math. Log. 59(3-4): 293-312 (2020) - Hazel Brickhill:
Square below a non-weakly compact cardinal. Arch. Math. Log. 59(3-4): 409-426 (2020) - Tyler Brown, Timothy H. McNicholl:
Analytic computable structure theory and Lp-spaces part 2. Arch. Math. Log. 59(3-4): 427-443 (2020) - Jan Bydzovsky, Moritz Müller:
Polynomial time ultrapowers and the consistency of circuit lower bounds. Arch. Math. Log. 59(1-2): 127-147 (2020) - Irakli O. Chitaia, Keng Meng Ng, Andrea Sorbi, Yue Yang:
Incomparability in local structures of s-degrees and Q-degrees. Arch. Math. Log. 59(7-8): 777-791 (2020) - Brent Cody, Hiroshi Sakai:
The weakly compact reflection principle need not imply a high order of weak compactness. Arch. Math. Log. 59(1-2): 179-196 (2020) - Daniel W. Cunningham:
A diamond-plus principle consistent with AD. Arch. Math. Log. 59(5-6): 755-775 (2020) - Hannes Diener, Maarten McKubre-Jordens:
Classifying material implications over minimal logic. Arch. Math. Log. 59(7-8): 905-924 (2020) - Costas Dimitracopoulos, Vasileios S. Paschalis:
End extensions of models of fragments of PA. Arch. Math. Log. 59(7-8): 817-833 (2020) - Emanuele Frittaion:
Completeness of the primitive recursive ømega-rule. Arch. Math. Log. 59(5-6): 715-731 (2020) - Paul Kindvall Gorbow:
Rank-initial embeddings of non-standard models of set theory. Arch. Math. Log. 59(5-6): 517-563 (2020) - Lorenz Halbeisen, Eleftherios Tachtsis:
On Ramsey choice and partial choice for infinite families of n-element sets. Arch. Math. Log. 59(5-6): 583-606 (2020) - Paul Hein, Otmar Spinas:
Antichains of perfect and splitting trees. Arch. Math. Log. 59(3-4): 367-388 (2020) - Hajime Ishihara, Takako Nemoto:
On the independence of premiss axiom and rule. Arch. Math. Log. 59(7-8): 793-815 (2020) - Franziska Jahnke, Pierre Simon:
NIP henselian valued fields. Arch. Math. Log. 59(1-2): 167-178 (2020) - Emil Jerábek:
Induction rules in bounded arithmetic. Arch. Math. Log. 59(3-4): 461-501 (2020) - Evgeny Kolmakov:
Local reflection, definable elements and 1-provability. Arch. Math. Log. 59(7-8): 979-996 (2020) - Taishi Kurahashi:
Uniform Lyndon interpolation property in propositional modal logics. Arch. Math. Log. 59(5-6): 659-678 (2020) - Milos S. Kurilic, Nenad Moraca:
Reversibility of extreme relational structures. Arch. Math. Log. 59(5-6): 565-582 (2020) - Marcos Mazari-Armida:
Non-forking w-good frames. Arch. Math. Log. 59(1-2): 31-56 (2020) - Rosario Mennuni:
Product of invariant types modulo domination-equivalence. Arch. Math. Log. 59(1-2): 1-29 (2020)
skipping 21 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-26 00:38 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