- 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
The strong homogeneity conjecture
Journal of Symbolic Logic 35 (3):375-377 (1970)
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
Pseudo-finite homogeneity and saturation.Jörg Flum & Martin Ziegler - 1999 - Journal of Symbolic Logic 64 (4):1689-1699.
On the homogeneity of space and time in special relativity.José A. Ferrari - 1991 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 22 (1):169-171.
On the existence of strong chains in ℘(ω1)/fin.Piotr Koszmider - 1998 - Journal of Symbolic Logic 63 (3):1055 - 1062.
A refutation of pure conjecture.Timothy Cleveland - 1997 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 28 (1):55-81.
Strong measure zero sets and rapid filters.Jaime I. Ihoda - 1988 - Journal of Symbolic Logic 53 (2):393-402.
Finite support iteration and strong measure zero sets.Janusz Pawlikowski - 1990 - Journal of Symbolic Logic 55 (2):674-677.
S-homogeneity and automorphism groups.Elisabeth Bouscaren & Michael C. Laskowski - 1993 - Journal of Symbolic Logic 58 (4):1302-1322.
Analytics
Added to PP
2009-01-28
Downloads
24 (#620,575)
6 months
5 (#544,079)
2009-01-28
Downloads
24 (#620,575)
6 months
5 (#544,079)
Historical graph of downloads
Citations of this work
Reducibility orderings: Theories, definability and automorphisms.Anil Nerode & Richard A. Shore - 1980 - Annals of Mathematical Logic 18 (1):61-89.
Decidability and Computability of Certain Torsion-Free Abelian Groups.Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov & Daniel Turetsky - 2010 - Notre Dame Journal of Formal Logic 51 (1):85-96.
Conjectures and questions from Gerald Sacks's Degrees of Unsolvability.Richard A. Shore - 1997 - Archive for Mathematical Logic 36 (4-5):233-253.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
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-6d9b7f7c4c-9lpj8 uwo