- 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
Refinements of Vaught's normal from theorem
Journal of Symbolic Logic 44 (3):289-306 (1979)
Abstract
This article has no associated abstract. (fix it)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
Vaught's theorem recursively revisited.Terrence Millar - 1981 - Journal of Symbolic Logic 46 (2):397-411.
Vaught’s Two-Cardinal Theorem and Notions of Minimality in Continuous Logic.Victoria Noquez - 2019 - Bulletin of Symbolic Logic 25 (2):215-216.
An application of invariant sets to global definability.Douglas E. Miller - 1979 - Journal of Symbolic Logic 44 (1):9-14.
A Non‐Boolean Version of Feferman‐Vaught's Theorem.R. Lavendhomme & Th Lucas - 1985 - Mathematical Logic Quarterly 31 (19‐20):299-308.
A reduction theorem for normal algorithms.J. W. Swanson - 1966 - Journal of Symbolic Logic 31 (1):86-97.
A normal form theorem for first order formulas and its application to Gaifman's splitting theorem.Nobuyoshi Motohashi - 1984 - Journal of Symbolic Logic 49 (4):1262-1267.
The topological Vaught's conjecture and minimal counterexamples.Howard Becker - 1994 - Journal of Symbolic Logic 59 (3):757-784.
J. W. Swanson. A reduction theorem for normal algorithms. The journal of symbolic logic, vol. 31 , pp. 86–97.Elliott Mendelson - 1967 - Journal of Symbolic Logic 32 (1):123.
Isomorphism of Computable Structures and Vaught's Conjecture.Howard Becker - 2013 - Journal of Symbolic Logic 78 (4):1328-1344.
Vaught's conjecture for o-minimal theories.Laura L. Mayer - 1988 - Journal of Symbolic Logic 53 (1):146-159.
Analytics
Added to PP
2009-01-28
Downloads
10 (#1,206,671)
6 months
1 (#1,722,083)
2009-01-28
Downloads
10 (#1,206,671)
6 months
1 (#1,722,083)
Historical graph of downloads
Citations of this work
Saturated structures, unions of chains, and preservation theorems.Alan Adamson - 1980 - Annals of Mathematical Logic 19 (1-2):67-96.
Saturated structures, unions of chains, and preservation theorems.Alan Adamson - 1980 - Annals of Mathematical Logic 19 (1):67.
References found in this work
Elementary Induction on Abstract Structures.Wayne Richter - 1979 - Journal of Symbolic Logic 44 (1):124-125.
Models with compactness properties relative to an admissible language.J. P. Ressayre - 1977 - Annals of Mathematical Logic 11 (1):31.
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-6686886f5-2nz2h uwo