- 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
Effective Structures
Mathematical Logic Quarterly 43 (2):235-250 (2006)
Abstract
The connection between some special properties of the computable functions in an abstract structure and the existence of a recursive and semi‐recursive representation of the structure is studied. The considerations are based on the notion of computability on many‐sorted abstract structures.Other Versions
| original | Soskova, Alexandra A. (1997) "Effective Structures". Mathematical Logic Quarterly 43(2):235-250 |
My notes
Similar books and articles
Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
Computability and continuity in metric partial algebras equipped with computability structures.Fredrik Dahlgren - 2004 - Mathematical Logic Quarterly 50 (4-5):486-500.
On Computability Theoretic Properties of Structures and Their Cartesian Products.Bakhadyr Khoussainov - 2000 - Mathematical Logic Quarterly 46 (4):467-476.
A Real Number Structure that is Effectively Categorical.Peter Hertling - 1999 - Mathematical Logic Quarterly 45 (2):147-182.
Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space.Qing Zhou - 1996 - Mathematical Logic Quarterly 42 (1):379-409.
Computability Over Structures of Infinite Signature.Armin Hemmerling - 1998 - Mathematical Logic Quarterly 44 (3):394-416.
Turing degrees of hypersimple relations on computable structures.Valentina S. Harizanov - 2003 - Annals of Pure and Applied Logic 121 (2-3):209-226.
Cohesive powers of structures.Valentina Harizanov & Keshav Srinivasan - 2024 - Archive for Mathematical Logic 63 (5):679-702.
Computability-theoretic complexity of countable structures.Valentina S. Harizanov - 2002 - Bulletin of Symbolic Logic 8 (4):457-477.
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
Analytics
Added to PP
2026-05-15
Downloads
0
6 months
0
2026-05-15
Downloads
0
6 months
0
Historical graph of downloads
Sorry, there are not enough data points to plot this chart.
References found in this work
Generic copies of countable structures.Chris Ash, Julia Knight, Mark Manasse & Theodore Slaman - 1989 - Annals of Pure and Applied Logic 42 (3):195-205.
Effective model theory vs. recursive model theory.John Chisholm - 1990 - Journal of Symbolic Logic 55 (3):1168-1191.
Computability by means of effectively definable schemes and definability via enumerations.Ivan N. Soskov - 1990 - Archive for Mathematical Logic 29 (3):187-200.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
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