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 50 matches
- 2022
- Andrei Alexandru, Gabriel Ciobanu:
Various forms of infinity for finitely supported structures. Arch. Math. Log. 61(1-2): 173-222 (2022) - Federico Almiñana, Gustavo Pelaitay:
Monadic k˟ j-rough Heyting algebras. Arch. Math. Log. 61(5-6): 611-625 (2022) - John T. Baldwin, Saharon Shelah:
Hanf numbers for extendibility and related phenomena. Arch. Math. Log. 61(3-4): 437-464 (2022) - Alexander Berenstein, Evgueni Vassiliev:
Definable groups in dense pairs of geometric structures. Arch. Math. Log. 61(3-4): 345-372 (2022) - Samuel Braunfeld, Michael C. Laskowski:
Mutual algebraicity and cellularity. Arch. Math. Log. 61(5-6): 841-857 (2022) - Will Brian, Alan Dow, Saharon Shelah:
The independence of GCH and a combinatorial principle related to Banach-Mazur games. Arch. Math. Log. 61(1-2): 1-17 (2022) - Miguel A. Cardona, Diego Alejandro Mejía, Ismael E. Rivera-Madrid:
The covering number of the strong measure zero ideal can be above almost everything else. Arch. Math. Log. 61(5-6): 599-610 (2022) - Lorenzo Carlucci, Daniele Tavernelli:
Hindman's theorem for sums along the full binary tree, Σ 02-induction and the Pigeonhole principle for trees. Arch. Math. Log. 61(5-6): 827-839 (2022) - Facundo Carreiro, Alessandro Facchini, Yde Venema, Fabio Zanasi:
Model theory of monadic predicate logic with the infinity quantifier. Arch. Math. Log. 61(3-4): 465-502 (2022) - José L. Castiglioni, Sergio A. Celani, Hernán Javier San Martín:
On Hilbert algebras generated by the order. Arch. Math. Log. 61(1-2): 155-172 (2022) - Irakli O. Chitaia, Roland Sh. Omanadze:
Degree structures of conjunctive reducibility. Arch. Math. Log. 61(1-2): 19-31 (2022) - Natasha Dobrinen, Sonia Navarro Flores:
Ramsey degrees of ultrafilters, pseudointersection numbers, and the tools of topological Ramsey spaces. Arch. Math. Log. 61(7-8): 1053-1090 (2022) - Ohad Drucker:
A boundedness principle for the Hjorth rank. Arch. Math. Log. 61(1-2): 223-232 (2022) - Karol Duda, Aleksander Ivanov:
On decidability of amenability in computable groups. Arch. Math. Log. 61(7-8): 891-902 (2022) - Todd Eisworth:
Representability and compactness for pseudopowers. Arch. Math. Log. 61(1-2): 55-80 (2022) - Ali Enayat:
Condensable models of set theory. Arch. Math. Log. 61(3-4): 299-315 (2022) - Makoto Fujiwara:
Δ 01 variants of the law of excluded middle and related principles. Arch. Math. Log. 61(7-8): 1113-1127 (2022) - Moti Gitik:
Reflection and not SCH with overlapping extenders. Arch. Math. Log. 61(5-6): 591-597 (2022) - Luciano J. González:
An alternative proof of the Hilbert-style axiomatization for the $\{\wedge , \vee \}$-fragment of classical propositional logic. Arch. Math. Log. 61(5-6): 859-865 (2022) - Valentina S. Harizanov, Steffen Lempp, Charles F. D. McCoy, Andrei S. Morozov, Reed Solomon:
On the isomorphism problem for some classes of computable algebraic structures. Arch. Math. Log. 61(5-6): 813-825 (2022) - Pengfei He, Juntao Wang, Jiang Yang:
The existence of states based on Glivenko semihoops. Arch. Math. Log. 61(7-8): 1145-1170 (2022) - Radek Honzik, Sárka Stejskalová:
Small $\mathfrak {u}(\kappa )$ at singular κ with compactness at κ ++. Arch. Math. Log. 61(1-2): 33-54 (2022) - Emil Jerábek:
Iterated multiplication in VTC 0. Arch. Math. Log. 61(5-6): 705-767 (2022) - Will Johnson:
A criterion for uniform finiteness in the imaginary sorts. Arch. Math. Log. 61(3-4): 583-589 (2022) - Ruaan Kellerman:
First-order theories of bounded trees. Arch. Math. Log. 61(1-2): 263-297 (2022) - Karim Khanaki:
Dividing lines in unstable theories and subclasses of Baire 1 functions. Arch. Math. Log. 61(7-8): 977-993 (2022) - Lukas Daniel Klausner, Diego Alejandro Mejía:
Many different uniformity numbers of Yorioka ideals. Arch. Math. Log. 61(5-6): 653-683 (2022) - Ján Komara:
Efficient elimination of Skolem functions in LK h. Arch. Math. Log. 61(3-4): 503-534 (2022) - Nils Kürbis:
Normalisation and subformula property for a system of classical logic with Tarski's rule. Arch. Math. Log. 61(1-2): 105-129 (2022) - Milos S. Kurilic, Borisa Kuzeljevic:
Antichains of copies of ultrahomogeneous structures. Arch. Math. Log. 61(5-6): 867-879 (2022)
skipping 20 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-19 16:47 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