Filters








12 Hits in 3.3 sec

A global version of a theorem of Ben-David and Magidor

Arthur W. Apter, James Cummings
2000 Annals of Pure and Applied Logic  
We prove a consistency result about square principles and stationary re ection which generalises the result of Ben-David and Magidor [4] .  ...  Acknowledgements The second author would like to thank Matt Foreman for telling him Fact 2.7, and showing him a proof that if Ä is Ä + -supercompact then any ÿnite sequence of stationary subsets of Ä +  ...  re ects after doing Prikry forcing at Ä.  ... 
doi:10.1016/s0168-0072(99)00033-0 fatcat:co4oqzkle5gdla2jsctyc2vb2m

Index

2000 Annals of Pure and Applied Logic  
., Classi"cation theory through stationary logic (1}2) 27} 68 Apter, A.W. and Cummings, J., A global version of a theorem of Ben-David and Magidor (3) 199}222 Bucciarelli, A. and Ehrhard, T., On phase  ...  (1}2) 139}157 Jensen, R.B. and Zeman, M., Smooth categories and global ᮀ (1}2) 101}138 Zeman, M., see Jensen, R.B. (1}2) 101}138 Kanovei, V., Linearization of de"nable order relations (1}2) 69}100 Kohlenbach  ... 
doi:10.1016/s0168-0072(99)00051-2 fatcat:bbi7kmnhavfkjlzrwae7lktmyu

Page 6913 of Mathematical Reviews Vol. , Issue 2001J [page]

2001 Mathematical Reviews  
Athanassios Tzouvaras (GR-THESS; Thessaloniki) 2001j:03090 03E35 03E10 03ES0 03E55 Apter, Arthur W. (1-CUNY2; New York, NY) Strong compactness and a global version of a theorem of Ben-David and Magidor  ...  A theorem of Ben-David and Magidor states that Con(ZFC+ GCH + « is «* supercompact) implies Con(ZFC + Of, + ~Ox,). The author and J. Cummings [Ann. Pure Appl.  ... 

Page 2203 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
Yehuda Rav (Paris) 03E Set theory 2001d:03121 2001d:03119 03E35 0305 03E55 Apter, Arthur W. (1-CUNY2; New York, NY); Cummings, James (1-CMU,; Pittsburgh, PA) A global version of a theorem of Ben-David  ...  They also show that this result generalizes a theorem of S. Ben-David and M. Magidor [J. Symbolic Logic 51 (1986), no. 4, 1029-1033; MR 88a:03117] on Ox, and DR .  ... 

Jensen's diamond principle and its relatives [article]

Assaf Rinot
2010 arXiv   pre-print
We also discuss weakening of this principle such as club guessing, and anti-diamond principles such as uniformization. A collection of open problems is included.  ...  We survey some recent results on the validity of Jensen's diamond principle at successor cardinals.  ...  However, by Magidor and Ben-David [4] , it is relatively consistent with the existence of a supercompact cardinal that the GCH holds, * ℵω holds, and every stationary subset of E ℵ ω+1 =ω reflects.  ... 
arXiv:0911.2151v2 fatcat:jktk44uuofbqdizhaws7qyqlre

Page 126 of Mathematical Reviews Vol. , Issue Subject Index [page]

Mathematical Reviews  
(with Cummings, James) A global version of a theorem of Ben-David and Magidor. (English summary) 2001d:03119 — On a problem of Woodin.  ...  Strong compactness and a global version of a theorem of Ben-David and Magidor. (English summary) 2001j:03090 Bagaria, Joan Bounded forcing axioms as principles of generic absoluteness.  ... 

Page 66 of Mathematical Reviews Vol. , Issue Author Index [page]

Mathematical Reviews  
(Summary) 2001k:03112 03E55 (03E35) — (with Cummings, James) A global version of a theorem of Ben-David and Magidor. (English summary) Ann. Pure Appl. Logic 102 (2000), no. 3, 199-222.  ...  (Miroslav Repicky) 2001d:03119 03E35 (03E05, 03E55) — A new proof of a theorem of Magidor. (English summary) Arch. Math. Logic 39 (2000), no. 3, 209-211.  ... 

Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plausible Relations [chapter]

Ofer Arieli, Arnon Avron
1999 Lecture Notes in Computer Science  
For this we consider a sequence of generalizations of the pioneering works of Gabbay, Kraus, Lehmann, Magidor and Makinson.  ...  A mechanism for enforcement needs to have a global view of the system and to report breaches in the model at the time they occur.  ...  We also present an adaptive version and a 2-sided error version of the first test, that have a somewhat better query complexity than the other algorithms.  ... 
doi:10.1007/3-540-48747-6_2 fatcat:nbkzf3rldrhk5pim4nzehnplom

On the mutual-exclusion problem — a quest for minimal solutions

Uri Abraham, Menachem Magidor
1994 Theoretical Computer Science  
Abraham, U. and M. Magidor, On the mutual-exclusion problem -a quest for minimal solutions, Theoretical Computer Science 129 (1994) 1-38.  ...  The impossibility proof depends on a careful analysis of infinite protocol automata, and therefore a detailed definition of such automata and their semantics is developed first.  ...  The works by Ben-David [3] and Abraham et al. [2] show that, at least for the critical-section problem, global time is not a limitation.  ... 
doi:10.1016/0304-3975(94)90079-5 fatcat:2wmv4iab6je2lp4ugpltaade3y

Possibility Theory and Its Applications: Where Do We Stand? [chapter]

Didier Dubois, Henry Prade
2015 Springer Handbook of Computational Intelligence  
Lewis In his 1973 book [179] the philosopher David Lewis considers a graded notion of possibility in the form of a relation between possible worlds he calls comparative possibility.  ...  Shackle also introduces a notion of conditional possibility, whereby the degree of surprise of a conjunction of two events A and B is equal to the maximum of the degree of surprise of A, and of the degree  ...  A result in [135, 136] provides an act-driven axiomatization of these criteria, and enforces possibility theory as a "rational" representation of uncertainty for a finite state space S: Theorem 1.  ... 
doi:10.1007/978-3-662-43505-2_3 fatcat:qptvfae6hndopkvagiwlsnxaxu

Conditionals and modularity in general logics [article]

Dov Gabbay
2010 arXiv   pre-print
In this work in progress, we discuss independence and interpolation and related topics for classical, modal, and non-monotonic logics.  ...  The system of S. Ben-David and R. Ben-Eliyahu: Let N ′ := {N ′ (A) : A ⊆ U } be a system of filters for P(U ), i.e. each N ′ (A) is a filter over A.  ...  The extension to defaults with prerequisites by restricted quantifiers is straightforward. (2) The system of S. Ben-David and R.  ... 
arXiv:1005.5242v4 fatcat:sftdihlrjne5pbf4mivgiv6v3i

Dagstuhl Reports, Volume 9, Issue 1, January 2019, Complete Issue [article]

2019
The expressivity of the IITM is also reflected in the fact that joint-state and global state composition theorems follow directly from the basic composition theorem of the IITM model.  ...  For example, it would follow that, as already shown in the IITM model, the composition theorem in the UC model also implies theorems for joint-state and global state composition as special cases.  ...  It consists of a set of separate static indexes for the changes in the collection and achieves full persistence by maintaining a global version tree.  ... 
doi:10.4230/dagrep.9.1 fatcat:m3grhk5hanccbg7oxkhos7kv4e