24 results on '"San Mauro, Luca"'
Search Results
2. Learning algebraic structures with the help of Borel equivalence relations
3. How to approximate fuzzy sets: mind-changes and the Ershov Hierarchy
4. INVESTIGATING THE COMPUTABLE FRIEDMAN–STANLEY JUMP.
5. Speech acts in mathematics
6. On logicality and natural logic
7. Learning families of algebraic structures from informant
8. Classifying equivalence relations in the Ershov hierarchy
9. Degrees of bi-embeddable categoricity of equivalence structures
10. ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS.
11. Classifying word problems of finitely generated algebras via computable reducibility.
12. Thin Objects Are Not Transparent.
13. UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
14. Computability theory as a philosophical achievement.
15. On the Computational Content of the Theory of Borel Equivalence Relations
16. Language logicality and nonclassical logic
17. Primitive recursive equivalence relations and their primitive recursive complexity.
18. At least one black sheep: Pragmatics and mathematical language
19. Degrees of bi-embeddable categoricity.
20. Informal proofs and computability
21. Word problems and ceers.
22. Bi‐embeddability spectra and bases of spectra.
23. Rejoinder
24. Measuring the complexity of reductions between equivalence relations.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.