default search action
Menachem Magidor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j48]Yair Hayut, Menachem Magidor, Alejandro Poveda:
Identity Crisis between supercompactness and VǒPenka's Principle. J. Symb. Log. 87(2): 626-648 (2022) - [j47]Yair Hayut
, Menachem Magidor:
Subcompact Cardinals, Type Omission, and ladder Systems. J. Symb. Log. 87(3): 1111-1129 (2022) - [j46]Shimon Garti
Forcing axioms and the Galvin number. Period. Math. Hung. 84(2): 250-258 (2022) - 2021
- [j45]Ilijas Farah
Corson reflections. Ann. Pure Appl. Log. 172(5): 102908 (2021) - [j44]Juliette Kennedy, Menachem Magidor, Jouko Väänänen:
Inner models from extended logics: Part 1. J. Math. Log. 21(2): 2150012:1-2150012:53 (2021) - [j43]James Cummings
The Tree Property at the two Immediate Successors of a singular cardinal. J. Symb. Log. 86(2): 600-608 (2021) - 2020
- [j42]Shimon Garti
Infinite Monochromatic Paths and a Theorem of Erdős-Hajnal-Rado. Electron. J. Comb. 27(2): 2 (2020) - [j41]Joan Bagaria
The consistency strength of hyperstationarity. J. Math. Log. 20(1): 2050004 (2020)
2010 – 2019
- 2019
- [j40]Yair Hayut
DESTRUCTIBILITY OF THE TREE PROPERTY AT ${\aleph _{\omega + 1}}$. J. Symb. Log. 84(2): 621-631 (2019) - 2018
- [j39]Ilijas Farah
Omitting types in logic of metric structures. J. Math. Log. 18(2): 1850006:1-1850006:58 (2018) - [j38]James Cummings
The eightfold Way. J. Symb. Log. 83(1): 349-371 (2018) - [j37]Shimon Garti
On the Spectrum of Characters of Ultrafilters. Notre Dame J. Formal Log. 59(3): 371-379 (2018) - 2017
- [j36]Laura Fontanella, Menachem Magidor:
Reflection of stationary Sets and the Tree Property at the Successor of a singular cardinal. J. Symb. Log. 82(1): 272-291 (2017) - 2016
- [j35]Moti Gitik, Menachem Magidor:
SPFA by finite conditions. Arch. Math. Log. 55(5-6): 649-661 (2016) - 2014
- [j34]Brent Cody
On supercompactness and the continuum function. Ann. Pure Appl. Log. 165(2): 620-630 (2014) - [j33]Joan Bagaria
ON ${\omega _1}$-STRONGLY COMPACT CARDINALS. J. Symb. Log. 79(1): 266-278 (2014) - 2011
- [j32]Menachem Magidor, Jouko Väänänen
On löWenheim-Skolem-Tarski numbers for Extensions of First order Logic. J. Math. Log. 11(1) (2011)
2000 – 2009
- 2009
- [j31]Sy-David Friedman, Menachem Magidor:
The number of normal measures. J. Symb. Log. 74(3): 1069-1080 (2009) - 2008
- [c5]Moti Gitik, Menachem Magidor:
On Partially Wellfounded Generic Ultrapowers. Pillars of Computer Science 2008: 342-350 - 2006
- [j30]James Cummings
Canonical structure in the universe of set theory: part two. Ann. Pure Appl. Log. 142(1-3): 55-75 (2006) - 2004
- [j29]James Cummings
Canonical structure in the universe of set theory: part one. Ann. Pure Appl. Log. 129(1-3): 211-243 (2004) - 2003
- [j28]James Cummings
The non-compactness of square. J. Symb. Log. 68(2): 637-643 (2003) - 2002
- [i3]Sarit Kraus, Daniel Lehmann, Menachem Magidor:
Nonmonotonic Reasoning, Preferential Models and Cumulative Logics. CoRR cs.AI/0202021 (2002) - [i2]Daniel Lehmann, Menachem Magidor:
What does a conditional knowledge base entail? CoRR cs.AI/0202022 (2002) - [i1]Daniel Lehmann, Menachem Magidor, Karl Schlechta:
Distance Semantics for Belief Revision. CoRR cs.AI/0202025 (2002) - 2001
- [j27]James Cummings
Squares, scales and stationary Reflection. J. Math. Log. 1(1) (2001) - [j26]Daniel Lehmann, Menachem Magidor, Karl Schlechta:
Distance Semantics for Belief Revision. J. Symb. Log. 66(1): 295-317 (2001) - [j25]Matthew Foreman, Menachem Magidor, Ralf-Dieter Schindler:
The Consistency Strength of Successive Cardinals with The Tree Property. J. Symb. Log. 66(4): 1837-1847 (2001)
1990 – 1999
- 1999
- [j24]Amir Leshem
The Independence of delta1n. J. Symb. Log. 64(1): 350-362 (1999) - [c4]Ran Rinat, Menachem Magidor, Scott F. Smith:
Correspondence Polymorphism for Object-Oriented Languages. OOPSLA 1999: 167-186 - 1997
- [j23]Matthew Foreman, Menachem Magidor:
A Very Weak Square Principle. J. Symb. Log. 62(1): 175-196 (1997) - 1996
- [j22]Menachem Magidor, Saharon Shelah
The tree property at successors of singular cardinals. Arch. Math. Log. 35(5-6): 385-404 (1996) - [j21]Rachel Ben-Eliyahu, Menachem Magidor:
A Temporal Logic for Proving Properties of Topologically General Executions. Inf. Comput. 124(2): 127-144 (1996) - [c3]Ran Rinat, Menachem Magidor:
Metaphoric Polymorphism: Taking Code Reuse One Step Further. ECOOP 1996: 449-471 - [c2]Karl Schlechta, Daniel Lehmann, Menachem Magidor:
Distance Semantics for Belief Revision. TARK 1996: 137-145 - 1995
- [j20]Arthur W. Apter, Menachem Magidor:
Instances of Dependent Choice and the Measurability of alephomega + 1. Ann. Pure Appl. Log. 74(3): 203-219 (1995) - [j19]Matthew Foreman, Menachem Magidor:
Large Cardinals and Definable Counterexamples to the Continuum Hypothesis. Ann. Pure Appl. Log. 76(1): 47-97 (1995) - 1994
- [j18]Moti Gitik, Menachem Magidor:
Extender Based Forcings. J. Symb. Log. 59(2): 445-460 (1994) - [j17]Uri Abraham, Menachem Magidor:
On the Mutual-Exclusion Problem - A Quest for Minimal Solutions. Theor. Comput. Sci. 129(1): 1-38 (1994) - 1992
- [j16]Daniel Lehmann, Menachem Magidor:
What does a Conditional Knowledge Base Entail? Artif. Intell. 55(1): 1-60 (1992) - [j15]Ron Aharoni, Menachem Magidor, Richard A. Shore:
On the strength of König's duality theorem for infinite bipartite graphs. J. Comb. Theory B 54(2): 257-290 (1992) - 1990
- [j14]Sarit Kraus, Daniel Lehmann, Menachem Magidor:
Nonmonotonic Reasoning, Preferential Models and Cumulative Logics. Artif. Intell. 44(1-2): 167-207 (1990) - [j13]Menachem Magidor, John W. Rosenthal, Mattiyahu Rubin, Gabriel Srour:
Some Highly Undecidable Lattices. Ann. Pure Appl. Log. 46(1): 41-63 (1990) - [j12]Maxim R. Burke, Menachem Magidor:
Shelah's pcf Theory and Its Applications. Ann. Pure Appl. Log. 50(3): 207-254 (1990) - [c1]Daniel Lehmann, Menachem Magidor:
Preferential Logics: the Predicate Calculus Case. TARK 1990: 57-72
1980 – 1989
- 1986
- [j11]Matthew Foreman, Menachem Magidor, Saharon Shelah
0 # and Some Forcing Principles. J. Symb. Log. 51(1): 39-46 (1986) - [j10]Shai Ben-David, Menachem Magidor:
The Weak □* is Really Weaker than the Full □. J. Symb. Log. 51(4): 1029-1033 (1986) - 1985
- [j9]Moti Gitik, Menachem Magidor, W. Hugh Woodin:
Two Weak Consequences of 0#. J. Symb. Log. 50(3): 597-603 (1985) - 1984
- [j8]Menachem Magidor, Saharon Shelah
Countably decomposable admissible sets. Ann. Pure Appl. Log. 26(3): 287-361 (1984) - 1983
- [j7]Menachem Magidor, Saharon Shelah
On the Standard Part of Nonstandard Models of Set Theory. J. Symb. Log. 48(1): 33-38 (1983) - [j6]Yuri Gurevich, Menachem Magidor, Saharon Shelah
The Monadic Theory of omega12. J. Symb. Log. 48(2): 387-398 (1983) - 1982
- [j5]Menachem Magidor:
Reflecting Stationary Sets. J. Symb. Log. 47(4): 755-771 (1982) - 1980
- [j4]Thomas Jech, Menachem Magidor, William John Mitchell, Karel Prikry:
Precipitous Ideals. J. Symb. Log. 45(1): 1-8 (1980)
1970 – 1979
- 1978
- [j3]Fred Galvin, Thomas Jech, Menachem Magidor:
An Ideal Game. J. Symb. Log. 43(2): 284-292 (1978) - 1977
- [j2]Menachem Magidor, Jerome I. Malitz:
Compactness and Transfer for a Fragment of L2. J. Symb. Log. 42(2): 261-268 (1977) - [j1]Menachem Magidor:
Chang's Conjecture and Powers of Singular Cardinals. J. Symb. Log. 42(2): 272-276 (1977) - 1972
- [b1]Menachem Magidor:
על קרדינלים סופר קומפקטיים (On supercompact cardinals.). Hebrew University of Jerusalem, Israel, 1972
Coauthor Index
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-08-05 20:24 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: