A complete theory with arbitrarily large minimality ranks

&
Journal of Symbolic Logic 48 (2):321-328 (1983)
  Copy   BIBTEX

Abstract

An example is given of a complete theory with minimal models of arbitrarily large minimality rank

Categories

Keywords

Reprint years

DOI

10.2307/2273549

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On dedekind complete o-minimal structures.Anand Pillay & Charles Steinhorn - 1987 - Journal of Symbolic Logic 52 (1):156-164.
Spherically complete models of Hensel minimal valued fields.David B. Bradley-Williams & Immanuel Halupczok - 2023 - Mathematical Logic Quarterly 69 (2):138-146.
Amalgamation properties and finite models in L n -theories.John Baldwin & Olivier Lessmann - 2002 - Archive for Mathematical Logic 41 (2):155-167.
Burks Arthur W., McNaughton Robert, Pollmar Carl H., Warren Don W., and Wright Jesse B.. Complete decoding nets: general theory and minimality. Journal of the Society for Industrial and Applied Mathematics, vol. 2 , pp. 201–243.Raymond J. Nelson - 1956 - Journal of Symbolic Logic 21 (2):210-210.
Uniform Local Weak o‐Minimality and ∗$*$‐Local Weak o‐Minimality. [REVIEW]Masato Fujita - 2025 - Mathematical Logic Quarterly 71 (2):e70002.
Dp-Minimality: Basic Facts and Examples.Alfred Dolich, John Goodrick & David Lippel - 2011 - Notre Dame Journal of Formal Logic 52 (3):267-288.
Generalizations of Deissler's Minimality Rank.T. G. Kucera - 1988 - Journal of Symbolic Logic 53 (1):269-283.
A monotonicity theorem for dp-minimal densely ordered groups.John Goodrick - 2010 - Journal of Symbolic Logic 75 (1):221-238.
Local O-Minimality and Prime Models.Wataru Komine & Akito Tsuboi - 2026 - Notre Dame Journal of Formal Logic 67 (1):37-48.
Minimality conditions on circularly ordered structures.Beibut Sh Kulpeshov & H. Dugald Macpherson - 2005 - Mathematical Logic Quarterly 51 (4):377-399.

Analytics

Added to PP
2009-01-28

Downloads
156 (#269,242)

6 months
42 (#196,462)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Deissler Rank Complexity of Powers of Indecomposable Injective Modules.R. Chartrand & T. Kucera - 1994 - Notre Dame Journal of Formal Logic 35 (3):398-402.

Add more citations

References found in this work

No references found.

Add more references