Endrullis, Jörg; Klop, Jan Willem; Overbeek, Roy Decreasing diagrams for confluence and commutation. (English) Zbl 07199582 Log. Methods Comput. Sci. 16, No. 1, Paper No. 23, 25 p. (2020). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{J. Endrullis} et al., Log. Methods Comput. Sci. 16, No. 1, Paper No. 23, 25 p. (2020; Zbl 07199582) Full Text: arXiv Link OpenURL
Meseguer, José Generalized rewrite theories, coherence completion, and symbolic methods. (English) Zbl 1496.68166 J. Log. Algebr. Methods Program. 110, Article ID 100483, 39 p. (2020). MSC: 68Q42 68Q60 PDF BibTeX XML Cite \textit{J. Meseguer}, J. Log. Algebr. Methods Program. 110, Article ID 100483, 39 p. (2020; Zbl 1496.68166) Full Text: DOI Link OpenURL
Downey, Rodney G.; Nandakumar, Satyadev A weakly 2-generic which bounds a minimal degree. (English) Zbl 1444.03135 J. Symb. Log. 84, No. 4, 1326-1347 (2019). Reviewer: Roman Murawski (Poznań) MSC: 03D30 03D25 03D28 PDF BibTeX XML Cite \textit{R. G. Downey} and \textit{S. Nandakumar}, J. Symb. Log. 84, No. 4, 1326--1347 (2019; Zbl 1444.03135) Full Text: DOI OpenURL
Endrullis, Jörg; Karhumäki, Juhani; Klop, Jan Willem; Saarela, Aleksi Degrees of infinite words, polynomials and atoms. (English) Zbl 1404.68068 Int. J. Found. Comput. Sci. 29, No. 5, 825-843 (2018). Reviewer: Michel Rigo (Liège) MSC: 68Q45 68R15 PDF BibTeX XML Cite \textit{J. Endrullis} et al., Int. J. Found. Comput. Sci. 29, No. 5, 825--843 (2018; Zbl 1404.68068) Full Text: DOI arXiv OpenURL
Endrullis, Jörg; Karhumäki, Juhani; Klop, Jan Willem; Saarela, Aleksi Degrees of infinite words, polynomials and atoms. (English) Zbl 1436.68170 Brlek, Srečko (ed.) et al., Developments in language theory. 20th international conference, DLT 2016, Montréal, Canada, July 25–28, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9840, 164-176 (2016). MSC: 68Q45 03D05 PDF BibTeX XML Cite \textit{J. Endrullis} et al., Lect. Notes Comput. Sci. 9840, 164--176 (2016; Zbl 1436.68170) Full Text: DOI Link OpenURL
Krylov, S. M. Mathematical foundations of epistemology based on experiments. (Russian. English summary) Zbl 1438.03001 Vestn. Samar. Gos. Tekh. Univ., Ser. Fiz.-Mat. Nauki 19, No. 3, 534-558 (2015). MSC: 03A10 PDF BibTeX XML Cite \textit{S. M. Krylov}, Vestn. Samar. Gos. Tekh. Univ., Ser. Fiz.-Mat. Nauki 19, No. 3, 534--558 (2015; Zbl 1438.03001) Full Text: DOI MNR OpenURL
Korovina, Margarita; Kudinov, Oleg Rice’s theorem in effectively enumerable topological spaces. (English) Zbl 1461.03038 Beckmann, Arnold (ed.) et al., Evolving computability. 11th conference on computability in Europe, CiE 2015, Bucharest, Romania, June 29 – July 3, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9136, 226-235 (2015). MSC: 03D45 03D78 PDF BibTeX XML Cite \textit{M. Korovina} and \textit{O. Kudinov}, Lect. Notes Comput. Sci. 9136, 226--235 (2015; Zbl 1461.03038) Full Text: DOI OpenURL
Endrullis, Jörg; Hendriks, Dimitri; Bakhshi, Rena; Roşu, Grigore On the complexity of stream equality. (English) Zbl 1297.68050 J. Funct. Program. 24, No. 2-3, 166-217 (2014). MSC: 68N18 PDF BibTeX XML Cite \textit{J. Endrullis} et al., J. Funct. Program. 24, No. 2--3, 166--217 (2014; Zbl 1297.68050) Full Text: DOI OpenURL
Krylov, Sergeĭ Mikhaĭlovich Prospects of metamathematical structures in science. (Russian. English summary) Zbl 1449.00001 Vestn. Samar. Gos. Tekh. Univ., Ser. Fiz.-Mat. Nauki 2013, No. 2(31), 101-110 (2013). MSC: 00A30 00A79 70A05 PDF BibTeX XML Cite \textit{S. M. Krylov}, Vestn. Samar. Gos. Tekh. Univ., Ser. Fiz.-Mat. Nauki 2013, No. 2(31), 101--110 (2013; Zbl 1449.00001) Full Text: DOI MNR OpenURL
Lavrov, I. A. Computably enumerable sets and related issues. (English. Russian original) Zbl 1260.03078 Algebra Logic 50, No. 6, 494-511 (2012); translation from Algebra Logika 50, No. 6, 733-758 (2011). Reviewer: Patrizio Cintioli (Camerino) MSC: 03D25 PDF BibTeX XML Cite \textit{I. A. Lavrov}, Algebra Logic 50, No. 6, 494--511 (2012; Zbl 1260.03078); translation from Algebra Logika 50, No. 6, 733--758 (2011) Full Text: DOI OpenURL
Case, John; Jain, Sanjay; Sharma, Arun Anomalous learning helps succinctness. (English) Zbl 0874.68249 Theor. Comput. Sci. 164, No. 1-2, 13-28 (1996). MSC: 68T05 PDF BibTeX XML Cite \textit{J. Case} et al., Theor. Comput. Sci. 164, No. 1--2, 13--28 (1996; Zbl 0874.68249) Full Text: DOI OpenURL
Baliga, Ganesh; Case, John; Jain, Sanjay; Suraj, Mandayam Machine learning of higher-order programs. (English) Zbl 0814.03034 J. Symb. Log. 59, No. 2, 486-500 (1994). Reviewer: P.Jančar (Ostrava) MSC: 03D80 68Q05 68T05 PDF BibTeX XML Cite \textit{G. Baliga} et al., J. Symb. Log. 59, No. 2, 486--500 (1994; Zbl 0814.03034) Full Text: DOI OpenURL
Lewis, Alain A. On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making. (English) Zbl 0767.03024 Math. Soc. Sci. 24, No. 2-3, 141-171 (1992). MSC: 03D25 91B50 91A35 90C60 68Q25 PDF BibTeX XML Cite \textit{A. A. Lewis}, Math. Soc. Sci. 24, No. 2--3, 141--171 (1992; Zbl 0767.03024) Full Text: DOI OpenURL
Khisamiev, N. G. Arithmetic hierarchy of Abelian groups. (English. Russian original) Zbl 0679.20047 Sib. Math. J. 29, No. 6, 987-999 (1988); translation from Sib. Mat. Zh. 29, No. 6(172), 144-159 (1988). MSC: 20K25 20A15 03D55 20K20 PDF BibTeX XML Cite \textit{N. G. Khisamiev}, Sib. Math. J. 29, No. 6, 987--999 (1988; Zbl 0679.20047); translation from Sib. Mat. Zh. 29, No. 6(172), 144--159 (1988) Full Text: DOI OpenURL
Lewis, Alain A. Lower bounds on degrees of game-theoretic structures. (English) Zbl 0651.90110 Math. Soc. Sci. 16, No. 1, 1-39 (1988). MSC: 91A99 03C57 03D10 03D20 03D30 PDF BibTeX XML Cite \textit{A. A. Lewis}, Math. Soc. Sci. 16, No. 1, 1--39 (1988; Zbl 0651.90110) Full Text: DOI OpenURL
Kelly, Jerry S. Social choice and computational complexity. (English) Zbl 0642.90005 J. Math. Econ. 17, No. 1, 1-8 (1988). MSC: 91B14 68Q25 PDF BibTeX XML Cite \textit{J. S. Kelly}, J. Math. Econ. 17, No. 1, 1--8 (1988; Zbl 0642.90005) Full Text: DOI OpenURL
McLaughlin, T. G. Some elementary degree-theoretic reasons why structures need similarity types. (English) Zbl 0643.03031 J. Symb. Log. 51, 732-747 (1986). Reviewer: O.V.Belegradek MSC: 03D45 03C57 PDF BibTeX XML Cite \textit{T. G. McLaughlin}, J. Symb. Log. 51, 732--747 (1986; Zbl 0643.03031) Full Text: DOI OpenURL
Thompson, Simon Priority arguments in the continuous r.e. degrees. (English) Zbl 0601.03018 J. Symb. Log. 50, 661-667 (1985). MSC: 03D65 03D25 PDF BibTeX XML Cite \textit{S. Thompson}, J. Symb. Log. 50, 661--667 (1985; Zbl 0601.03018) Full Text: DOI OpenURL
Lewis, Alain A. The minimum degree of recursively representable choice functions. (English) Zbl 0587.03036 Math. Soc. Sci. 10, 179-188 (1985). MSC: 03D45 91B06 03D20 03D25 03D15 PDF BibTeX XML Cite \textit{A. A. Lewis}, Math. Soc. Sci. 10, 179--188 (1985; Zbl 0587.03036) Full Text: DOI OpenURL
Welch, Lawrence V. A hierarchy of families of recursively enumerable degrees. (English) Zbl 0579.03029 J. Symb. Log. 49, 1160-1170 (1984). Reviewer: R.Sh.Omanadze (Tbilisi) MSC: 03D25 03D30 PDF BibTeX XML Cite \textit{L. V. Welch}, J. Symb. Log. 49, 1160--1170 (1984; Zbl 0579.03029) Full Text: DOI OpenURL
Knight, Julia; Lachlan, Alistair H.; Soare, Robert I. Two theorems on degrees of models of true arithmetic. (English) Zbl 0576.03044 J. Symb. Log. 49, 425-436 (1984). Reviewer: R.Murawski MSC: 03H15 03F30 03D30 03C62 PDF BibTeX XML Cite \textit{J. Knight} et al., J. Symb. Log. 49, 425--436 (1984; Zbl 0576.03044) Full Text: DOI OpenURL
Clote, Peter A recursion theoretic analysis of the clopen Ramsey theorem. (English) Zbl 0574.03030 J. Symb. Log. 49, 376-400 (1984). MSC: 03D55 03E30 05C55 03D80 PDF BibTeX XML Cite \textit{P. Clote}, J. Symb. Log. 49, 376--400 (1984; Zbl 0574.03030) Full Text: DOI Backlinks: MO OpenURL
Case, John; Smith, Carl Comparison of identification criteria for machine inductive inference. (English) Zbl 0524.03025 Theor. Comput. Sci. 25, 193-220 (1983). MSC: 03D10 03D15 03D20 PDF BibTeX XML Cite \textit{J. Case} and \textit{C. Smith}, Theor. Comput. Sci. 25, 193--220 (1983; Zbl 0524.03025) Full Text: DOI OpenURL
Fejer, Peter A. Branching degrees above low degrees. (English) Zbl 0498.03028 Trans. Am. Math. Soc. 273, 157-180 (1982). MSC: 03D25 PDF BibTeX XML Cite \textit{P. A. Fejer}, Trans. Am. Math. Soc. 273, 157--180 (1982; Zbl 0498.03028) Full Text: DOI OpenURL
Posner, David B.; Robinson, Robert W. Degrees joining to 0’. (English) Zbl 0517.03014 J. Symb. Log. 46, 714-722 (1981). MSC: 03D30 PDF BibTeX XML Cite \textit{D. B. Posner} and \textit{R. W. Robinson}, J. Symb. Log. 46, 714--722 (1981; Zbl 0517.03014) Full Text: DOI OpenURL
Daley, Robert P. Busy beaver sets and the degrees of unsolvability. (English) Zbl 0486.03022 J. Symb. Log. 46, 460-474 (1981). MSC: 03D15 03D30 PDF BibTeX XML Cite \textit{R. P. Daley}, J. Symb. Log. 46, 460--474 (1981; Zbl 0486.03022) Full Text: DOI OpenURL
Lukavcova, Milena On computable real functions. (English) Zbl 0451.68040 Kybernetika 16, 240-247 (1980). MSC: 03D60 68T15 03F99 03D99 PDF BibTeX XML Cite \textit{M. Lukavcova}, Kybernetika 16, 240--247 (1980; Zbl 0451.68040) Full Text: EuDML OpenURL
Jockusch, Carl G. jun.; Posner, David B. Double jumps of minimal degrees. (English) Zbl 0411.03034 J. Symb. Log. 43, 715-724 (1978). Reviewer: Cristian S. Calude MSC: 03D30 03D25 PDF BibTeX XML Cite \textit{C. G. Jockusch jun.} and \textit{D. B. Posner}, J. Symb. Log. 43, 715--724 (1978; Zbl 0411.03034) Full Text: DOI OpenURL
Soare, Robert I. Computational complexity, speedable and levelable sets. (English) Zbl 0401.68020 J. Symb. Log. 42(1977), 545-563 (1978). MSC: 68Q25 03D15 03D25 PDF BibTeX XML Cite \textit{R. I. Soare}, J. Symb. Log. 42, 545--563 (1978; Zbl 0401.68020) Full Text: DOI OpenURL
Leggett, Anne \(\alpha\)-degrees of maximal \(\alpha\)-r.e. sets. (English) Zbl 0397.03029 J. Symb. Log. 43, 456-474 (1978). MSC: 03D60 PDF BibTeX XML Cite \textit{A. Leggett}, J. Symb. Log. 43, 456--474 (1978; Zbl 0397.03029) Full Text: DOI OpenURL
Shore, Richard A. The irregular and non-hyperregular \(\alpha\)-r.e. degrees. (English) Zbl 0374.02021 Isr. J. Math. 22, 28-41 (1975). MSC: 03D60 PDF BibTeX XML Cite \textit{R. A. Shore}, Isr. J. Math. 22, 28--41 (1975; Zbl 0374.02021) Full Text: DOI OpenURL
Dawes, A. M.; Florence, J. B. Independent Gödel sentences and independent sets. (English) Zbl 0324.02027 J. Symb. Log. 40, 159-166 (1975). MSC: 03D25 03D55 03D30 PDF BibTeX XML Cite \textit{A. M. Dawes} and \textit{J. B. Florence}, J. Symb. Log. 40, 159--166 (1975; Zbl 0324.02027) Full Text: DOI OpenURL
Criscuolo, G.; Minicozzi, Eliana; Trautteur, G. Limiting recursion and the arithmetic hierarchy. (English) Zbl 0322.02039 Rev. Franc. Automat. Inform. Rech. Operat. 9, Informatique theor. R-3, 5-12 (1975). MSC: 03D20 03D25 PDF BibTeX XML Cite \textit{G. Criscuolo} et al., Rev. Franc. Automat. Inform. Rech. Operat., R 9, No. 3, 5--12 (1975; Zbl 0322.02039) Full Text: EuDML OpenURL
Jockusch, Carl G. jun.; Soare, Robert I. Post’s problem and his hypersimple set. (English) Zbl 0279.02023 J. Symb. Log. 38, 446-452 (1973). MSC: 03D25 03D30 03D03 PDF BibTeX XML Cite \textit{C. G. Jockusch jun.} and \textit{R. I. Soare}, J. Symb. Log. 38, 446--452 (1973; Zbl 0279.02023) Full Text: DOI OpenURL