![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Philipp Lücke
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j18]Joan Bagaria, Philipp Lücke
:
Huge reflection. Ann. Pure Appl. Log. 174(1): 103171 (2023) - 2022
- [j17]Philipp Lücke
:
Structural reflection, shrewd cardinals and the size of the continuum. J. Math. Log. 22(2): 2250007:1-2250007:43 (2022) - 2021
- [j16]Peter Holy, Philipp Lücke
:
Small models, large cardinals, and induced ideals. Ann. Pure Appl. Log. 172(2): 102889 (2021) - [j15]Philipp Lücke
, Sandra Müller
:
Closure Properties of Measurable Ultrapowers. J. Symb. Log. 86(2): 762-784 (2021)
2010 – 2019
- 2019
- [j14]Peter Holy, Philipp Lücke
, Ana Njegomir:
Small embedding characterizations for large cardinals. Ann. Pure Appl. Log. 170(2): 251-271 (2019) - [j13]Philipp Lücke
:
Closed Maximality Principles and Generalized Baire Spaces. Notre Dame J. Formal Log. 60(2): 253-282 (2019) - 2018
- [j12]Chris Lambie-Hanson
, Philipp Lücke
:
Squares, Ascent Paths, and Chain conditions. J. Symb. Log. 83(4): 1512-1538 (2018) - [j11]Philipp Lücke
, Philipp Schlicht
:
Measurable cardinals and good -wellorderings. Math. Log. Q. 64(3): 207-217 (2018) - 2017
- [j10]Sean Cox, Philipp Lücke
:
Characterizing large cardinals in terms of layered posets. Ann. Pure Appl. Log. 168(5): 1112-1131 (2017) - [j9]Philipp Lücke
, Ralf Schindler, Philipp Schlicht
:
Σ1(κ)-DEFINABLE SUBSETS OF H(κ +). J. Symb. Log. 82(3): 1106-1131 (2017) - [j8]Philipp Lücke
, Philipp Schlicht
, Thilo Weinert
:
Choiceless Ramsey Theory of Linear Orders. Order 34(3): 369-418 (2017) - 2016
- [j7]Peter Holy, Regula Krapf, Philipp Lücke
, Ana Njegomir, Philipp Schlicht
:
Class forcing, the forcing Theorem and Boolean Completions. J. Symb. Log. 81(4): 1500-1530 (2016) - 2015
- [j6]Sy-David Friedman, Philipp Lücke
:
Large cardinals and definable well-orders, without the GCH. Ann. Pure Appl. Log. 166(3): 306-324 (2015) - [j5]David Asperó, Peter Holy, Philipp Lücke
:
Forcing lightface definable well-orders without the GCH. Ann. Pure Appl. Log. 166(5): 553-582 (2015) - [j4]Sy-David Friedman, Peter Holy, Philipp Lücke
:
Large Cardinals and Lightface Definable Well-Orders, without the GCH. J. Symb. Log. 80(1): 251-284 (2015) - 2012
- [j3]Philipp Lücke
, Saharon Shelah
:
External automorphisms of ultraproducts of finite models. Arch. Math. Log. 51(3-4): 433-441 (2012) - [j2]Philipp Lücke
:
Σ11-definability at uncountable regular cardinals. J. Symb. Log. 77(3): 1011-1046 (2012) - [j1]Gunter Fuchs
, Philipp Lücke
:
Iteratively Changing the Heights of Automorphism Towers. Notre Dame J. Formal Log. 53(2): 155-174 (2012)
Coauthor Index
![](https://dblp.org/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.
last updated on 2024-05-08 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint