36 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. Calculating the Mind Change Complexity of Learning Algebraic Structures
5. Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy
6. INVESTIGATING THE COMPUTABLE FRIEDMAN–STANLEY JUMP.
7. Speech acts in mathematics
8. On logicality and natural logic
9. Calculating the Mind Change Complexity of Learning Algebraic Structures
10. Learning families of algebraic structures from informant
11. Classifying equivalence relations in the Ershov hierarchy
12. Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy
13. Degrees of bi-embeddable categoricity of equivalence structures
14. Classifying word problems of finitely generated algebras via computable reducibility
15. INVESTIGATING THE COMPUTABLE FRIEDMAN-STANLEY JUMP
16. ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS.
17. Primitive recursive equivalence relations and their primitive recursive complexity
18. Thin Objects Are Not Transparent.
19. Computability theory as a philosophical achievement
20. UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
21. ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
22. Thin Objects Are Not Transparent
23. On the Turing complexity of learning finite families of algebraic structures
24. On the Computational Content of the Theory of Borel Equivalence Relations
25. Language logicality and nonclassical logic
26. At least one black sheep: Pragmatics and mathematical language
27. Degrees of bi-embeddable categoricity
28. Word problems and ceers
29. Speech acts in mathematics
30. Rejoinder
31. Measuring the complexity of reductions between equivalence relations
32. Bi‐embeddability spectra and bases of spectra
33. Le direzioni della ricerca logica in Italia: la teoria (classica) della computabilità
34. Trial and error mathematics: Dialectical systems and completions of theories
35. Degrees of bi-embeddable categoricity of equivalence structures
36. Informal proofs and computability
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.