Launch week offerEnds in00h00m00s

annual Promonthly Pro

Luca San Mauro

Has grant

Assistant professor (RTD-B)

University of Bari Aldo Moro

Italy

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

Professors in Italy

About

Dr. Luca San Mauro is an Assistant Professor (RTD-B) at the University of Bari Aldo Moro, Italy. His research areas include computability theory, algebraic structures, and fuzzy set approximation, as reflected in his recent publications. He explores various aspects of mathematical logic, including the relationships between equivalence relations and computational complexity.

Recent Grants

Grant: Close

Classifying Relations via Computable Reducibility

Open Date: 2018-04-15

Close Date: 2020-04-14

Grant: Close

Classifying Relations via Computable Reducibility

Open Date: 2018-04-01

Close Date: 2020-04-01

Articles (16)

Year:

2026

Year:

2026

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2021

Collaborators (3)

Uri Andrews

Professor

University of Wisconsin-Madison

UNITED STATES

View details

Giorgio Venturi

University of Pisa

ITALY

View details

Salvatore Pistoia Reda

Università degli Studi di Siena

ITALY

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Luca San Mauro

Research Interests

Make your next move.

Explore related searches

About

Recent Grants

Articles (16)

Comparing Dialectical Systems: Contradiction and Counterexample in Belief Change

SCC-Recursiveness in Infinite Argumentation

ANALOGUES OF THE COUNTABLE BOREL EQUIVALENCE RELATIONS IN THE SETTING OF COMPUTABLE REDUCIBILITY

Complexity in Finitary Argumentation

On the Complexity of the Grounded Semantics for Infinite Argumentation Frameworks

Classifying different criteria for learning algebraic structures

How to make (mathematical) assertions with directives

Classifying word problems of finitely generated algebras via computable reducibility

How to approximate fuzzy sets: mind-changes and the Ershov Hierarchy

INVESTIGATING the COMPUTABLE FRIEDMAN-STANLEY JUMP

Learning algebraic structures with the help of Borel equivalence relations

On The Structure Of Computable Reducibility On Equivalence Relations Of Natural Numbers

Thin Objects Are Not Transparent

Computability theory as a philosophical achievement

Primitive recursive equivalence relations and their primitive recursive complexity

On logicality and natural logic

Collaborators (3)

Uri Andrews

Giorgio Venturi

Salvatore Pistoia Reda

Make your next move.