We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:
Mathematics

Search Results

Showing 1-20 of 53 results

  1. Using Ramsey’s theorem once

    Jeffry L. Hirst, Carl Mummert in Archive for Mathematical Logic
    Article 22 February 2019

  2. Comparing the degrees of enumerability and the closed Medvedev degrees

    We compare the degrees of enumerability and the closed Medvedev degrees and find that many situations occur. There are nonzero closed degrees that do...

    Paul Shafer, Andrea Sorbi in Archive for Mathematical Logic
    Article Open access 28 September 2018

  3. Non-low2-ness and computable Lipschitz reducibility

    In this paper, we prove that if a c.e. Turing degree d is non-low 2 , then there are two left-c.e. reals β 0 , β 1 in d , such that, if β ...

    Yun Fan in Acta Mathematica Sinica, English Series
    Article 25 June 2017

  4. Bounded low and high sets

    Anderson and Csima (Notre Dame J Form Log 55(2):245–264, 2014 ) defined a jump operator, the bounded jump , with respect to bounded Turing (or weak...

    Bernard A. Anderson, Barbara F. Csima, Karen M. Lange in Archive for Mathematical Logic
    Article 28 April 2017

  5. A note on the enumeration degrees of 1-generic sets

    Liliana Badillo, Caterina Bianchini, ... Andrea Sorbi in Archive for Mathematical Logic
    Article 12 December 2015

  7. Natural factors of the Medvedev lattice capturing IPC

    Skvortsova showed that there is a factor of the Medvedev lattice which captures intuitionistic propositional logic (IPC). However, her factor is...

    Rutger Kuyper in Archive for Mathematical Logic
    Article 29 July 2014

  8. Polynomial clone reducibility

    Polynomial clone reducibilities are generalizations of the truth-table reducibilities. A polynomial clone is a set of functions over a finite set X ...

    Quinn Culver in Archive for Mathematical Logic
    Article 11 September 2013

  9. Q 1-degrees of c.e. sets

    R. Sh. Omanadze, I. O. Chitaia in Archive for Mathematical Logic
    Article 17 March 2012

  10. Intuitionistic logic and Muchnik degrees

    We prove that there is a factor of the Muchnik lattice that captures intuitionistic propositional logic. This complements a now classic result of...

    Andrea Sorbi, Sebastiaan A. Terwijn in Algebra universalis
    Article Open access 16 February 2012

  11. Bounded enumeration reducibility and its degree structure

    We study a strong enumeration reducibility, called bounded enumeration reducibility and denoted by ≤ be , which is a natural extension of...

    Daniele Marsibilio, Andrea Sorbi in Archive for Mathematical Logic
    Article 20 December 2011

  12. Badness and jump inversion in the enumeration degrees

    This paper continues the investigation into the relationship between good approximations and jump inversion initiated by Griffith. Firstly it is...

    Charles M. Harris in Archive for Mathematical Logic
    Article 21 February 2012

  13. Binary subtrees with few labeled paths

    We prove several quantitative Ramseyan results involving ternary complete trees with {0,1}-labeled edges where we attempt to find a complete binary...

    Rodney G. Downey, Noam Greenberg, ... Kevin G. Milans in Combinatorica
    Article 01 May 2011

  14. Immunity properties and strong positive reducibilities

    We use certain strong Q-reducibilities, and their corresponding strong positive reducibilities, to characterize the hyperimmune sets and the...

    Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi in Archive for Mathematical Logic
    Article 30 October 2010

  15. Topological aspects of the Medvedev lattice

    We study the Medvedev degrees of mass problems with distinguished topological properties, such as denseness, closedness, or discreteness. We...

    Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi in Archive for Mathematical Logic
    Article 02 November 2010

  16. A superhigh diamond in the c.e. tt-degrees

    The notion of superhigh computably enumerable (c.e.) degrees was first introduced by (Mohrherr in Z Math Logik Grundlag Math 32: 5–12, 1986) where...

    Douglas Cenzer, Johanna N. Y. Franklin, ... Guohua Wu in Archive for Mathematical Logic
    Article 15 July 2010

  20. Free MVn-algebras

    In this note we characterize free algebras in varieties of MV-algebras generated by a finite chain L n as algebras of continuous functions from the...

    Manuela Busaniche, Roberto Cignoli in Algebra universalis
    Article 14 May 2008
Did you find what you were looking for? Share feedback.