- Submit
-
Browse
- 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
- More
Computable bi-embeddable categoricity
Algebra and Logic 5 (57):392-396 (2018)
Abstract
We study the algorithmic complexity of isomorphic embeddings between computable structures.Author's Profile
Analytics
Added to PP
2022-08-04
Downloads
236 (#61,487)
6 months
53 (#72,681)
2022-08-04
Downloads
236 (#61,487)
6 months
53 (#72,681)
Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?
