![](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 48 matches
- 2013
- Romas Alonderis:
A proof-search procedure for intuitionistic propositional logic. Arch. Math. Log. 52(7-8): 759-778 (2013) - Camilo Argoty:
The model theory of modules of a C*-algebra. Arch. Math. Log. 52(5-6): 525-541 (2013) - Marek Balcerzak
, Barnabás Farkas
, Szymon Glab
:
Covering properties of ideals. Arch. Math. Log. 52(3-4): 279-294 (2013) - Benno van den Berg:
Non-deterministic inductive definitions. Arch. Math. Log. 52(1-2): 113-135 (2013) - Matteo Bianchi
:
First-order Nilpotent minimum logics: first steps. Arch. Math. Log. 52(3-4): 295-316 (2013) - Ahmet Çevik:
Antibasis theorems for $${\Pi0_1}$$ classes and the jump hierarchy. Arch. Math. Log. 52(1-2): 137-142 (2013) - Lavinia Corina Ciungu, George Georgescu, Claudia Muresan
:
Generalized Bosbach states: part I. Arch. Math. Log. 52(3-4): 335-376 (2013) - Lavinia Corina Ciungu, George Georgescu, Claudia Muresan
:
Generalized Bosbach states: Part II. Arch. Math. Log. 52(7-8): 707-732 (2013) - Brent Cody
:
Easton's theorem in the presence of Woodin cardinals. Arch. Math. Log. 52(5-6): 569-591 (2013) - Michal Deco, Miroslav Repický:
Strongly dominating sets of reals. Arch. Math. Log. 52(7-8): 827-846 (2013) - Pilar Dellunde
, Francesc Esteva
:
On elementary equivalence in fuzzy predicate logics. Arch. Math. Log. 52(1-2): 1-17 (2013) - Christian Espíndola:
A short proof of Glivenko theorems for intermediate predicate logics. Arch. Math. Log. 52(7-8): 823-826 (2013) - Chengling Fang, Guohua Wu, Mars M. Yamaleev
:
On a problem of Ishmukhametov. Arch. Math. Log. 52(7-8): 733-741 (2013) - Ilijas Farah
, Paul McKenney, Ernest Schimmerling
:
Some Calkin algebras have outer automorphisms. Arch. Math. Log. 52(5-6): 517-524 (2013) - Vera Fischer
, Sy-David Friedman, Yurii Khomskii:
Co-analytic mad families and definable wellorders. Arch. Math. Log. 52(7-8): 809-822 (2013) - Gunter Fuchs
:
Club degrees of rigidity and almost Kurepa trees. Arch. Math. Log. 52(1-2): 47-66 (2013) - Vincent Guingona, Michael C. Laskowski:
On VC-minimal theories and variants. Arch. Math. Log. 52(7-8): 743-758 (2013) - Michael Hrusák
, Carlos Azarel Martínez-Ranero, Ulises Ariet Ramos-García
, O. A. Téllez-Nieto:
Intersection numbers of families of ideals. Arch. Math. Log. 52(3-4): 403-417 (2013) - Michael Hrusák
, Petr Simon, Ondrej Zindulka:
Weak partition properties on trees. Arch. Math. Log. 52(5-6): 543-567 (2013) - Giorgi Japaridze:
The taming of recurrences in computability logic through cirquent calculus, Part I. Arch. Math. Log. 52(1-2): 173-212 (2013) - Giorgi Japaridze:
The taming of recurrences in computability logic through cirquent calculus, Part II. Arch. Math. Log. 52(1-2): 213-259 (2013) - Sándor Jenei, László Kóródi:
Pseudo equality algebras. Arch. Math. Log. 52(5-6): 469-481 (2013) - Emil Jerábek
, Leszek Aleksander Kolodziejczyk:
Real closures of models of weak arithmetic. Arch. Math. Log. 52(1-2): 143-157 (2013) - Jesse Johnson, Julia F. Knight, V. Ocasio, S. VanDenDriessche:
An example related to Gregory's Theorem. Arch. Math. Log. 52(3-4): 419-434 (2013) - Jan Krajícek:
A saturation property of structures obtained by forcing with a compact family of random variables. Arch. Math. Log. 52(1-2): 19-28 (2013) - Alexander P. Kreuzer:
Program extraction for 2-random reals. Arch. Math. Log. 52(5-6): 659-666 (2013) - Taishi Kurahashi
:
On predicate provability logics and binumerations of fragments of Peano arithmetic. Arch. Math. Log. 52(7-8): 871-880 (2013) - Milos S. Kurilic:
Maximally embeddable components. Arch. Math. Log. 52(7-8): 793-808 (2013) - Kyriakos Kypriotakis, Martin Zeman:
A characterization of $${\square(\kappa{+})}$$ in extender models. Arch. Math. Log. 52(1-2): 67-90 (2013) - Eva Leenknegt:
Cell decomposition for semibounded p-adic sets. Arch. Math. Log. 52(5-6): 667-688 (2013)
skipping 18 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-09-04 05:49 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