- 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
Π₁¹ Relations and Paths through ᵊ
Journal of Symbolic Logic 69 (2):585 - 611 (2004)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
S. S. Goncharov. Autostability and computable families of constructivizations. Algebra and Logic, vol. 14 (1975), no. 6, pp. 392–409. - S. S. Goncharov. The quantity of nonautoequivalent constructivizations. Algebra and Logic, vol. 16 (1977), no. 3, pp. 169–185. - S. S. Goncharov and V. D. Dzgoev. Autostability of models. Algebra and Logic, vol. 19 (1980), no. 1, pp. 28–37. - J. B. Remmel. Recursively categorical linear orderings. Proceedings of the American Mathematical Society, vol. 83 (1981), no. 2, pp. 387–391. - Terrence Millar. Recursive categoricity and persistence. The Journal of Symbolic Logic, vol. 51 (1986), no. 2, pp. 430–434. - Peter Cholak, Segey Goncharov, Bakhadyr Khoussainov and Richard A. Shore. Computably categorical structures and expansions by constants. The Journal of Symbolic Logic, vol. 64 (1999), no. 1, pp. 13–137. - Peter Cholak, Richard A. Shore and Reed Solomon. A computably stable structure with no Scott family of finitary formulas. Archive for Mathematical. [REVIEW]Daniel Turetsky - 2012 - Bulletin of Symbolic Logic 18 (1):131-134.
Π 1 1 relations and paths through.Sergey Goncharov, Valentina Harizanov, Julia Knight & Richard Shore - 2004 - Journal of Symbolic Logic 69 (2):585-611.
Review: Sergei S. Goncharov, Countable Boolean Algebras and Decidability. [REVIEW]Valentina Harizanov - 1998 - Journal of Symbolic Logic 63 (3):1188-1190.
Haim Gaifman. Models and types of Peano's arithmetic. Annals of mathematical logic, vol. 9, pp. 223–306. - Julia F. Knight. Omitting types in set theory and arithmetic. The journal of symbolic logic, vol. 41 , pp. 25–32. - Julia F. Knight. Hanf numbers for omitting types over particular theories. The journal of symbolic logic, vol. 41 , pp. 583–588. - Fred G. Abramson and Leo A. Harrington. Models without indiscernibles. The journal of symbolic logic, vol. 41 , vol. 43 , pp. 572–600. [REVIEW]J. P. Ressayre - 1983 - Journal of Symbolic Logic 48 (2):484-485.
Review: Thomas S. Knight, Questions and Universals. [REVIEW]Gerold Stahl - 1968 - Journal of Symbolic Logic 33 (4):612-613.
The Nature of the Question, "Are there Three Consecutive 7's in the Expansion of π?".Alice L. Ambrose - 1937 - Journal of Symbolic Logic 2 (4):171-172.
Π11 Relations And Paths Through.Sergey Goncharov, Valentina Harizanov, Julia Knight & Richard Shore - 2004 - Journal of Symbolic Logic 69 (2):585-611.
Robinson Julia. A note on primitive recursive functions. Ebd., S. 667–670.Rózsa Péter - 1957 - Journal of Symbolic Logic 22 (4):376-376.
Sergei S. Goncharov. Countable Boolean algebras and decidability. English translation of Schetnye bulevy algebry i razreshimost′. Siberian school of algebra and logic. Consultants Bureau, New York, London, and Moscow, 1997, xii + 318 pp. [REVIEW]Valentina Harizanov - 1998 - Journal of Symbolic Logic 63 (3):1188-1190.
Analytics
Added to PP
2011-05-29
Downloads
16 (#1,180,157)
6 months
3 (#1,469,629)
2011-05-29
Downloads
16 (#1,180,157)
6 months
3 (#1,469,629)
Historical graph of downloads
Author's Profile
Citations of this work
Effective categoricity of equivalence structures.Wesley Calvert, Douglas Cenzer, Valentina Harizanov & Andrei Morozov - 2006 - Annals of Pure and Applied Logic 141 (1):61-78.
Scott sentences for certain groups.Julia F. Knight & Vikram Saraph - 2018 - Archive for Mathematical Logic 57 (3-4):453-472.
Classification from a computable viewpoint.Wesley Calvert & Julia F. Knight - 2006 - Bulletin of Symbolic Logic 12 (2):191-218.
Computable structures of rank.J. F. Knight & J. Millar - 2010 - Journal of Mathematical Logic 10 (1):31-43.
Bi‐embeddability spectra and bases of spectra.Ekaterina Fokina, Dino Rossegger & Luca San Mauro - 2019 - Mathematical Logic Quarterly 65 (2):228-236.
References found in this work
Degree spectra and computable dimensions in algebraic structures.Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore & Arkadii M. Slinko - 2002 - Annals of Pure and Applied Logic 115 (1-3):71-113.
Generic copies of countable structures.Chris Ash, Julia Knight, Mark Manasse & Theodore Slaman - 1989 - Annals of Pure and Applied Logic 42 (3):195-205.
Some effects of Ash–Nerode and other decidability conditions on degree spectra.Valentina S. Harizanov - 1991 - Annals of Pure and Applied Logic 55 (1):51-65.
Intrinsically gs;0alpha; relations.E. Barker - 1988 - Annals of Pure and Applied Logic 39 (2):105-130.
Computable isomorphisms, degree spectra of relations, and Scott families.Bakhadyr Khoussainov & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 93 (1-3):153-193.
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-667477cd97-qfrlh dc2