Остановите войну!
for scientists:
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 1,693 matches
- 2024
- Omer Ben-Neria:
A Mathias criterion for the Magidor iteration of Prikry forcings. Arch. Math. Log. 63(1): 119-134 (2024) - Gareth Boxall:
Superrosiness and dense pairs of geometric structures. Arch. Math. Log. 63(1): 203-209 (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): 163-180 (2024) - Zvonko Iljazovic, Matea Jelic:
Computable approximations of a chainable continuum with a computable endpoint. Arch. Math. Log. 63(1): 181-201 (2024) - Sohei Iwata, Taishi Kurahashi, Yuya Okawa:
The fixed point and the Craig interpolation properties for sublogics of bfIL. Arch. Math. Log. 63(1): 1-37 (2024) - Mingyang Li, Jan Reimann:
Turing degrees and randomness for continuous measures. Arch. Math. Log. 63(1): 39-59 (2024) - Kenji Miyamoto, Georg Moser:
Herbrand complexity and the epsilon calculus with equality. Arch. Math. Log. 63(1): 89-118 (2024) - Mattias Granberg Olsson, Graham E. Leigh:
Revisiting the conservativity of fixpoints over intuitionistic arithmetic. Arch. Math. Log. 63(1): 61-87 (2024) - Gabriele Pulcini:
Cut elimination by unthreading. Arch. Math. Log. 63(1): 211-223 (2024) - Diego A. Rojas:
Effective weak and vague convergence of measures on the real line. Arch. Math. Log. 63(1): 225-238 (2024) - Damian Sobota, Lyubomyr Zdomskyy:
Convergence of measures after adding a real. Arch. Math. Log. 63(1): 135-162 (2024) - Bartosz Wcislo:
Compositional truth with propositional tautologies and quantifier-free correctness. Arch. Math. Log. 63(1): 239-257 (2024) - 2023
- Juan P. Aguilera:
A topological completeness theorem for transfinite provability logic. Arch. Math. Log. 62(5-6): 751-788 (2023) - Svetlana Aleksandrova, Nikolay Bazhenov, Maxim V. Zubkov:
Complexity of Σ0n-classifications for definable subsets. Arch. Math. Log. 62(1-2): 239-256 (2023) - Toshiyasu Arai:
Wellfoundedness proof with the maximal distinguished set. Arch. Math. Log. 62(3-4): 333-357 (2023) - Tyler Arant:
Recursive Polish spaces. Arch. Math. Log. 62(7-8): 1101-1110 (2023) - Peter Arndt, Hugo Luiz Mariano, Darllan Conceição Pinto:
Filter pairs and natural extensions of logics. Arch. Math. Log. 62(1-2): 113-145 (2023) - Amitayu Banerjee:
Combinatorial properties and dependent choice in symmetric extensions based on Lévy collapse. Arch. Math. Log. 62(3-4): 369-399 (2023) - Stefano Baratella:
An infinitary propositional probability logic. Arch. Math. Log. 62(3-4): 291-320 (2023) - Caleb Camrud, Isaac Goldbring, Timothy H. McNicholl:
On the complexity of the theory of a computably presented metric structure. Arch. Math. Log. 62(7-8): 1111-1129 (2023) - Daniel W. Cunningham:
On forcing over $L(\mathbb {R})$. Arch. Math. Log. 62(3-4): 359-367 (2023) - Natasha Dobrinen, Kaiyun Wang:
Big Ramsey degrees in universal inverse limit structures. Arch. Math. Log. 62(3-4): 471-503 (2023) - Michal Dybowski, Przemyslaw Górka:
The axiom of choice in metric measure spaces and maximal δ-separated sets. Arch. Math. Log. 62(5-6): 735-749 (2023) - Giulio Fellin, Sara Negri, Eugenio Orlandelli:
Glivenko sequent classes and constructive cut elimination in geometric logics. Arch. Math. Log. 62(5-6): 657-688 (2023) - Vera Fischer, Marlene Koelbing, Wolfgang Wohofsky:
Towers, mad families, and unboundedness. Arch. Math. Log. 62(5-6): 811-830 (2023) - Vera Fischer, Marlene Koelbing, Wolfgang Wohofsky:
Correction to: Towers, mad families, and unboundedness. Arch. Math. Log. 62(7-8): 1159-1160 (2023) - Vera Fischer, Corey Bacal Switzer:
The structure of κ-maximal cofinitary groups. Arch. Math. Log. 62(5-6): 641-655 (2023) - Rodrigo A. Freire, Peter Holy:
An ordinal-connection axiom as a weak form of global choice under the GCH. Arch. Math. Log. 62(3-4): 321-332 (2023) - Anton Freund:
Bachmann-Howard derivatives. Arch. Math. Log. 62(5-6): 581-618 (2023) - Kentaro Fujimoto:
A few more dissimilarities between second-order arithmetic and set theory. Arch. Math. Log. 62(1-2): 147-206 (2023)
skipping 1,663 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-03-19 13:21 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