The following pages link to Luca San Mauro (Q2104246):
Displayed 31 items.
- (Q1731325) (redirect page) (← links)
- Computable bi-embeddable categoricity (Q1731326) (← links)
- Calculating the mind change complexity of learning algebraic structures (Q2104247) (← links)
- Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy (Q2148810) (← links)
- Classifying equivalence relations in the Ershov hierarchy (Q2204368) (← links)
- Minimal equivalence relations in hyperarithmetical and analytical hierarchies (Q2207013) (← links)
- Learning families of algebraic structures from informant (Q2216113) (← links)
- Degrees of bi-embeddable categoricity of equivalence structures (Q2312081) (← links)
- Learning algebraic structures with the help of Borel equivalence relations (Q2689445) (← links)
- UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (Q2921020) (← links)
- Trial and error mathematics: Dialectical systems and completions of theories (Q3120211) (← links)
- Degrees of bi-embeddable categoricity (Q4995600) (← links)
- Primitive recursive equivalence relations and their primitive recursive complexity (Q5061388) (← links)
- Bi‐embeddability spectra and bases of spectra (Q5108859) (← links)
- On the Turing complexity of learning finite families of algebraic structures (Q5163997) (← links)
- Measuring the complexity of reductions between equivalence relations (Q5211066) (← links)
- Naturalness in Mathematics (Q5213636) (← links)
- TRIAL AND ERROR MATHEMATICS II: DIALECTICAL SETS AND QUASIDIALECTICAL SETS, THEIR DEGREES, AND THEIR DISTRIBUTION WITHIN THE CLASS OF LIMIT SETS (Q5737944) (← links)
- TRIAL AND ERROR MATHEMATICS I: DIALECTICAL AND QUASIDIALECTICAL SYSTEMS (Q5741615) (← links)
- Speech acts in mathematics (Q6088915) (← links)
- ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS (Q6095972) (← links)
- Word problems and ceers (Q6096328) (← links)
- Classifying word problems of finitely generated algebras via computable reducibility (Q6116397) (← links)
- Bi-embeddability spectra and bases of spectra (Q6305486) (← links)
- Limit Learning Equivalence Structures (Q6314414) (← links)
- Comparing the isomorphism types of equivalence structures and preorders (Q6333311) (← links)
- A note on the category of equivalence relations (Q6368092) (← links)
- Approximating approximate reasoning: Fuzzy sets and the Ershov hierarchy (Q6373400) (← links)
- Punctual equivalence relations and their (punctual) complexity (Q6377198) (← links)
- Learning algebraic structures with the help of Borel equivalence relations (Q6381458) (← links)
- Investigating the computable Friedman-Stanley jump (Q6402924) (← links)