Andrea Sorbi

发表

Structural Properties and Sigma02 Enumeration Degrees

André Nies, Andrea Sorbi, 2000, J. Symb. Log..

Computation and Logic in the Real World

Andrea Sorbi, Benedikt Löwe, S Barry Cooper, 2007, Lecture Notes in Computer Science.

Incomparability in local structures of s-degrees and Q-degrees

Andrea Sorbi, Keng Meng Ng, Irakli O. Chitaia, 2020, Arch. Math. Log..

High Minimal Pairs in the Enumeration Degrees

Guohua Wu, Yue Yang, Andrea Sorbi, 2009, TAMC.

Bounding nonsplitting enumeration degrees

Andrea Sorbi, Thomas F. Kent, 2007, J. Symb. Log..

Branching in the InlineEquation ID=" IEq1"> ImageObject FileRef=" 153200881ArticleIEq1. gif" Format=" GIF" Color=" BlackWhit" Type=" Linedraw" Rendition=" HTML"/> EquationSource Format=" TEX">-enumeration

Andrea Sorbi, Thomas F. Kent, Maria L. Affatato, 2008 .

Weakly precomplete computably enumerable equivalence relations

Andrea Sorbi, Serikzhan A. Badaev, 2016, Math. Log. Q..

Bounding and nonbounding minimal pairs in the enumeration degrees

Yue Yang, Andrea Sorbi, Angsheng Li, 2005, Journal of Symbolic Logic.

Preface

Andrea Sorbi, Klaus Weihrauch, Ning Zhong, 2008, Electron. Notes Theor. Comput. Sci..

On Extensions of Embeddings into the Enumeration Degrees of the -Sets

Andrea Sorbi, Steffen Lempp, Theodore A. Slaman, 2005, J. Math. Log..

A note on the enumeration degrees of 1-generic sets

Andrea Sorbi, Thomas F. Kent, Hristo Ganchev, 2016, Arch. Math. Log..

A Survey on Universal Computably Enumerable Equivalence Relations

Andrea Sorbi, Serikzhan A. Badaev, Uri Andrews, 2017, Computability and Complexity.

Comparing the degrees of enumerability and the closed Medvedev degrees

Andrea Sorbi, Paul Shafer, 2019, Arch. Math. Log..

Generalizations of the Weak Law of the Excluded Middle

Andrea Sorbi, Sebastiaan Terwijn, A. Sorbi, 2011, Notre Dame J. Formal Log..

Some Remarks on the Algebraic Structure of the Medvedev Lattice

Andrea Sorbi, 1990, J. Symb. Log..

The First Order Theories of the Medvedev and Muchnik Lattices

André Nies, Andrea Sorbi, Andrew E. M. Lewis, 2009, CiE.

Noncappable enumeration degrees below 0e′

Andrea Sorbi, S. Barry Cooper, S. Cooper, 1996, Journal of Symbolic Logic.

Calibrating word problems of groups via the complexity of equivalence relations

André Nies, Andrea Sorbi, 2018, Math. Struct. Comput. Sci..

Computation and Logic in the Real World: CiE 2007

Andrea Sorbi, S. Barry Cooper, Elvira Mayordomo, 2008, Theory of Computing Systems.

On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms

John Case, Franco Montagna, Sanjay Jain, 2005, J. Comput. Syst. Sci..

A note on algebras of languages

Andrea Sorbi, Claudio Marini, Giulia Simi, 2011, Theor. Comput. Sci..

Creativeness and completeness in recursion categories of partial recursive operators

Franco Montagna, Andrea Sorbi, A. Sorbi, 1989, Journal of Symbolic Logic.

Strong Enumeration Reducibilities

Andrea Sorbi, Roland Sh. Omanadze, A. Sorbi, 2006, Arch. Math. Log..

A note on uniform density in weak arithmetical theories

Andrea Sorbi, Duccio Pianigiani, 2021, Arch. Math. Log..

S. Barry Cooper (1943-2015)

Peter van Emde Boas, Andrea Sorbi, Dag Normann, 2018, Comput..

Preface

Samuel R. Buss, Andrea Sorbi, S. Barry Cooper, 2009, Ann. Pure Appl. Log..

Joins and meets in the structure of ceers

Andrea Sorbi, Uri Andrews, 2019, Comput..

Immunity properties and strong positive reducibilities

Andrea Sorbi, Irakli O. Chitaia, Roland Sh. Omanadze, 2011, Arch. Math. Log..

Word problems and ceers

Andrea Sorbi, Luca San Mauro, Valentino Delle Rose, 2020, Math. Log. Q..

Reducibility in Some Categories of Partial Recursive Operators

Andrea Sorbi, Caterina Bianchini, 1992, Math. Log. Q..

Classifying Positive Equivalence Relations

Andrea Sorbi, Claudio Bernardi, 1983, J. Symb. Log..

Universal Recursion Theoretic Properties of R.E. Preordered Structures

Franco Montagna, Andrea Sorbi, 1985, J. Symb. Log..

A characterization of the Delta02 hyperhyperimmune sets

Andrea Sorbi, Roland Sh. Omanadze, 2008, J. Symb. Log..

Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World

Andrea Sorbi, Benedikt Löwe, S. Barry Cooper, 2007 .

The Distribution of Properly Sigma02 e-Degrees

Andrea Sorbi, Richard Coles, Stanislaw Bereznyuk, 2000, J. Symb. Log..

Trial and error mathematics: Dialectical systems and completions of theories

Andrea Sorbi, Luca San Mauro, Uri Andrews, 2019, J. Log. Comput..

The theory of ceers computes true arithmetic

Andrea Sorbi, Uri Andrews, Noah Schweber, 2020, Ann. Pure Appl. Log..

Logic and Computation in the Real World: CiE 2007

Andrea Sorbi, Benedikt Löwe, S. Barry Cooper, 2009, J. Log. Comput..

Properly enumeration degrees and the high/low hierarchy

Yue Yang, Andrea Sorbi, Matthew Giorgi, 2006, Journal of Symbolic Logic.

Jumps of computably enumerable equivalence relations

Andrea Sorbi, Uri Andrews, 2018, Ann. Pure Appl. Log..

In Memoriam: Barry Cooper 1943-2015

Andrea Sorbi, Andy Lewis-Pye, A. Sorbi, 2016, Bull. Symb. Log..

Embedding Finite Lattices into the Sigma02 Enumeration Degrees

Andrea Sorbi, Steffen Lempp, 2002, J. Symb. Log..

Friedberg numberings in the Ershov hierarchy

Andrea Sorbi, Serikzhan A. Badaev, Manat Mustafa, 2015, Arch. Math. Log..

Empty intervals in the enumeration degrees

Andrea Sorbi, Thomas F. Kent, Andrew E. M. Lewis, 2012, Ann. Pure Appl. Log..

Some remarks on tiling recognizable languages

Andrea Sorbi, F. Frosini A. Rinaldi S. De Carli, 2005 .

TRIAL AND ERROR MATHEMATICS II: DIALECTICAL SETS AND QUASIDIALECTICAL SETS, THEIR DEGREES, AND THEIR DISTRIBUTION WITHIN THE CLASS OF LIMIT SETS

Andrea Sorbi, Luca San Mauro, Jacopo Amidei, 2016, The Review of Symbolic Logic.

Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets

Andrea Sorbi, S. Barry Cooper, Xiaoding Yi, 1996, Ann. Pure Appl. Log..

Initial Segments Of The Σ20 Enumeration Degrees

Andrea Sorbi, Hristo Ganchev, 2016, J. Symb. Log..

On some filters and ideals of the Medvedev lattice

Andrea Sorbi, A. Sorbi, 1990, Arch. Math. Log..

Taking the Pirahã seriously

Franco Montagna, Andrea Sorbi, Giulia Simi, 2015, Commun. Nonlinear Sci. Numer. Simul..

Branching in the $${\Sigma^0_2}$$ -enumeration degrees: a new perspective

Andrea Sorbi, Thomas F. Kent, Maria L. Affatato, 2008, Arch. Math. Log..

Universal computably Enumerable Equivalence Relations

Andrea Sorbi, Steffen Lempp, Keng Meng Ng, 2014, J. Symb. Log..

New Computational Paradigms: Changing Conceptions of What is Computable

Andrea Sorbi, S. Barry Cooper, Benedikt Lwe, 2007 .

Rogers semilattices of families of two embedded sets in the Ershov hierarchy

Andrea Sorbi, Serikzhan A. Badaev, Manat Mustafa, 2012, Math. Log. Q..

Bounded enumeration reducibility and its degree structure

Andrea Sorbi, Daniele Marsibilio, A. Sorbi, 2012, Arch. Math. Log..

Density results in the Δ20 e-degrees

Andrea Sorbi, Iskander Sh. Kalimullin, Marat M. Arslanov, 2001, Arch. Math. Log..

Lattices of local two-dimensional languages

Andrea Sorbi, Andrea Frosini, Simone Rinaldi, 2009, Theor. Comput. Sci..

On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms

John Case, Franco Montagna, Sanjay Jain, 2003, COLT.

Logic and probabilistic systems

Franco Montagna, Andrea Sorbi, Giulia Simi, 1996, Arch. Math. Log..

Intermediate logics and factors of the Medvedev lattice

Andrea Sorbi, Sebastiaan Terwijn, A. Sorbi, 2006, Ann. Pure Appl. Log..

Self-full ceers and the uniform join operator

Andrea Sorbi, Uri Andrews, Noah Schweber, 2020, J. Log. Comput..

The Medvedev lattice of degrees of difficulty

Andrea Sorbi, A. Sorbi, 1996 .

Diamond embeddings into the enumeration degrees

Guohua Wu, Yue Yang, Andrea Sorbi, 2010, Math. Struct. Comput. Sci..

Topological aspects of the Medvedev lattice

Andrea Sorbi, Richard A. Shore, Andrew E. M. Lewis, 2011, Arch. Math. Log..

Classifying equivalence relations in the Ershov hierarchy

Andrea Sorbi, Luca San Mauro, Mars M. Yamaleev, 2020, Arch. Math. Log..

TRIAL AND ERROR MATHEMATICS I: DIALECTICAL AND QUASIDIALECTICAL SYSTEMS

Andrea Sorbi, Luca San Mauro, Giulia Simi, 2016, The Review of Symbolic Logic.

A Note on Relative Efficiency of Axiom Systems

Franco Montagna, Andrea Sorbi, Sandra Fontani, 1994, Math. Log. Q..

Embedding Brouwer Algebras in the Medvedev Lattice

Andrea Sorbi, A. Sorbi, 1991, Notre Dame J. Formal Log..

Computability at Logic Colloquium 2009

Andrea Sorbi, S. Barry Cooper, Alexandra A. Soskova, 2012, J. Log. Comput..

Singleton enumeration reducibility and arithmetic

Andrea Sorbi, Daniele Marsibilio, A. Sorbi, 2013, J. Log. Comput..

Sets of Generators and Automorphism Bases for the Enumeration Degrees

Andrea Sorbi, 1998, Ann. Pure Appl. Log..

The Complexity of Index Sets of Classes of computably Enumerable Equivalence Relations

Andrea Sorbi, Uri Andrews, 2016, J. Symb. Log..

A Note an Closed Degrees of Difficulty of the Medvedev Lattice

Andrea Sorbi, Caterina Bianchini, 1996, Math. Log. Q..

A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES

Andrea Sorbi, Theodore A. Slaman, A. Sorbi, 2014, The Journal of Symbolic Logic.

Strong Positive Reducibilities

Andrea Sorbi, 2009, TAMC.

Some Quotient Lattices of the Medvedev Lattice

Andrea Sorbi, A. Sorbi, 1991, Math. Log. Q..

Notes on conjunctive and Quasi degrees

Andrea Sorbi, Irakli O. Chitaia, Roland Sh. Omanadze, 2021, J. Log. Comput..

Effective Inseparability and Its Applications

Andrea Sorbi, 2021, CiE.

Punctual equivalence relations and their (punctual) complexity

Andrea Sorbi, Keng Meng Ng, Luca San Mauro, 2021 .

A note on the category of equivalence relations

Andrea Sorbi, Luca San Mauro, Valentino Delle Rose, 2021 .

Branching in the enumeration degrees of the Σ20 sets

Andrea Sorbi, André Nies, 1999 .

On elementary theories and isomorphism types of Rogers semilattices

Andrea Sorbi, Serikzhan Badaev, Sergey S. Goncharov, 2006 .

Isomorphism Types and Theories of Rogers Semilattices of Arithmetical Numberings

Andrea Sorbi, Sergey Goncharov, Serikzhan Badaev, 2003 .

Pomology observations, morphometric analysis, ultrastructural study and allelic profiles of "olivastra Seggianese" endocarps from ancient olive trees (Olea europaea L.).

Andrea Sorbi, Federico Pallottino, Francesca Antonucci, 2011, Comptes rendus biologies.

Structural properties and σ02 enumeration degrees

Andrea Sorbi, André Nies, 2000 .

Embeddings into the enumeration degrees

Andrea Sorbi, 2002 .

Positive undecidable numberings in the Ershov hierarchy

Andrea Sorbi, Mustafa Manat, 2012 .

The first order theories of the Medvedev and the Muchnik lattice

Andrea Sorbi, Andre Nies, A. Sorbi, 2009 .

Intuitionistic logic and Muchnik degrees

Andrea Sorbi, Sebastiaan A. Terwijn, A. Sorbi, 2010, 1003.4489.

Algebraic Properties of Rogers Semilattices of Arithmetical Numberings

Andrea Sorbi, Sergey Goncharov, Serikzhan Badaev, 2003 .

Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy

Andrea Sorbi, Serikzhan Badaev, S. S. Goncharov, 2006 .

Completeness and Universality of Arithmetical Numberings

Andrea Sorbi, Sergey Goncharov, Serikzhan Badaev, 2003 .

Structural properties and Σ20 enumeration degrees

Andrea Sorbi, André Nies, 2000, Journal of Symbolic Logic.