- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Finitely based theories
Journal of Symbolic Logic 54 (1):221-225 (1989)
Abstract
A stable theory is finitely based if every set of indiscernibles is based on a finite subset. This is a common generalization of superstability and 1-basedness. We show that if such theories have more than one model they must have infinitely many, and prove some other conjecturesLinks
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Lattice of algebraically closed sets in one-based theories.Lee Fong Low - 1994 - Journal of Symbolic Logic 59 (1):311-321.
Finitely axiomatizable ℵ1 categorical theories.Ehud Hrushovski - 1994 - Journal of Symbolic Logic 59 (3):838 - 844.
The model theory of finitely generated finite-by-Abelian groups.Francis Oger - 1984 - Journal of Symbolic Logic 49 (4):1115-1124.
A non-finitely based quasi-variety of de Morgan algebras.Hernando Gaitán & Milton H. Perea - 2004 - Studia Logica 78 (1-2):237 - 248.
Equational bases for joins of residuated-lattice varieties.Nikolaos Galatos - 2004 - Studia Logica 76 (2):227 - 240.
Finite basis theorem for Filter-distributive protoalgebraic deductive systems and strict universal horn classes.Katarzyna Pałasińska - 2003 - Studia Logica 74 (1-2):233 - 273.
Classifying ℵo-categorical theories II: The existence of finitely axiomatizable proper class II theories.George Weaver & David Lippel - 1998 - Studia Logica 60 (2):275-297.
The existence of finitely based lower covers for finitely based equational theories.Jaroslav Ježek & George F. McNulty - 1995 - Journal of Symbolic Logic 60 (4):1242-1250.
Analytics
Added to PP
2009-01-28
Downloads
47 (#329,840)
6 months
10 (#257,583)
2009-01-28
Downloads
47 (#329,840)
6 months
10 (#257,583)
Historical graph of downloads
Citations of this work
On constants and the strict order property.Predrag Tanović - 2006 - Archive for Mathematical Logic 45 (4):423-430.
The primal framework II: smoothness.J. T. Baldwin & S. Shelah - 1991 - Annals of Pure and Applied Logic 55 (1):1-34.
Countable models of 1-based theories.Anand Pillay - 1992 - Archive for Mathematical Logic 31 (3):163-169.
Stable theories without dense forking chains.Bernhard Herwig, James G. Loveys, Anand Pillay, Predag Tanović & O. Wagner - 1992 - Archive for Mathematical Logic 31 (5):297-303.
References found in this work
Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.
ALLEN, B., Arithmetizing Uniform NC BASARAB, SA, Relative elimination of quantifiers for Hen-selian valued fields BUSS, SR, The undecidability of k-provability GALLIER, JH, What's so special about Kruskal's theorem and.A. Nesin, A. Pillay & V. Razenj - 1991 - Annals of Pure and Applied Logic 53:297.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-l2pxr uwo