Alberto Marcone

Orcid: 0000-0001-8356-0086

Affiliations:
  • University of Udine, Department of Mathematics, Computer Science and Physics, Italy


According to our database1, Alberto Marcone authored at least 34 papers between 1991 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
(Extra)ordinary Equivalences with the ascending/descending sequence Principle.
J. Symb. Log., 2024

2022
Uniquely orderable interval graphs.
Discret. Math., 2022

Effective aspects of Hausdorff and Fourier dimension.
Comput., 2022

2021
The Open and Clopen Ramsey theorems in the Weihrauch Lattice.
J. Symb. Log., 2021

To reorient is easier than to orient: An on-line algorithm for reorientation of graphs.
Comput., 2021

2020
Searching for an analogue of Atr0 in the Weihrauch Lattice.
J. Symb. Log., 2020

Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018.
Comput., 2020

Polish metric spaces with fixed distance set.
Ann. Pure Appl. Log., 2020

2019
Linear orders: When embeddability and epimorphism agree.
J. Math. Log., 2019

Projection operators in the Weihrauch lattice.
Comput., 2019

2018
The logic of the reverse mathematics zoo.
Math. Struct. Comput. Sci., 2018

Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361).
Dagstuhl Reports, 2018

Searching for an analogue of ATR in the Weihrauch lattice.
CoRR, 2018

2017
Addendum to: "The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma" [Ann. Pure Appl. Logic 163 (6) (2012) 623-655].
Ann. Pure Appl. Log., 2017

2016
Erratum to: Epimorphisms Between Linear Orders.
Order, 2016

Reverse mathematics, well-quasi-orders, and Noetherian spaces.
Arch. Math. Log., 2016

2015
Epimorphisms Between Linear Orders.
Order, 2015

Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392).
Dagstuhl Reports, 2015

2014
Reverse mathematics and initial intervals.
Ann. Pure Appl. Log., 2014

2012
Linear extensions of partial orders and reverse mathematics.
Math. Log. Q., 2012

The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's Lemma.
Ann. Pure Appl. Log., 2012

Computing maximal chains.
Arch. Math. Log., 2012

2011
The Veblen functions for computability theorists.
J. Symb. Log., 2011

The maximal linear extension theorem in second order arithmetic.
Arch. Math. Log., 2011

2009
On Fraïssé's conjecture for linear orders of finite Hausdorff rank.
Ann. Pure Appl. Log., 2009

2008
How Incomputable is the Separable Hahn-Banach Theorem?
Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007
Interval Orders and Reverse Mathematics.
Notre Dame J. Formal Log., 2007

Coloring linear orders with Rado's partial order.
Math. Log. Q., 2007

2004
The complexity of continuous embeddability between dendrites.
J. Symb. Log., 2004

Reverse mathematics and the equivalence of definitions for well and better quasi-orders.
J. Symb. Log., 2004

2001
Fine Analysis of the Quasi-Orderings on the Power Set.
Order, 2001

1998
Lebesgue numbers and Atsuji spaces in subsystems of second-order arithmetic.
Arch. Math. Log., 1998

1995
The Set of Better Quasi Orderings is Pi<sub>2</sub><sup>1</sup>-complete.
Math. Log. Q., 1995

1991
Borel Quasi-Orderings in Subsystems of Second-Order Arithmetic.
Ann. Pure Appl. Log., 1991


  Loading...