Sage Journals: Discover world-class research

Retricted access

Research article

First published 2016-12-22

Computably enumerable sets that are automorphic to low sets

Peter Cholak, Rachel Epstein

Computability

Retricted access

Research article

First published 2021-10-7

Nonlowness is independent from fickleness

Liling Ko

Computability

Retricted access

Research article

First published 2018-1-16

Computable intersection points

Zvonko Iljazović, Bojan Pažek

Computability

Free access

Research article

First published 2024-3-20

Lowness properties for strong reducibilities and the computational power of maximal sets

Klaus Ambos-Spies, Rod Downey, Martin Monath

Computability

Retricted access

Research article

First published 2019-9-20

Splitting theorems and low degrees

Ellen Chih, Rod G. Downey

Computability

Free access

Research article

First published 2024-3-20

Enumerations of families closed under finite differences

Noam Greenberg, Matthew Harrison-Trainor, Joseph S. Miller [...]

Computability

Retricted access

Research article

First published 2022-12-21

Extending properly n - REA sets 1

Peter Cholak, Peter Gerdes

Computability

Retricted access

Research article

First published 2008-2

Computability Theoretic Properties of the Entropy of Gap Shifts

Peter Hertling, Christoph Spandl

Fundamenta Informaticae

Retricted access

Research article

First published 2012-9

Computably Enumerable Partial Orders

Peter A. Cholak, Damir D. Dzhafarov, Noah Schweber [...]

Computability

Retricted access

Research article

First published 2019

Model Enumeration via Assumption Literals

Mario Alviano, Carmine Dodaro

Fundamenta Informaticae

Search results