Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Mathematical Logic, Volume 11
Volume 11, Number 1, June 2011
- Bjørn Kjos-Hanssen:
A Strong Law of computationally Weak Subsets. - Jan Krajícek:
On the Proof Complexity of the Nisan-Wigderson Generator based on a Hard NP ∩ coNP function. - John Krueger, Ernest Schimmerling
:
An equiconsistency Result on Partial squares. - Mirna Dzamonja, Jouko Väänänen:
Chain Models, Trees of singular Cardinality and Dynamic EF-Games. - Menachem Magidor, Jouko Väänänen:
On löWenheim-Skolem-Tarski numbers for Extensions of First order Logic.
Volume 11, Number 2, December 2011
- W. Hugh Woodin:
Suitable Extender Models II: beyond ω-Huge.
a service of 
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.
last updated on 2024-07-28 02:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
