Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • realized by c.e. equivalence relations 2017-09-11 Paper Turing computable embeddings, computable infinitary equivalence, and linear orders 2017-08-04 Paper...
    10 bytes (14 words) - 17:02, 11 December 2023
  • Publication Type Degree spectra of real closed fields 2019-03-27 Paper Turing Computable Embeddings and Coding Families of Sets 2012-08-14 Paper...
    10 bytes (16 words) - 18:32, 24 September 2023
  • problem for some classes of computable algebraic structures 2022-07-15 Paper Computability and Definability 2021-06-15 Paper Turing degrees and automorphism...
    10 bytes (16 words) - 13:05, 10 December 2023
  • strings and truth-table degrees of Turing complete c.e. sets 2014-09-30 Paper Computable categoricity versus relative computable categoricity 2013-05-10 Paper...
    10 bytes (15 words) - 00:55, 25 September 2023
  • and Functions in Computable Analysis 2007-11-13 Paper Computable Riesz representation for the dual of C [0; 1] 2007-09-17 Paper Computable metrization 2007-09-17...
    10 bytes (13 words) - 15:57, 6 December 2023
  • 2014-02-21 Paper Turing and enumeration jumps in the Ershov hierarchy 2012-09-05 Paper Computable numberings of families of low sets and Turing jumps in the...
    10 bytes (15 words) - 05:50, 12 December 2023
  • property 2005-08-29 Paper Embedding and coding below a 1-generic degree 2005-07-06 Paper Embedding jump upper semilattices into the Turing degrees 2005-02-09...
    10 bytes (13 words) - 00:11, 12 December 2023
  • array computable degrees 2010-03-08 Paper https://portal.mardi4nfdi.de/entity/Q3656425 2010-01-13 Paper On computable self-embeddings of computable linear...
    10 bytes (17 words) - 04:59, 9 December 2023
  • Boolean algebras, Stone spaces, and the iterated Turing jump 1995-08-27 Paper Weak presentations of computable fields 1995-06-08 Paper Every Low Boolean Algebra...
    10 bytes (19 words) - 10:13, 7 October 2023
  • of degree structures 2003-09-25 Paper Embedding finite lattices into the ideals of computably enumerable turing degrees 2002-07-23 Paper https://portal...
    10 bytes (13 words) - 00:41, 13 December 2023
  • Paper Isomorphism relations on computable structures 2012-04-19 Paper Limit computable integer parts 2011-11-23 Paper COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm...
    10 bytes (15 words) - 18:37, 11 December 2023
  • 2015-05-20 Paper COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY 2015-05-20 Paper DNR and incomparable Turing degrees 2015-04-10...
    10 bytes (13 words) - 03:11, 25 September 2023
  • 2005-03-08 Paper Computable total functions on metric algebras, universal algebraic specifications and dynamical systems 2005-02-22 Paper Computable and Continuous...
    10 bytes (15 words) - 23:41, 24 September 2023
  • Absolutely non-computable predicates and functions in analysis 2009-03-24 Paper Absolutely Non-effective Predicates and Functions in Computable Analysis 2007-11-13...
    10 bytes (13 words) - 14:21, 6 December 2023
  • 2013-01-07 Paper Embedding countable partial orderings in the enumeration degrees and the \(\omega \)-enumeration degrees 2012-09-05 Paper Embedding distributive...
    10 bytes (16 words) - 02:47, 12 December 2023
  • \(\omega\)-Turing degrees 2014-06-06 Paper Interpreting true arithmetic in the local structure of the enumeration degrees 2013-01-07 Paper Embedding distributive...
    10 bytes (15 words) - 11:32, 28 January 2024
  • Paper A Church-Turing thesis for randomness? 2022-03-22 Paper Degrees of and lowness for isometric isomorphism 2021-01-22 Paper Computable classifications...
    10 bytes (17 words) - 10:12, 6 October 2023
  • 2023-01-12 Paper Stable multi-level monotonic eroders 2022-02-14 Paper A reliable Turing machine 2021-12-03 Paper A new version of Toom's proof 2021-05-12 Paper...
    10 bytes (13 words) - 03:04, 9 December 2023
  • 2013-08-05 Paper Abstract geometrical computation. V: Embedding computable analysis 2012-11-15 Paper Computing in the Fractal Cloud: Modular Generic Solvers for...
    10 bytes (17 words) - 22:00, 9 December 2023
  • diamond embeddings 2012-03-29 Paper An almost-universal cupping degree 2011-12-23 Paper ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR...
    10 bytes (13 words) - 00:17, 10 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)