Displaying 261 – 280 of 1342

Showing per page

Constructing ω-stable structures: Computing rank

John T. Baldwin, Kitty Holland (2001)

Fundamenta Mathematicae

This is a sequel to [1]. Here we give careful attention to the difficulties of calculating Morley and U-rank of the infinite rank ω-stable theories constructed by variants of Hrushovski's methods. Sample result: For every k < ω, there is an ω-stable expansion of any algebraically closed field which has Morley rank ω × k. We include a corrected proof of the lemma in [1] establishing that the generic model is ω-saturated in the rank 2 case.

Corps C-minimaux, en l’honneur de François Lucas

Françoise Delon (2012)

Annales de la faculté des sciences de Toulouse Mathématiques

La classe des constructibles de la géométrie algébrique est close par projection. La théorie des modèles exprime ce fait en disant que les corps algébriquement clos éliminent les quantificateurs dans le langage des anneaux. De façon analogue, les corps algébriquement clos non trivialement valués éliminent les quantificateurs dans le langage des anneaux enrichi de la relation dite de divisibilité v ( x ) v ( y ) . Cela implique en particulier la «  C -minimalité » : une partie définissable d’un corps algébriquement...

Cotorsion-free algebras as endomorphism algebras in L - the discrete and topological cases

Rüdiger E. Göbel, Brendan Goldsmith (1993)

Commentationes Mathematicae Universitatis Carolinae

The discrete algebras A over a commutative ring R which can be realized as the full endomorphism algebra of a torsion-free R -module have been investigated by Dugas and Göbel under the additional set-theoretic axiom of constructibility, V = L . Many interesting results have been obtained for cotorsion-free algebras but the proofs involve rather elaborate calculations in linear algebra. Here these results are rederived in a more natural topological setting and substantial generalizations to topological...

Counting models of set theory

Ali Enayat (2002)

Fundamenta Mathematicae

Let T denote a completion of ZF. We are interested in the number μ(T) of isomorphism types of countable well-founded models of T. Given any countable order type τ, we are also interested in the number μ(T,τ) of isomorphism types of countable models of T whose ordinals have order type τ. We prove: (1) Suppose ZFC has an uncountable well-founded model and κ ω , , 2 . There is some completion T of ZF such that μ(T) = κ. (2) If α <ω₁ and μ(T,α) > ℵ₀, then μ ( T , α ) = 2 . (3) If α < ω₁ and T ⊢ V ≠ OD, then μ ( T , α ) 0 , 2 . (4)...

Counting partial types in simple theories

Olivier Lessmann (2000)

Colloquium Mathematicae

We continue the work of Shelah and Casanovas on the cardinality of families of pairwise inconsistent types in simple theories. We prove that, in a simple theory, there are at most λ < κ ( T ) + 2 μ + | T | pairwise inconsistent types of size μ over a set of size λ. This bound improves the previous bounds and clarifies the role of κ(T). We also compute exactly the maximal cardinality of such families for countable, simple theories. The main tool is the fact that, in simple theories, the collection of nonforking extensions...

Craig's interpolation theorem, in computation theory

Daniele Mundici (1981)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Si espongono alcuni risultati, provati dall’Autore negli articoli citati nella bibliografia, a proposito della complessità del teorema d’interpolazione di Craig: con ciò si intende la relazione tra la lunghezza (cioè il numero di simboli) della formula χ e la lunghezza di φ e ψ , ove φ ψ è un’implicazione valida, e χ è un interpolante, come esibito dal teorema di interpolazione stesso. Si intende altresì sottolineare la rilevanza dello studio della complessità dell’interpolazione per far luce su alcuni...

Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures

Gábor Czédli (2022)

Archivum Mathematicum

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among finite graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the counterpart of this fact for all bipartite graphs in the class of all graphs is a well-known consequence of the compactness theorem.) Also, to exemplify that our method is applicable in various fields of mathematics, we prove that neither finite simple groups, nor the...

De beaux groupes

Thomas Blossier, Amador Martin-Pizarro (2014)

Confluentes Mathematici

Dans une belle paire ( M , E ) de modèles d’une théorie stable T ayant élimination des imaginaires sans la propriété de recouvrement fini, tout groupe définissable se projette, à isogénie près, sur les points E -rationnels d’un groupe définissable dans le réduit à paramètres dans E . Le noyau de cette projection est un groupe définissable dans le réduit.Un groupe interprétable dans une paire ( K , F ) de corps algébriquement clos où K est une extension propre de F est, à isogénie près, l’extension des points F -rationnels...

Currently displaying 261 – 280 of 1342