Andrea Sorbi

According to our database1, Andrea Sorbi authored at least 63 papers between 1983 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Trial and error mathematics: Dialectical systems and completions of theories.
J. Log. Comput., 2019

Comparing the degrees of enumerability and the closed Medvedev degrees.
Arch. Math. Log., 2019

2018
Calibrating word problems of groups via the complexity of equivalence relations.
Mathematical Structures in Computer Science, 2018

S. Barry Cooper (1943-2015).
Computability, 2018

Jumps of computably enumerable equivalence relations.
Ann. Pure Appl. Logic, 2018

2017
A Survey on Universal Computably Enumerable Equivalence Relations.
Proceedings of the Computability and Complexity, 2017

2016
Trial and error Mathematics I: Dialectical and Quasidialectical Systems.
Rev. Symb. Log., 2016

Trial and error Mathematics II: Dialectical Sets and Quasidialectical Sets, their Degrees, and their Distribution within the class of Limit Sets.
Rev. Symb. Log., 2016

Weakly precomplete computably enumerable equivalence relations.
Math. Log. Q., 2016

Initial Segments Of The Σ20 Enumeration Degrees.
J. Symb. Log., 2016

The Complexity of Index Sets of Classes of computably Enumerable Equivalence Relations.
J. Symb. Log., 2016

In Memoriam: Barry Cooper 1943-2015.
Bulletin of Symbolic Logic, 2016

A note on the enumeration degrees of 1-generic sets.
Arch. Math. Log., 2016

2015
Generalizations of the Weak Law of the Excluded Middle.
Notre Dame Journal of Formal Logic, 2015

Friedberg numberings in the Ershov hierarchy.
Arch. Math. Log., 2015

2014
A note on initial Segments of the Enumeration Degrees.
J. Symb. Log., 2014

Universal computably Enumerable Equivalence Relations.
J. Symb. Log., 2014

2013
Singleton enumeration reducibility and arithmetic.
J. Log. Comput., 2013

2012
Rogers semilattices of families of two embedded sets in the Ershov hierarchy.
Math. Log. Q., 2012

Computability at Logic Colloquium 2009.
J. Log. Comput., 2012

Empty intervals in the enumeration degrees.
Ann. Pure Appl. Logic, 2012

Bounded enumeration reducibility and its degree structure.
Arch. Math. Log., 2012

2011
A note on algebras of languages.
Theor. Comput. Sci., 2011

Topological aspects of the Medvedev lattice.
Arch. Math. Log., 2011

Immunity properties and strong positive reducibilities.
Arch. Math. Log., 2011

2010
Diamond embeddings into the enumeration degrees.
Mathematical Structures in Computer Science, 2010

2009
Lattices of local two-dimensional languages.
Theor. Comput. Sci., 2009

Foreword.
Theor. Comput. Sci., 2009

Computation and Logic in the Real World: CiE 2007.
Theory Comput. Syst., 2009

Logic and Computation in the Real World: CiE 2007.
J. Log. Comput., 2009

Preface.
Ann. Pure Appl. Logic, 2009

High Minimal Pairs in the Enumeration Degrees.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Strong Positive Reducibilities.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

The First Order Theories of the Medvedev and Muchnik Lattices.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2008
A characterization of the Delta02 hyperhyperimmune sets.
J. Symb. Log., 2008

Preface.
Electr. Notes Theor. Comput. Sci., 2008

Intermediate logics and factors of the Medvedev lattice.
Ann. Pure Appl. Logic, 2008

Branching in the S02{Sigma02}-enumeration degrees: a new perspective.
Arch. Math. Log., 2008

2007
Bounding nonsplitting enumeration degrees.
J. Symb. Log., 2007

2006
Properly Σ02 enumeration degrees and the high/low hierarchy.
J. Symb. Log., 2006

Strong Enumeration Reducibilities.
Arch. Math. Log., 2006

2005
Bounding and nonbounding minimal pairs in the enumeration degrees.
J. Symb. Log., 2005

On Extensions of Embeddings into the Enumeration Degrees of the -Sets.
J. Mathematical Logic, 2005

On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms.
J. Comput. Syst. Sci., 2005

2003
On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms.
Proceedings of the Computational Learning Theory and Kernel Machines, 2003

2002
Embedding Finite Lattices into the Sigma02 Enumeration Degrees.
J. Symb. Log., 2002

2001
Density results in the Delta20 e-degrees.
Arch. Math. Log., 2001

2000
Structural Properties and Sigma02 Enumeration Degrees.
J. Symb. Log., 2000

The Distribution of Properly Sigma02 e-Degrees.
J. Symb. Log., 2000

1998
Sets of Generators and Automorphism Bases for the Enumeration Degrees.
Ann. Pure Appl. Logic, 1998

1996
A Note an Closed Degrees of Difficulty of the Medvedev Lattice.
Math. Log. Q., 1996

Noncappable Enumeration Degrees Below 0'e.
J. Symb. Log., 1996

Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets.
Ann. Pure Appl. Logic, 1996

Logic and probabilistic systems.
Arch. Math. Log., 1996

1994
A Note on Relative Efficiency of Axiom Systems.
Math. Log. Q., 1994

1992
Reducibility in Some Categories of Partial Recursive Operators.
Math. Log. Q., 1992

1991
Embedding Brouwer Algebras in the Medvedev Lattice.
Notre Dame Journal of Formal Logic, 1991

Some Quotient Lattices of the Medvedev Lattice.
Math. Log. Q., 1991

1990
Some Remarks on the Algebraic Structure of the Medvedev Lattice.
J. Symb. Log., 1990

On some filters and ideals of the Medvedev lattice.
Arch. Math. Log., 1990

1989
Creativeness and Completeness in Recursion Categories of Partial Recursive Operators.
J. Symb. Log., 1989

1985
Universal Recursion Theoretic Properties of R.E. Preordered Structures.
J. Symb. Log., 1985

1983
Classifying Positive Equivalence Relations.
J. Symb. Log., 1983


  Loading...