- 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
Omitting quantifier-free types in generic structures
Journal of Symbolic Logic 37 (3):512-520 (1972)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
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
Omitting types in logic of metric structures.Ilijas Farah & Menachem Magidor - 2018 - Journal of Mathematical Logic 18 (2):1850006.
Omitting types: Application to recursion theory.Thomas J. Grilliot - 1972 - Journal of Symbolic Logic 37 (1):81-89.
Indiscernibles, EM-Types, and Ramsey Classes of Trees.Lynn Scow - 2015 - Notre Dame Journal of Formal Logic 56 (3):429-447.
Omitting types in set theory and arithmetic.Julia F. Knight - 1976 - Journal of Symbolic Logic 41 (1):25-32.
Omitting types for stable CCC theories.Ludomir Newelski - 1990 - Journal of Symbolic Logic 55 (3):1037-1047.
Omitting types, type spectrums, and decidability.Terrence Millar - 1983 - Journal of Symbolic Logic 48 (1):171-181.
Analytics
Added to PP
2009-01-28
Downloads
72 (#316,525)
6 months
3 (#1,170,440)
2009-01-28
Downloads
72 (#316,525)
6 months
3 (#1,170,440)
Historical graph of downloads
Citations of this work
Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
Higman's Embedding Theorem in a General Setting and Its Application to Existentially Closed Algebras.Oleg V. Belegradek - 1996 - Notre Dame Journal of Formal Logic 37 (4):613-624.
Satisfaction of existential theories in finitely presented groups and some embedding theorems.Abderezak Ould Houcine - 2006 - Annals of Pure and Applied Logic 142 (1):351-365.
Model theory for universal classes with the amalgamation property: A study in the foundations of model theory and algebra.William K. Forrest - 1977 - Annals of Mathematical Logic 11 (3):263.
References found in this work
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-54b44b69b7-vb4rf uwo