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
- 2024
- Arthur W. Apter:
Indestructibility and the linearity of the Mitchell ordering. Arch. Math. Log. 63(3-4): 473-482 (2024) - Serikzhan A. Badaev, Nikolay A. Bazhenov, Birzhan S. Kalmurzayev, Manat Mustafa:
On diagonal functions for equivalence relations. Arch. Math. Log. 63(3-4): 259-278 (2024) - Marek Balcerzak, Tomasz Natkaniec, Piotr Szuca:
Games characterizing certain families of functions. Arch. Math. Log. 63(7-8): 759-772 (2024) - Giuseppina Gerarda Barbieri, Antonio Di Nola, Giacomo Lenzi:
Spectral MV-algebras and equispectrality. Arch. Math. Log. 63(7-8): 893-919 (2024) - Omer Ben-Neria:
A Mathias criterion for the Magidor iteration of Prikry forcings. Arch. Math. Log. 63(1-2): 119-134 (2024) - Alessandro Berarducci, Marcello Mamino, Rosario Mennuni:
Vector spaces with a union of independent subspaces. Arch. Math. Log. 63(3-4): 499-507 (2024) - Konstantinos A. Beros, Paul B. Larson:
Maximal Tukey types, P-ideals and the weak Rudin-Keisler order. Arch. Math. Log. 63(3-4): 325-352 (2024) - Gareth Boxall:
Superrosiness and dense pairs of geometric structures. Arch. Math. Log. 63(1-2): 203-209 (2024) - Lorenzo Carlucci, Leonardo Mainardi:
Regressive versions of Hindman's theorem. Arch. Math. Log. 63(3-4): 447-472 (2024) - Andrés Cordón-Franco, Francisco Félix Lara Martín:
Semi-honest subrecursive degrees and the collection rule in arithmetic. Arch. Math. Log. 63(1-2): 163-180 (2024) - Ali Enayat:
Indiscernibles and satisfaction classes in arithmetic. Arch. Math. Log. 63(5-6): 655-677 (2024) - Marat Kh. Faizrahmanov:
On computable numberings of families of Turing degrees. Arch. Math. Log. 63(5-6): 609-622 (2024) - Gilda Ferreira, Paulo Renato A. Firmino:
Herbrandized modified realizability. Arch. Math. Log. 63(5-6): 703-721 (2024) - Rafal Filipów, Krzysztof Kowitz, Adam Kwela:
Katětov order between Hindman, Ramsey and summable ideals. Arch. Math. Log. 63(7-8): 859-876 (2024) - Gunter Fuchs:
Errata: on the role of the continuum hypothesis in forcing principles for subcomplete forcing. Arch. Math. Log. 63(5-6): 509-521 (2024) - Makoto Fujiwara, Taishi Kurahashi:
Prenex normalization and the hierarchical classification of formulas. Arch. Math. Log. 63(3-4): 391-403 (2024) - Moti Gitik:
Around accumulation points and maximal sequences of indiscernibles. Arch. Math. Log. 63(5-6): 591-608 (2024) - Piotr Gruza, Mateusz Lelyk:
Varieties of truth definitions. Arch. Math. Log. 63(5-6): 563-589 (2024) - Valentina S. Harizanov, Keshav Srinivasan:
Cohesive powers of structures. Arch. Math. Log. 63(5-6): 679-702 (2024) - Jialiang He, Jintao Luo, Shuguo Zhang:
On the extendability to $\mathbf {\Pi }_30$ ideals and Katětov order. Arch. Math. Log. 63(5-6): 523-528 (2024) - Stefan Hetzl, Jannik Vierling:
Quantifier-free induction for lists. Arch. Math. Log. 63(7-8): 813-835 (2024) - Paul E. Howard:
Separablilty of metric measure spaces and choice axioms. Arch. Math. Log. 63(7-8): 987-1003 (2024) - Zvonko Iljazovic, Matea Jelic:
Computable approximations of a chainable continuum with a computable endpoint. Arch. Math. Log. 63(1-2): 181-201 (2024) - Katsumasa Ishii:
On Harrop disjunction property in intermediate predicate logics. Arch. Math. Log. 63(3-4): 317-324 (2024) - Sohei Iwata, Taishi Kurahashi, Yuya Okawa:
The fixed point and the Craig interpolation properties for sublogics of bfIL. Arch. Math. Log. 63(1-2): 1-37 (2024) - Michael Kaminski:
On undecidability of the propositional logic of an associative binary modality. Arch. Math. Log. 63(7-8): 837-857 (2024) - Mark Kamsma:
Positive indiscernibles. Arch. Math. Log. 63(7-8): 921-940 (2024) - Karim Khanaki:
Glivenko-Cantelli classes and NIP formulas. Arch. Math. Log. 63(7-8): 1005-1031 (2024) - Konstantin Kovalyov:
Fragments of IOpen. Arch. Math. Log. 63(7-8): 969-986 (2024) - Mingyang Li, Jan Reimann:
Turing degrees and randomness for continuous measures. Arch. Math. Log. 63(1-2): 39-59 (2024)
skipping 19 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-03 09:17 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