All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 102 Next

Displaying 2021 – 2040 of 5970

Showing per page

Indestructibility of generically strong cardinals

Brent Cody, Sean Cox (2016)

Fundamenta Mathematicae

Foreman (2013) proved a Duality Theorem which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of ω₁ is preserved by any proper forcing. We generalize portions of Foreman's Duality Theorem to the context of generic extender embeddings and ideal extenders (as introduced by Claverie (2010)). As an application we prove that if ω₁ is generically strong, then it remains so after adding any number of Cohen subsets...

Indestructibility, strong compactness, and level by level equivalence

Arthur W. Apter (2009)

Fundamenta Mathematicae

We show the relative consistency of the existence of two strongly compact cardinals κ₁ and κ₂ which exhibit indestructibility properties for their strong compactness, together with level by level equivalence between strong compactness and supercompactness holding at all measurable cardinals except for κ₁. In the model constructed, κ₁'s strong compactness is indestructible under arbitrary κ₁-directed closed forcing, κ₁ is a limit of measurable cardinals, κ₂'s strong compactness is indestructible...

Indestructibility, strongness, and level by level equivalence

Arthur W. Apter (2003)

Fundamenta Mathematicae

We construct a model in which there is a strong cardinal κ whose strongness is indestructible under κ-strategically closed forcing and in which level by level equivalence between strong compactness and supercompactness holds non-trivially.

Indestructible colourings and rainbow Ramsey theorems

Lajos Soukup (2009)

Fundamenta Mathematicae

We show that if a colouring c establishes ω₂ ↛ [(ω₁:ω)]² then c establishes this negative partition relation in each Cohen-generic extension of the ground model, i.e. this property of c is Cohen-indestructible. This result yields a negative answer to a question of Erdős and Hajnal: it is consistent that GCH holds and there is a colouring c:[ω₂]² → 2 establishing ω₂ ↛ [(ω₁:ω)]₂ such that some colouring g:[ω₁]² → 2 does not embed into c. It is also consistent that 2 ω ₁ is arbitrarily large, and there...

Indestructible Strong Compactness and Level by Level Equivalence with No Large Cardinal Restrictions

Arthur W. Apter (2015)

Bulletin of the Polish Academy of Sciences. Mathematics

We construct a model for the level by level equivalence between strong compactness and supercompactness with an arbitrary large cardinal structure in which the least supercompact cardinal κ has its strong compactness indestructible under κ-directed closed forcing. This is in analogy to and generalizes the author's result in Arch. Math. Logic 46 (2007), but without the restriction that no cardinal is supercompact up to an inaccessible cardinal.

Indicative propositions.

Purdea, Ioan, Both, Nicolae (2001)

Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică

Indiscernibles and dimensional compactness

C. Ward Henson, Pavol Zlatoš (1996)

Commentationes Mathematicae Universitatis Carolinae

This is a contribution to the theory of topological vector spaces within the framework of the alternative set theory. Using indiscernibles we will show that every infinite set u S ⊆ G in a biequivalence vector space 〈 W , M , G 〉 , such that x - y ∉ M for distinct x , y ∈ u , contains an infinite independent subset. Consequently, a class X ⊆ G is dimensionally compact iff the π -equivalence ≐ M is compact on X . This solves a problem from the paper [NPZ 1992] by J. Náter, P. Pulmann and the second author.

Induced pseudoorders

Ivan Chajda, Miroslav Haviar (1991)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Induction and decision procedures.

Deepak Kapur, Jürgen Giesl, Mahadevan Subramaniam (2004)

RACSAM

Mechanization of inductive reasoning is an exciting research area in artificial intelligence and automated reasoning with many challenges. An overview of our work on mechanizing inductive reasoning based on the cover set method for generating induction schemes from terminating recursive function definitions and using decision procedures is presented. This paper particularly focuses on the recent work on integrating induction into decision procedures without compromising their automation.

Inf-datalog, modal logic and complexities

Eugénie Foustoucos, Irène Guessarian (2009)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [16]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking (i.e. computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity...

Currently displaying 2021 – 2040 of 5970