Weakly minimal formulas: a global approach

Annals of Pure and Applied Logic 46 (1):65-94 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,880

External links

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

Through your library

Similar books and articles

Criterion for binarity of ℵ 0 -categorical weakly o-minimal theories.B. Sh Kulpeshov - 2007 - Annals of Pure and Applied Logic 145 (3):354-367.
Characterizations of the weakly compact ideal on Pλ.Brent Cody - 2020 - Annals of Pure and Applied Logic 171 (6):102791.
On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
Proof complexity of intuitionistic implicational formulas.Emil Jeřábek - 2017 - Annals of Pure and Applied Logic 168 (1):150-190.
Minimal Coding.Sy D. Friedman - 1989 - Annals of Pure and Applied Logic 41 (3):233-297.
Lower bound results on lengths of second-order formulas.Bruno Scarpellini - 1985 - Annals of Pure and Applied Logic 29 (1):29-58.

Analytics

Added to PP
2014-01-16

Downloads
35 (#657,183)

6 months
12 (#323,469)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Meager forking.Ludomir Newelski - 1994 - Annals of Pure and Applied Logic 70 (2):141-175.
On the number of models of uncountable theories.Ambar Chowdhury & Anand Pillay - 1994 - Journal of Symbolic Logic 59 (4):1285-1300.
Geometry of *-finite types.Ludomir Newelski - 1999 - Journal of Symbolic Logic 64 (4):1375-1395.

Add more citations

References found in this work

Ultraproducts which are not saturated.H. Jerome Keisler - 1967 - Journal of Symbolic Logic 32 (1):23-46.
The geometry of weakly minimal types.Steven Buechler - 1985 - Journal of Symbolic Logic 50 (4):1044-1053.

Add more references