Výsledky vyhledávání - Other degrees and reducibilities in computability and recursion theory~

Control Structures in Computable Numberings and the Completion Operator: Control structures in computable numberings and the completion operator

Autoři: Faizrahmanov, Marat

Zdroj: Theory of Computing Systems. 69

Témata: computable numbering, complete numbering, Other degrees and reducibilities in computability and recursion theory, completion, universal numbering, Theory of numerations, effectively presented structures, principal numbering, Recursive functions and relations, subrecursive hierarchies

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/8037355
https://doi.org/10.1007/s00224-025-10222-1

Topological reducibilities for discontinuous functions and their structures

Autoři: Kihara, Takayuki

Zdroj: Israel Journal of Mathematics. 252:461-500

Témata: Determinacy principles, 03D30, 03E15, 03E60, 03D55, 26A21, General Topology (math.GN), FOS: Mathematics, Other degrees and reducibilities in computability and recursion theory, Mathematics - Logic, 0101 mathematics, Logic (math.LO), Descriptive set theory, 01 natural sciences, Mathematics - General Topology

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/1906.10573

Completeness Criteria for a Class of Reducibilities: Completeness criteria for a class of reducibilities

Autoři: Arslanov, M. M.

Zdroj: Russian Mathematics. 66:62-66

Témata: m-reducibility, Q-reducibility, Other Turing degree structures, Other degrees and reducibilities in computability and recursion theory, completeness criterion, 0101 mathematics, 01 natural sciences, Turing reducibility, tt-reducibility, fixed points of function

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/7659051
https://doi.org/10.3103/s1066369x22100012

On a General Method of Constructing Post Reducibilities and the Corresponding Completeness Criteria: On a general method of constructing post reducibilities and the corresponding completeness criteria

Autoři: Arslanov, M. M.

Zdroj: Lobachevskii Journal of Mathematics. 43:3430-3434

Témata: \(m\)-reducibility, \(Q\)-reducibility, Recursively (computably) enumerable sets and degrees, Other degrees and reducibilities in computability and recursion theory, completeness criterion, \(tt\)-reducibility, Turing reducibility, fixed points of function

Popis souboru: application/xml

Tabular degrees in \Ga-recursion theory: Tabular degrees in \(\alpha\)-recursion theory

Autoři: Rodney G. Downey Colin Bailey

Zdroj: Annals of Pure and Applied Logic. 55:205-236

Témata: Logic, truth-table reducibilities, regular sets, Other degrees and reducibilities in computability and recursion theory, \(\alpha\)-recursion, 0101 mathematics, 01 natural sciences, Computability and recursion theory on ordinals, admissible sets, etc

Popis souboru: application/xml

Přístupová URL adresa: https://philpapers.org/rec/BAITDI
https://dblp.uni-trier.de/db/journals/apal/apal55.html#BaileyD92
https://www.sciencedirect.com/science/article/abs/pii/016800729290036Y
https://www.sciencedirect.com/science/article/pii/016800729290036Y
https://doi.org/10.1016/0168-0072(92)90036-Y
http://www.sciencedirect.com/science/article/pii/016800729290036Y

Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices

Autoři: Ambos-Spies, Klaus Fejer, Peter A Lempp, Steffen a další

Zdroj: Journal of Symbolic Logic. 61:880-905

Témata: Recursively (computably) enumerable sets and degrees, finite lattices, decision procedure, recursive polynomial many-one degree, 01 natural sciences, \(\forall \exists\)-theory of the weak truth-table degrees, decidable fragment, recursively enumerable weak truth-table degree, Decidability of theories and sets of sentences, distributive upper semi-lattice, recursively enumerable degree, Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics, Mathematics

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S0022481200017175
https://philarchive.org/rec/AMBDOT
https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/decidability-of-the-twoquantifier-theory-of-the-recursively-enumerable-weak-truthtable-degrees-and-other-distributive-upper-semilattices/278E9ACC07A3217F0595D6371716D8DE
https://www.projecteuclid.org/euclid.jsl/1183745082
https://core.ac.uk/display/24332064
https://works.bepress.com/peter_fejer/2/

Abstract complexity theory and the Δ20 degrees: Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees

Autoři: Benjamin Schaeffer

Zdroj: Annals of Pure and Applied Logic. 115:195-231

Témata: Complexity of computation (including implicit computational complexity), Logic, Abstract Complexity Theory, Yu. L. Ershov's difference hierarchy of sets, Degrees of unsolvability, 0102 computer and information sciences, \(\Delta_{0}^{2}\) degrees, 01 natural sciences, Hierarchies of computability and definability, Δ20 degrees, generic sets, Other degrees and reducibilities in computability and recursion theory, Abstract complexity theory, degrees of unsolvability, 0101 mathematics, Generic sets

Popis souboru: application/xml

Přístupová URL adresa: https://www.sciencedirect.com/science/article/abs/pii/S0168007201000902
https://www.sciencedirect.com/science/article/pii/S0168007201000902
https://dblp.uni-trier.de/db/journals/apal/apal115.html#Schaeffer02

Lattice representations for computability theory

Autoři: Peter A. Fejer

Zdroj: Annals of Pure and Applied Logic. 94:53-74

Témata: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations, Logic, Other degrees and reducibilities in computability and recursion theory, embedding result, lattice representations, 0101 mathematics, degree-theoretic structures, Representation theory of lattices, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://www.sciencedirect.com/science/article/abs/pii/S0168007297000675
https://www.infona.pl/resource/bwmeta1.element.elsevier-fc65708c-bcfd-32a9-a5a8-e02cf852d6be
https://dblp.uni-trier.de/db/journals/apal/apal94.html#Fejer98
https://www.sciencedirect.com/science/article/pii/S0168007297000675

On the Σ2-theory of the upper semilattice of Turing degrees: On the \({\Sigma}_ 2\)-theory of the upper semilattice of Turing degrees

Autoři: Carl G. Jockusch Theodore A. Slaman

Zdroj: Journal of Symbolic Logic. 58:193-204

Témata: Recursively (computably) enumerable sets and degrees, Decidability of theories and sets of sentences, least upper bound operator, upper semilattice of Turing degrees, decidability, Other degrees and reducibilities in computability and recursion theory, least degree, \(\Sigma_ 2\)-theory, degrees of unsolvability, 0101 mathematics, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/238214
https://doi.org/10.2307/2275332

Interpreting true arithmetic in the theory of the r.e. truth table degrees

Autoři: Richard A. Shore André Nies

Zdroj: Annals of Pure and Applied Logic. 75:269-311

Témata: truth table degrees, First-order arithmetic and fragments, Recursively (computably) enumerable sets and degrees, Logic, recursively enumerable degrees, Other degrees and reducibilities in computability and recursion theory, first-order arithmetic, complexity of theories, 0101 mathematics, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://philpapers.org/rec/NIEITA-2
https://dblp.uni-trier.de/db/journals/apal/apal75.html#NiesS95
https://www.sciencedirect.com/science/article/pii/0168007294000488
https://www.sciencedirect.com/science/article/abs/pii/0168007294000488
https://core.ac.uk/display/82168146

The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory: The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory

Autoři: Theodore A. Slaman Richard A. Shore

Zdroj: Theoretical Computer Science. 97:263-284

Témata: Complexity of computation (including implicit computational complexity), density, two-quantifier theory, 0102 computer and information sciences, \(p\)- time degrees, 01 natural sciences, nonhomogeneity, Theoretical Computer Science, \(p\)-time many-one degrees, Decidability of theories and sets of sentences, polynomial-time Turing degrees of the recursive sets, recursive lattice, embedding problem, Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/65311
https://doi.org/10.1016/0304-3975(92)90078-t
https://dblp.uni-trier.de/db/journals/tcs/tcs97.html#ShoreS92
https://www.sciencedirect.com/science/article/pii/030439759290078T
https://www.sciencedirect.com/science/article/abs/pii/030439759290078T
https://doi.org/10.1016/0304-3975(92)90078-T
https://dblp.uni-trier.de/db/conf/coco/coco89.html#ShoreS89
https://ieeexplore.ieee.org/document/41804/
http://ieeexplore.ieee.org/document/41804/

Randomness, Computability, and Density: Randomness, computability, and density

Autoři: Denis R. Hirschfeldt Rodney G. Downey André Nies

Zdroj: Lecture Notes in Computer Science ISBN: 9783540416951

Témata: Applications of computability and recursion theory, Other degrees and reducibilities in computability and recursion theory, randomness, Kolmogorov complexity, 0102 computer and information sciences, 0101 mathematics, Solovay reducibility, 01 natural sciences, computably enumerable reals, algorithmic information theory, Algorithmic information theory (Kolmogorov complexity, etc.)

Popis souboru: application/xml

Přístupová URL adresa: http://math.uchicago.edu/~drh/Papers/Papers/cereals.pdf
https://dblp.uni-trier.de/db/conf/stacs/stacs2001.html#DowneyHN01
https://link.springer.com/10.1007/3-540-44693-1_17
https://link.springer.com/chapter/10.1007%2F3-540-44693-1_17
https://rd.springer.com/chapter/10.1007/3-540-44693-1_17
https://epubs.siam.org/doi/abs/10.1137/S0097539700376937
https://locus.siam.org/doi/abs/10.1137/S0097539700376937
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp31.html#DowneyHN02

Integer-Valued Martingales and Cl-Turing Reductions: Integer-valued martingales and cl-Turing reductions

Autoři: Nan Fang Lu Liu Liang Yu

Zdroj: Theoretical Computer Science. 1040:115202

Témata: algorithmic randomness, integer-valued randomness, martingale, Algorithmic randomness and dimension, integer-valued martingale, Other degrees and reducibilities in computability and recursion theory, cl-Turing reducibility, cl-tt-reduction, Algorithmic information theory (Kolmogorov complexity, etc.)

Popis souboru: application/xml

A Reducibility for the Dot-Depth Hierarchy: A reducibility for the dot-depth hierarchy

Autoři: Victor L. Selivanov Klaus W. Wagner

Zdroj: Lecture Notes in Computer Science ISBN: 9783540228233

Témata: Complexity of computation (including implicit computational complexity), Complete sets, 0102 computer and information sciences, 01 natural sciences, Hierarchies of computability and definability, Theoretical Computer Science, Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), Leaf languages, Dot-depth hierarchy, 0101 mathematics, Reducibility, Degree structure, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2235842
https://doi.org/10.1016/j.tcs.2005.07.020
https://core.ac.uk/display/82049108
https://www.sciencedirect.com/science/article/pii/S0304397505004068
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2004.html#SelivanovW04
https://link.springer.com/chapter/10.1007/978-3-540-28629-5_61
https://rd.springer.com/chapter/10.1007/978-3-540-28629-5_61

Randomness and Reductibility: Randomness and reducibility

Autoři: Rodney G. Downey Denis R. Hirschfeldt Geoff La Forte

Zdroj: Lecture Notes in Computer Science ISBN: 9783540424963

Témata: Computer Networks and Communications, Applied Mathematics, Kolmogorov complexity, 0102 computer and information sciences, Algorithmic information theory, Solovay reducibility, 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.), Theoretical Computer Science, Relative randomness, Computational Theory and Mathematics, Applications of computability and recursion theory, Other degrees and reducibilities in computability and recursion theory, 0101 mathematics, Computably enumerable reals, domination

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2099264
https://doi.org/10.1016/j.jcss.2003.07.004
https://dblp.uni-trier.de/db/journals/jcss/jcss68.html#DowneyHL04
https://www.sciencedirect.com/science/article/pii/S0022000003001314
https://core.ac.uk/display/82176402
https://link.springer.com/chapter/10.1007/3-540-44683-4_28
https://rd.springer.com/chapter/10.1007/3-540-44683-4_28

Minimal Degrees in Generalized Recursion Theory: Minimal degrees in generalized recursion theory

Autoři: Michael Machtey

Zdroj: Mathematical Logic Quarterly. 20:133-148

Témata: Other degrees and reducibilities in computability and recursion theory, 0101 mathematics, 01 natural sciences, Computability and recursion theory on ordinals, admissible sets, etc

Popis souboru: application/xml

Přístupová URL adresa: https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fmalq.19740200804
http://onlinelibrary.wiley.com/doi/10.1002/malq.19740200804/abstract

Degrees of unsolvability of continuous functions

Autoři: Miller, Joseph S.

Zdroj: J. Symbolic Logic 69, iss. 2 (2004), 555-584

Témata: computable analysis, degrees of continuous functions, complexity of continuous functions, Other degrees and reducibilities in computability and recursion theory, Scott set, 0102 computer and information sciences, 0101 mathematics, 16. Peace & justice, continuous degrees, 01 natural sciences, Constructive and recursive analysis

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://www.math.wisc.edu/~jmiller/Papers/continuous.pdf
http://projecteuclid.org/euclid.jsl/1082418543

A splitting theorem for $n-REA$ degrees: A splitting theorem for \(n\)-REA degrees

Autoři: Theodore A. Slaman Richard A. Shore

Zdroj: Proceedings of the American Mathematical Society. 129:3721-3728

Témata: Recursively (computably) enumerable sets and degrees, Turing degree, Other Turing degree structures, recursively enumerable set, Other degrees and reducibilities in computability and recursion theory, definability of the jump operator, degrees of unsolvability, 0102 computer and information sciences, 0101 mathematics, \(n\)-REA degrees, 01 natural sciences, Hierarchies of computability and definability

Popis souboru: application/xml

Přístupová URL adresa: https://www.ams.org/proc/2001-129-12/S0002-9939-01-06015-4/S0002-9939-01-06015-4.pdf
https://dialnet.unirioja.es/servlet/articulo?codigo=737290
https://www.ams.org/journals/proc/2001-129-12/S0002-9939-01-06015-4/home.html
https://www.ams.org/proc/2001-129-12/S0002-9939-01-06015-4/S0002-9939-01-06015-4.pdf

Conjectures and questions from Gerald Sacks's Degrees of Unsolvability: Conjectures and questions from Gerald Sacks's \textit{Degrees of unsolvability}

Autoři: Richard A. Shore

Zdroj: Archive for Mathematical Logic. 36:233-253

Témata: History of mathematics in the 20th century, Recursively (computably) enumerable sets and degrees, History of mathematical logic and foundations, Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations, Other degrees and reducibilities in computability and recursion theory, Undecidability and degrees of sets of sentences, degrees of unsolvability, 0101 mathematics, 01 natural sciences, Computability and recursion theory on ordinals, admissible sets, etc

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1158097
https://doi.org/10.1007/s001530050063
https://link.springer.com/article/10.1007%2Fs001530050063
http://www.math.cornell.edu/~shore/papers/pdf/sackstp3.pdf
https://dblp.uni-trier.de/db/journals/aml/aml36.html#Shore97

Separations by random oracles and 'Almost' classes for generalized reducibilities: Extended abstract

Autoři: Yongge Wang Wolfgang Merkle

Zdroj: Lecture Notes in Computer Science ISBN: 9783540602460

Témata: Complexity of computation (including implicit computational complexity), measurable classes of sets, Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), resource-bounded reducibilities, random oracles, almost classes, generalized reducibilities, 16. Peace & justice, Abstract and axiomatic computability and recursion theory

Popis souboru: application/xml

Přístupová URL adresa: https://dialnet.unirioja.es/servlet/articulo?codigo=2805273
https://dblp.uni-trier.de/db/journals/mlq/mlq47.html#MerkleW01
https://link.springer.com/chapter/10.1007%2F3-540-60246-1_124
https://dblp.uni-trier.de/db/conf/mfcs/mfcs95.html#MerkleW95
https://philpapers.org/rec/WANSBR
https://math.uni-heidelberg.de/logic/merkle/final-versions/MLQ-almost.pdf
https://rd.springer.com/chapter/10.1007/3-540-60246-1_124