- 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
Computable functors and effective interpretability
Journal of Symbolic Logic 82 (1):77-97 (2017)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Alexander G. Melnikov - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Interpreting a Field in its Heisenberg Group.Rachael Alvir, Wesley Calvert, Grant Goodman, Valentina Harizanov, Julia Knight, Russell Miller, Andrey Morozov, Alexandra Soskova & Rose Weisshaar - 2022 - Journal of Symbolic Logic 87 (3):1215-1230.
Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Review by: Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401,.
Uri Andrews. A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 (2011), no. 3, pp. 883–896. - Bakhadyr Khoussainov and Antonio Montalbán. A computable ℵ 0 -categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 (2010), no. 2, pp. 728–740. [REVIEW]Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401.
Coding in graphs and linear orderings.Julia F. Knight, Alexandra A. Soskova & Stefan V. Vatev - 2020 - Journal of Symbolic Logic 85 (2):673-690.
Antonio Montalbán, Indecomposable linear orderings and hyperarithmetic analysis. Journal of Mathematical Logic, vol. 6 (2006), no. 1, pp. 89–120. - Itay Neeman, The strength of Jullien’s indecomposability theorem. Journal of Mathematical Logic, vol. 8 (2008), no. 1, pp. 93–119. - Itay Neeman, Necessary use of induction in a reversal. Journal of Symbolic Logic, vol. 76 (2011), no. 2, pp. 561–574. [REVIEW]Henry Towsner - 2014 - Bulletin of Symbolic Logic 20 (3):366-368.
Computable symbolic dynamics.Douglas Cenzer, S. Ali Dashti & Jonathan L. F. King - 2008 - Mathematical Logic Quarterly 54 (5):460-469.
Computable symbolic dynamics.Douglas Cenzer, S. Dashti & Jonathan F. King - 2008 - Mathematical Logic Quarterly 54 (5):460-469.
A computable functor from graphs to fields.Russell Miller, Bjorn Poonen, Hans Schoutens & Alexandra Shlapentokh - 2018 - Journal of Symbolic Logic 83 (1):326-348.
Analytics
Added to PP
2017-03-26
Downloads
22 (#818,081)
6 months
12 (#443,723)
2017-03-26
Downloads
22 (#818,081)
6 months
12 (#443,723)
Historical graph of downloads
Citations of this work
Foundations of online structure theory.Nikolay Bazhenov, Rod Downey, Iskander Kalimullin & Alexander Melnikov - 2019 - Bulletin of Symbolic Logic 25 (2):141-181.
Finitely generated groups are universal among finitely generated structures.Matthew Harrison-Trainor & Meng-Che “Turbo” Ho - 2021 - Annals of Pure and Applied Logic 172 (1):102855.
Jump inversions of algebraic structures and Σ‐definability.Marat Faizrahmanov, Asher Kach, Iskander Kalimullin, Antonio Montalbán & Vadim Puzarenko - 2019 - Mathematical Logic Quarterly 65 (1):37-45.
Categorical linearly ordered structures.Rod Downey, Alexander Melnikov & Keng Meng Ng - 2019 - Annals of Pure and Applied Logic 170 (10):1243-1255.
Torsion-free abelian groups with optimal Scott families.Alexander G. Melnikov - 2018 - Journal of Mathematical Logic 18 (1):1850002.
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.
On Σ‐definability without equality over the real numbers.Andrei S. Morozov & Margarita V. Korovina - 2008 - Mathematical Logic Quarterly 54 (5):535-544.
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-6b65f85844-fqxrg uwo