Bunder, M. W. A deduction theorem for restricted generality. (English) Zbl 0197.28204 Notre Dame J. Formal Logic 14, 341-346 (1973). MSC: 03B40 03D99 PDF BibTeX XML Cite \textit{M. W. Bunder}, Notre Dame J. Formal Logic 14, 341--346 (1973; Zbl 0197.28204) Full Text: DOI
Bunder, M. W. A generalised Kleene-Rosser paradox for a system containing the combinator K. (English) Zbl 0197.28203 Notre Dame J. Formal Logic 14, 53-54 (1973). MSC: 03B40 PDF BibTeX XML Cite \textit{M. W. Bunder}, Notre Dame J. Formal Logic 14, 53--54 (1973; Zbl 0197.28203) Full Text: DOI
Smith, Douglas D. Non-recursiveness of the set of finite sets of equations whose theories are one based. (English) Zbl 0197.28202 Notre Dame J. Formal Logic 13, 135-138 (1972). MSC: 03D35 20M30 PDF BibTeX XML Cite \textit{D. D. Smith}, Notre Dame J. Formal Logic 13, 135--138 (1972; Zbl 0197.28202) Full Text: DOI
Bollman, D.; Tapia, M. On the recursive unsolvability of the provability of the deduction theorem in partial propositional calculi. (English) Zbl 0197.28104 Notre Dame J. Formal Logic 13, 124-128 (1972). MSC: 03B25 PDF BibTeX XML Cite \textit{D. Bollman} and \textit{M. Tapia}, Notre Dame J. Formal Logic 13, 124--128 (1972; Zbl 0197.28104) Full Text: DOI
Vučković, Vladeta Combinatorial operators and their quasi-inverses. (English) Zbl 0197.28103 Notre Dame J. Formal Logic 12, 305-308 (1971). MSC: 03D20 03D25 PDF BibTeX XML Cite \textit{V. Vučković}, Notre Dame J. Formal Logic 12, 305--308 (1971; Zbl 0197.28103) Full Text: DOI
Owings, J. C. jun. An abstract formulation of Kleene’s recursion theorem. (English) Zbl 0197.28102 Notre Dame J. Formal Logic (to appear) PDF BibTeX XML
Stiefkes, Dirk Undecidable extensions of monadic second order successor arithmetic. (English) Zbl 0193.31203 Z. Math. Logik Grundlagen Math. 17, 385-394 (1971). PDF BibTeX XML Cite \textit{D. Stiefkes}, Z. Math. Logik Grundlagen Math. 17, 385--394 (1971; Zbl 0193.31203) Full Text: DOI
Lerman, M. Initial segments of the degrees of unsolvability. (English) Zbl 0193.31004 Ann. Math. (2) 93, 365-389 (1971). MSC: 03D30 03D10 PDF BibTeX XML Cite \textit{M. Lerman}, Ann. Math. (2) 93, 365--389 (1971; Zbl 0193.31004) Full Text: DOI
Chapin, E. William jun. The strong decidability of cut logics. II. Generalizations. (English) Zbl 0188.02801 Notre Dame J. Formal Logic 12, 429-434 (1971). MSC: 03B25 PDF BibTeX XML Cite \textit{E. W. Chapin jun.}, Notre Dame J. Formal Logic 12, 429--434 (1971; Zbl 0188.02801) Full Text: DOI
Applebaum, C. H. Isomorphisms of \(\omega\)-groups. (English) Zbl 0188.02601 Notre Dame J. Formal Logic 12, 238-248 (1971). MSC: 03D25 PDF BibTeX XML Cite \textit{C. H. Applebaum}, Notre Dame J. Formal Logic 12, 238--248 (1971; Zbl 0188.02601) Full Text: DOI
Chapin, E. W. jun. The strong decidability of cut-logics. I: Partial propositional calculi. (English) Zbl 0185.02401 Notre Dame J. Formal Logic 12, 322-328 (1971). PDF BibTeX XML Cite \textit{E. W. Chapin jun.}, Notre Dame J. Formal Logic 12, 322--328 (1971; Zbl 0185.02401) Full Text: DOI
Thomason, S. K. Sublattices of the recursively enumerable degrees. (English) Zbl 0181.01301 Z. Math. Logik Grundlagen Math. 17, 273-280 (1971). MSC: 03D25 PDF BibTeX XML Cite \textit{S. K. Thomason}, Z. Math. Logik Grundlagen Math. 17, 273--280 (1971; Zbl 0181.01301) Full Text: DOI
Gass, Frederick S. Generalized ordinal notation. (English) Zbl 0177.01601 Notre Dame J. Formal Logic 12, 104-114 (1971). PDF BibTeX XML Cite \textit{F. S. Gass}, Notre Dame J. Formal Logic 12, 104--114 (1971; Zbl 0177.01601) Full Text: DOI
Pager, David The categorization of Tag systems in terms of decidability. (English) Zbl 0199.31102 J. Lond. Math. Soc., II. Ser. 2, 473-480 (1970). MSC: 03D99 PDF BibTeX XML Cite \textit{D. Pager}, J. Lond. Math. Soc., II. Ser. 2, 473--480 (1970; Zbl 0199.31102) Full Text: DOI
Blikle, A. An algebra of flow-algorithms. (English) Zbl 0199.31101 Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 18, 395-398 (1970). MSC: 03F65 PDF BibTeX XML Cite \textit{A. Blikle}, Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 18, 395--398 (1970; Zbl 0199.31101)
Blikle, A. Functions definable by means of programs. (English) Zbl 0199.31003 Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 18, 391-393 (1970). MSC: 03D20 03F65 PDF BibTeX XML Cite \textit{A. Blikle}, Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 18, 391--393 (1970; Zbl 0199.31003)
Vučković, Vladeta Effective enumerability of some families of partially recursive functions connected with computable functionals. (English) Zbl 0199.30801 Z. Math. Logik Grundlagen Math. 16, 113-121 (1970). PDF BibTeX XML Cite \textit{V. Vučković}, Z. Math. Logik Grundlagen Math. 16, 113--121 (1970; Zbl 0199.30801) Full Text: DOI
Vuckovic, V. Recursive word-functions over infinite alphabets. (English) Zbl 0198.32401 Z. Math. Logik Grundlagen Math. 16, 123-138 (1970). PDF BibTeX XML Cite \textit{V. Vuckovic}, Z. Math. Logik Grundlagen Math. 16, 123--138 (1970; Zbl 0198.32401) Full Text: DOI
Horejs, J. On time estimations for classical Turing machines. (English) Zbl 0198.02901 Z. Angew. Math. Mech. 50, 325 (1970). PDF BibTeX XML Cite \textit{J. Horejs}, Z. Angew. Math. Mech. 50, 325 (1970; Zbl 0198.02901) Full Text: DOI
Salwicki, A. On the predicate calculi with iteration quantifiers. (English) Zbl 0198.02803 Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 18, 279-285 (1970). PDF BibTeX XML Cite \textit{A. Salwicki}, Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 18, 279--285 (1970; Zbl 0198.02803)
Salwicki, A. On the equivalence of FS-expressions and programs. (English) Zbl 0198.02802 Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 18, 275-278 (1970). PDF BibTeX XML Cite \textit{A. Salwicki}, Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 18, 275--278 (1970; Zbl 0198.02802)
Salwicki, A. Formalized algorithmic languages. (English) Zbl 0198.02801 Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 18, 227-232 (1970). PDF BibTeX XML Cite \textit{A. Salwicki}, Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 18, 227--232 (1970; Zbl 0198.02801)
Simmons, H. The solution of a decision problem for several classes of rings. (English) Zbl 0198.02701 Pac. J. Math. 34, 547-557 (1970). PDF BibTeX XML Cite \textit{H. Simmons}, Pac. J. Math. 34, 547--557 (1970; Zbl 0198.02701) Full Text: DOI
Amstislavskij, V. I. Effektive R-Mengen und transfinite Erweiterungen rekursiver Hierarchien. (Russian) Zbl 0198.02602 Fundam. Math. 68, 61-86 (1970). PDF BibTeX XML Cite \textit{V. I. Amstislavskij}, Fundam. Math. 68, 61--86 (1970; Zbl 0198.02602) Full Text: DOI
Nerode, A.; Manaster, A. B. A universal embedding property of the RETs. (English) Zbl 0198.02504 J. Symb. Log. 35, 51-59 (1970). PDF BibTeX XML Cite \textit{A. Nerode} and \textit{A. B. Manaster}, J. Symb. Log. 35, 51--59 (1970; Zbl 0198.02504) Full Text: DOI
Lerman, M. Turing degrees and many-one degrees of maximal sets. (English) Zbl 0198.02503 J. Symb. Log. 35, 29-40 (1970). PDF BibTeX XML Cite \textit{M. Lerman}, J. Symb. Log. 35, 29--40 (1970; Zbl 0198.02503) Full Text: DOI
Lerman, M. Recursive functions modulo co-r-maximal sets. (English) Zbl 0198.02502 Trans. Am. Math. Soc. 148, 429-444 (1970). PDF BibTeX XML Cite \textit{M. Lerman}, Trans. Am. Math. Soc. 148, 429--444 (1970; Zbl 0198.02502) Full Text: DOI
Mal’cev, A. I. Algorithms and recursive functions. (English) Zbl 0198.02501 Groningen: Wolters-Noordhoff Publishing, 372 p. (1970). PDF BibTeX XML
Chudnovskij, G. V. Diophantische Prädikate. (Russian) Zbl 0197.28105 Usp. Mat. Nauk 25, No. 4(154), 185-186 (1970). PDF BibTeX XML Cite \textit{G. V. Chudnovskij}, Usp. Mat. Nauk 25, No. 4(154), 185--186 (1970; Zbl 0197.28105)
Skordev, D. Some simple examples of universal function. (English. Russian original) Zbl 0197.28101 Sov. Math., Dokl. 11, 41-43 (1970); translation from Dokl. Akad. Nauk SSSR 190, 45-46 (1970). PDF BibTeX XML Cite \textit{D. Skordev}, Sov. Math., Dokl. 11, 41--43 (1970; Zbl 0197.28101); translation from Dokl. Akad. Nauk SSSR 190, 45--46 (1970)
Thomason, S. K. A theorem on initial segments of degrees. (English) Zbl 0196.01402 J. Symb. Log. 35, 41-45 (1970). PDF BibTeX XML Cite \textit{S. K. Thomason}, J. Symb. Log. 35, 41--45 (1970; Zbl 0196.01402) Full Text: DOI
Hindley, Roger; Lercher, Bruce A short proof of Curry’s normal form theorem. (English) Zbl 0195.02101 Proc. Am. Math. Soc. 24, 808-810 (1970). PDF BibTeX XML Cite \textit{R. Hindley} and \textit{B. Lercher}, Proc. Am. Math. Soc. 24, 808--810 (1970; Zbl 0195.02101) Full Text: DOI
Collins, Donald J. On recognising properties of groups which have solvable word problem. (English) Zbl 0195.02001 Arch. Math. 21, 31-39 (1970). PDF BibTeX XML Cite \textit{D. J. Collins}, Arch. Math. 21, 31--39 (1970; Zbl 0195.02001) Full Text: DOI
Lutsikovich, V. On the implementation of recursive procedures. (English. Russian original) Zbl 0195.01903 U.S.S.R. Comput. Math. Math. Phys. 7(1967), No. 6, 172-187 (1970); translation from Zh. Vychisl. Mat. Mat. Fiz. 7, 1346-1357 (1967). PDF BibTeX XML Cite \textit{V. Lutsikovich}, U.S.S.R. Comput. Math. Math. Phys. 7, No. 6, 172--187 (1970; Zbl 0195.01903); translation from Zh. Vychisl. Mat. Mat. Fiz. 7, 1346--1357 (1967) Full Text: DOI
Gandy, Robin O.; Soare, Robert I. A problem in the theory of constructive order types. (English) Zbl 0195.01803 J. Symb. Log. 35, 119-121 (1970). PDF BibTeX XML Cite \textit{R. O. Gandy} and \textit{R. I. Soare}, J. Symb. Log. 35, 119--121 (1970; Zbl 0195.01803) Full Text: DOI
Hamilton, Alan G. Bases and \(\alpha\)-dimensions of countable vector spaces with recursive operations. (English) Zbl 0195.01802 J. Symb. Log. 35, 85-96 (1970). PDF BibTeX XML Cite \textit{A. G. Hamilton}, J. Symb. Log. 35, 85--96 (1970; Zbl 0195.01802) Full Text: DOI
Uspenskij, V. A. Reduction of computable and potentially comutable numerations. (English. Russian original) Zbl 0195.01801 Math. Notes 6(1969), 461-464 (1970); translation from Mat. Zametki 6, 3-9 (1969). PDF BibTeX XML Cite \textit{V. A. Uspenskij}, Math. Notes 6, 461--464 (1970; Zbl 0195.01801); translation from Mat. Zametki 6, 3--9 (1969) Full Text: DOI
Caviness, B. F. On canonical forms and simplification. (English) Zbl 0193.31302 J. Assoc. Comput. Mach. 17, 385-396 (1970). PDF BibTeX XML Cite \textit{B. F. Caviness}, J. Assoc. Comput. Mach. 17, 385--396 (1970; Zbl 0193.31302) Full Text: DOI
Ershov, Yu. L. Über Indexmengen. (Russian) Zbl 0193.31002 Sib. Mat. Zh. 11, 326-342 (1970). PDF BibTeX XML Cite \textit{Yu. L. Ershov}, Sib. Mat. Zh. 11, 326--342 (1970; Zbl 0193.31002)
Orgass, R. J. Some results concerning proofs of statements about programs. (English) Zbl 0188.02902 J. Comput. Syst. Sci. 4, 74-88 (1970). PDF BibTeX XML Cite \textit{R. J. Orgass}, J. Comput. Syst. Sci. 4, 74--88 (1970; Zbl 0188.02902) Full Text: DOI
Herman, G. T.; Isard, S. D. Computability over arbitrary fields. (English) Zbl 0188.02502 J. Lond. Math. Soc., II. Ser. 2, 73-79 (1970). PDF BibTeX XML Cite \textit{G. T. Herman} and \textit{S. D. Isard}, J. Lond. Math. Soc., II. Ser. 2, 73--79 (1970; Zbl 0188.02502) Full Text: DOI
Paterson, Michael S. Unsolvability in \(3 \times 3\) matrices. (English) Zbl 0186.01103 Studies appl. Math. 49, 105-107 (1970). PDF BibTeX XML Cite \textit{M. S. Paterson}, Stud. Appl. Math. 49, 105--107 (1970; Zbl 0186.01103) Full Text: DOI
Bunder, M. W. A paradox in illative combinatory logic. (English) Zbl 0185.02504 Notre Dame J. Formal Logic 11, 467-470 (1970). PDF BibTeX XML Cite \textit{M. W. Bunder}, Notre Dame J. Formal Logic 11, 467--470 (1970; Zbl 0185.02504) Full Text: DOI
Carpentier, M. A. Uniformly precomplete enumerations. (English) Zbl 0185.02002 Z. Math. Logik Grundlagen Math. 16, 463-468 (1970). PDF BibTeX XML Cite \textit{M. A. Carpentier}, Z. Math. Logik Grundlagen Math. 16, 463--468 (1970; Zbl 0185.02002) Full Text: DOI
Richardson, Daniel Solution of the identity problem for integral exponential functions. (English) Zbl 0184.02301 Z. Math. Logik Grundlagen Math. (to appear) PDF BibTeX XML
Shank, H. S. Records of Turing machines. (English) Zbl 0183.29401 Z. Math. Logik Grundlagen Math. (to appear) PDF BibTeX XML
Goodstein, R. L. Polynomials with computable coefficients. (English) Zbl 0177.01602 Notre Dame J. Formal Logic 11, 447-448 (1970). PDF BibTeX XML Cite \textit{R. L. Goodstein}, Notre Dame J. Formal Logic 11, 447--448 (1970; Zbl 0177.01602) Full Text: DOI
Bloom, S. L. The hyperprojective hierarchy. (English) Zbl 0162.31504 Z. Math. Logik Grundlagen Math. 16, 149-164 (1970). PDF BibTeX XML Cite \textit{S. L. Bloom}, Z. Math. Logik Grundlagen Math. 16, 149--164 (1970; Zbl 0162.31504) Full Text: DOI
Trakhtenbrot, B. A. Über die Kompliziertheit der Reduktionsalgorithmen in Novikov-Booneschen Konstruktionen. (Russian) Zbl 0199.31201 Algebra Logika 8, 93-128 (1969). MSC: 68Q25 03D40 03D25 PDF BibTeX XML Cite \textit{B. A. Trakhtenbrot}, Algebra Logika 8, 93--128 (1969; Zbl 0199.31201)
Zaslavskij, I. D. On Shannon pseudofunctions. (Russian) Zbl 0199.30902 Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 16, 65-76 (1969). MSC: 03F60 PDF BibTeX XML Cite \textit{I. D. Zaslavskij}, Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 16, 65--76 (1969; Zbl 0199.30902) Full Text: EuDML
Heath, I. J. Decidable classes of number-theoretic sentences. (English) Zbl 0199.30901 Z. Math. Logik Grundlagen Math. 15, 411-420 (1969). MSC: 03B25 03D20 PDF BibTeX XML Cite \textit{I. J. Heath}, Z. Math. Logik Grundlagen Math. 15, 411--420 (1969; Zbl 0199.30901) Full Text: DOI
Baer, Robert M. Definability by Turing machines. (English) Zbl 0198.32701 Z. Math. Logik Grundlagen Math. 15, 325-332 (1969). PDF BibTeX XML Cite \textit{R. M. Baer}, Z. Math. Logik Grundlagen Math. 15, 325--332 (1969; Zbl 0198.32701) Full Text: DOI
Karp, Richard M.; Miller, Raymond E. Parallel program schemata. (English) Zbl 0198.32603 J. Comput. Syst. Sci. 3, 147-195 (1969). PDF BibTeX XML Cite \textit{R. M. Karp} and \textit{R. E. Miller}, J. Comput. Syst. Sci. 3, 147--195 (1969; Zbl 0198.32603) Full Text: DOI
Gurevich, Yu. Sh. Entscheidbarkeitsproblem für die Prädikaten- und Operatorenlogik. (Russian) Zbl 0198.32501 Algebra Logika 8, 284-308 (1969). MSC: 03B25 PDF BibTeX XML Cite \textit{Yu. Sh. Gurevich}, Algebra Logika 8, 284--308 (1969; Zbl 0198.32501)
Barback, J. Two notes on recursive isols. (English) Zbl 0198.02601 Trans. Am. Math. Soc. 144, 77-94 (1969). PDF BibTeX XML Cite \textit{J. Barback}, Trans. Am. Math. Soc. 144, 77--94 (1969; Zbl 0198.02601) Full Text: DOI
Hindley, R. The principal type-scheme of an object in combinatory logic. (English) Zbl 0196.01501 Trans. Am. Math. Soc. 146, 29-60 (1969). PDF BibTeX XML Cite \textit{R. Hindley}, Trans. Am. Math. Soc. 146, 29--60 (1969; Zbl 0196.01501) Full Text: DOI
Levitz, H. A simplification of Takeuti’s ordinal diagrams of finite order. (English) Zbl 0196.01403 Z. Math. Logik Grundlagen Math. 15, 141-154 (1969). PDF BibTeX XML Cite \textit{H. Levitz}, Z. Math. Logik Grundlagen Math. 15, 141--154 (1969; Zbl 0196.01403) Full Text: DOI
Hugill, D. F. Initial segments of Turing degrees. (English) Zbl 0196.01401 Proc. Lond. Math. Soc., III. Ser. 19, 1-16 (1969). PDF BibTeX XML Cite \textit{D. F. Hugill}, Proc. Lond. Math. Soc. (3) 19, 1--16 (1969; Zbl 0196.01401) Full Text: DOI
McCool, James The order problem anand the power problem for free product sixth-groups. (English) Zbl 0195.30602 Glasg. Math. J. 10, 1-9 (1969). PDF BibTeX XML Cite \textit{J. McCool}, Glasg. Math. J. 10, 1--9 (1969; Zbl 0195.30602) Full Text: DOI
Hindley, R. An abstract form of the Church-Rosser theorem. I. (English) Zbl 0195.02102 J. Symb. Log. 34, 545-560 (1969). PDF BibTeX XML Cite \textit{R. Hindley}, J. Symb. Log. 34, 545--560 (1969; Zbl 0195.02102) Full Text: DOI
Kearns, John T. Combinatory logic with discriminators. (English) Zbl 0195.02002 J. Symb. Log. 34, 561-575 (1969). PDF BibTeX XML Cite \textit{J. T. Kearns}, J. Symb. Log. 34, 561--575 (1969; Zbl 0195.02002) Full Text: DOI
Lorents, A. A. Elemente der konstruktiven Wahrscheinlichkeitsrechnung. (Russian. German summary) Zbl 0195.01901 Z. Math. Logik Grundlagen Math. 15, 437-459 (1969). PDF BibTeX XML Cite \textit{A. A. Lorents}, Z. Math. Logik Grundlagen Math. 15, 437--459 (1969; Zbl 0195.01901) Full Text: DOI
Shafaat, Ahmad A remark on a paper of Taimanov. (English) Zbl 0195.01804 Algebra Logika 8, 373-374 (1969). MSC: 03B25 08A02 PDF BibTeX XML Cite \textit{A. Shafaat}, Algebra Logika 8, 373--374 (1969; Zbl 0195.01804) Full Text: EuDML
Cannonito, F. B.; Finkelstein, M. On primitive recursive permutations and their inverses. (English) Zbl 0194.31201 J. Symb. Log. 34, 634-638 (1969). PDF BibTeX XML Cite \textit{F. B. Cannonito} and \textit{M. Finkelstein}, J. Symb. Log. 34, 634--638 (1969; Zbl 0194.31201) Full Text: DOI
Valiev, M. K. Über die Kompliziertheit des Identitätsproblems für endlich definierte Gruppen. (Russian) Zbl 0193.31703 Algebra Logika 8, 5-43 (1969). PDF BibTeX XML Cite \textit{M. K. Valiev}, Algebra Logika 8, 5--43 (1969; Zbl 0193.31703)
Schupp, P. E. A note on recursively enumerable predicates in groups. (English) Zbl 0193.31702 Fundam. Math. 66, 61-63 (1969). PDF BibTeX XML Cite \textit{P. E. Schupp}, Fundam. Math. 66, 61--63 (1969; Zbl 0193.31702) Full Text: DOI EuDML
Fischer, P. C. Quantificational variants on the halting problem for Turing machines. (English) Zbl 0193.31701 Z. Math. Logik Grundlagen Math. 15, 211-218 (1969). PDF BibTeX XML Cite \textit{P. C. Fischer}, Z. Math. Logik Grundlagen Math. 15, 211--218 (1969; Zbl 0193.31701) Full Text: DOI
Medvedev, J. T. A method for proving the unsolvability of algorithmic problems. (English. Russian original) Zbl 0193.31602 Sov. Math., Dokl. 10, 495-498 (1969); translation from Dokl. Akad. Nauk SSSR 185, 1232-1235 (1969). PDF BibTeX XML Cite \textit{J. T. Medvedev}, Sov. Math., Dokl. 10, 495--498 (1969; Zbl 0193.31602); translation from Dokl. Akad. Nauk SSSR 185, 1232--1235 (1969)
Petri, N. V. Algorithms connected with predicates and Boolean functions. (English. Russian original) Zbl 0193.31501 Sov. Math., Dokl. 10, 294-297 (1969); translation from Dokl. Akad. Nauk SSSR 185, 37-39 (1969). PDF BibTeX XML Cite \textit{N. V. Petri}, Sov. Math., Dokl. 10, 294--297 (1969; Zbl 0193.31501); translation from Dokl. Akad. Nauk SSSR 185, 37--39 (1969)
Shapiro, N. Z. Recursively countable subsets of recursive metric spaces. (English) Zbl 0193.31401 Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 17, 603-607 (1969). PDF BibTeX XML Cite \textit{N. Z. Shapiro}, Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 17, 603--607 (1969; Zbl 0193.31401)
Huber Dyson, V. On the decision problem for extensions of a decidable theory. (English) Zbl 0193.31201 Fundam. Math. 64, 7-40 (1969). PDF BibTeX XML Cite \textit{V. Huber Dyson}, Fundam. Math. 64, 7--40 (1969; Zbl 0193.31201) Full Text: DOI EuDML
Schwartz, Thomas A simple treatment of Church’s theorem on the decision problem. (English) Zbl 0193.31104 Logique Anal., Nouv. Sér. 12, 153-156 (1969). PDF BibTeX XML Cite \textit{T. Schwartz}, Log. Anal., Nouv. Sér. 12, 153--156 (1969; Zbl 0193.31104)
Pfeiffer, Helmut Bezeichnungssystem für Ordinalzahlen. (German) Zbl 0193.31103 Arch. Math. Logik Grundlagenforsch. 12, 12-17 (1969). PDF BibTeX XML Cite \textit{H. Pfeiffer}, Arch. Math. Logik Grundlagenforsch. 12, 12--17 (1969; Zbl 0193.31103) Full Text: DOI EuDML
Hay, L. Index set of finite classes of recursively enumerable sets. (English) Zbl 0193.31003 J. Symb. Log. 34, 39-44 (1969). PDF BibTeX XML Cite \textit{L. Hay}, J. Symb. Log. 34, 39--44 (1969; Zbl 0193.31003) Full Text: DOI
Fitch, F. B. Combinatory logic and negative numbers. (English) Zbl 0191.30901 Logical Way of Doing Things, 265-277 (1969). PDF BibTeX XML
Young, P. R. Toward a theory of enumerations. (English) Zbl 0191.30801 J. Assoc. Comput. Mach. 16, 328-348 (1969). PDF BibTeX XML Cite \textit{P. R. Young}, J. Assoc. Comput. Mach. 16, 328--348 (1969; Zbl 0191.30801) Full Text: DOI
Untersuchungen über konstruktive Mathematik und mathematische Logik. III. (Russian) Zbl 0191.30602 Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 16, 1-188 (1969). PDF BibTeX XML Cite Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 16, 1--188 (1969; Zbl 0191.30602)
Hinman, P. G. Some applications of forcing to hierarchy problems in arithmetic. (English) Zbl 0191.30601 Z. Math. Logik Grundlagen Math. 15, 341-352 (1969). PDF BibTeX XML Cite \textit{P. G. Hinman}, Z. Math. Logik Grundlagen Math. 15, 341--352 (1969; Zbl 0191.30601) Full Text: DOI
Hinman, P. G. Hierarchies of effective descriptive set theory. (English) Zbl 0191.30503 Trans. Am. Math. Soc. 142, 111-140 (1969). PDF BibTeX XML Cite \textit{P. G. Hinman}, Trans. Am. Math. Soc. 142, 111--140 (1969; Zbl 0191.30503) Full Text: DOI
Jones, J. P. Effectively retractable theories and degrees of undecidability. (English) Zbl 0191.30501 J. Symb. Log. 34, 597-604 (1969). PDF BibTeX XML Cite \textit{J. P. Jones}, J. Symb. Log. 34, 597--604 (1969; Zbl 0191.30501) Full Text: DOI
Lerman, M. Some nondistributive lattices as initial segments of the degrees of unsolvability. (English) Zbl 0191.30403 J. Symb. Log. 34, 85-98 (1969). PDF BibTeX XML Cite \textit{M. Lerman}, J. Symb. Log. 34, 85--98 (1969; Zbl 0191.30403) Full Text: DOI
Herman, G. T. A simple solution of the uniform halting problem. (English) Zbl 0188.33002 J. Symb. Log. 34, 639-640 (1969). PDF BibTeX XML Cite \textit{G. T. Herman}, J. Symb. Log. 34, 639--640 (1969; Zbl 0188.33002) Full Text: DOI
Anderson, Michael Note on the mortality problem for shift state trees. (English) Zbl 0188.33001 Notre Dame J. Formal Logic 10, 275-276 (1969). PDF BibTeX XML Cite \textit{M. Anderson}, Notre Dame J. Formal Logic 10, 275--276 (1969; Zbl 0188.33001) Full Text: DOI
Kozmidiadi, V. A.; Marcenkov, S. S. Über Mehrkopfautomaten. (Russian) Zbl 0188.32903 Probl. Kibernetiki 21, 127-158 (1969). PDF BibTeX XML Cite \textit{V. A. Kozmidiadi} and \textit{S. S. Marcenkov}, Probl. Kibern. 21, 127--158 (1969; Zbl 0188.32903)
Cazacu, C. Machines Turing et T-schemas. (French) Zbl 0188.32902 An. Sti. Univ. Al. I. Cuza Iasi, N. Ser., Sect. Ia 15, 1-8 (1969). PDF BibTeX XML Cite \textit{C. Cazacu}, An. Ştiinţ. Univ. Al. I. Cuza Iaşi, N. Ser., Secţ. Ia 15, 1--8 (1969; Zbl 0188.32902)
Kaphengst, Heinz Malzew-Räume, ein allgemeiner Begriff der rekursiven Abbildung. (German) Zbl 0188.32901 Z. Math. Logik Grundlagen Math. 15, 63-76 (1969). PDF BibTeX XML Cite \textit{H. Kaphengst}, Z. Math. Logik Grundlagen Math. 15, 63--76 (1969; Zbl 0188.32901) Full Text: DOI
Nogina, E. J. Beziehungen zwischen gewissen Klassen effektiv topologischer Räume. (English. Russian original) Zbl 0188.32803 Math. Notes 5, 288-294 (1969); translation from Mat. Zametki 5, 483-495 (1969). PDF BibTeX XML Cite \textit{E. J. Nogina}, Math. Notes 5, 288--294 (1969; Zbl 0188.32803); translation from Mat. Zametki 5, 483--495 (1969) Full Text: DOI
Richardson, D. Solution of the identity problem for integral exponential functions. (English) Zbl 0188.32802 Z. Math. Logik Grundlagen Math. 15, 333-340 (1969). PDF BibTeX XML Cite \textit{D. Richardson}, Z. Math. Logik Grundlagen Math. 15, 333--340 (1969; Zbl 0188.32802) Full Text: DOI
Tugué, Tosiyuki; Hinata, Sigeru A note on continuous functionals. (English) Zbl 0188.32702 Ann. Jap. Assoc. Philos. Sci. 3, 138-145 (1969). PDF BibTeX XML Cite \textit{T. Tugué} and \textit{S. Hinata}, Ann. Japan Assoc. Philos. Sci. 3, 138--145 (1969; Zbl 0188.32702) Full Text: DOI
Seldin, J. P. Corrigendum to my paper: ’Note on definitional reductions’. (English) Zbl 0188.03001 Notre Dame J. Formal Logic 10, 412 (1969). PDF BibTeX XML Cite \textit{J. P. Seldin}, Notre Dame J. Formal Logic 10, 412 (1969; Zbl 0188.03001) Full Text: DOI
Collins, D. J. Word and conjugacy problems in groups with only a few defining relations. (English) Zbl 0188.02903 Z. Math. Logik Grundlagen Math. 15, 305-324 (1969). PDF BibTeX XML Cite \textit{D. J. Collins}, Z. Math. Logik Grundlagen Math. 15, 305--324 (1969; Zbl 0188.02903) Full Text: DOI
Schnorr, C.-P. Eine Bemerkung zum Begriff der zufälligen Folge. (German) Zbl 0188.02805 Z. Wahrscheinlichkeitstheor. Verw. Geb. 14, 27-35 (1969). PDF BibTeX XML Cite \textit{C. P. Schnorr}, Z. Wahrscheinlichkeitstheor. Verw. Geb. 14, 27--35 (1969; Zbl 0188.02805) Full Text: DOI
Di Paola, R. A. Random sets in subrecursive hierarchies. (English) Zbl 0188.02703 J. Assoc. Comput. Mach. 16, 621-630 (1969). PDF BibTeX XML Cite \textit{R. A. Di Paola}, J. Assoc. Comput. Mach. 16, 621--630 (1969; Zbl 0188.02703) Full Text: DOI
Soare, Robert I. A note on degrees of subsets. (English) Zbl 0188.02702 J. Symb. Log. 34, 256 (1969). PDF BibTeX XML Cite \textit{R. I. Soare}, J. Symb. Log. 34, 256 (1969; Zbl 0188.02702) Full Text: DOI
Owings, J. C. jun. \(\prod_1^1\) sets, \(\omega\)-sets, and metacompleteness. (English) Zbl 0188.02701 J. Symb. Log. 34, 194-204 (1969). PDF BibTeX XML Cite \textit{J. C. Owings jun.}, J. Symb. Log. 34, 194--204 (1969; Zbl 0188.02701) Full Text: DOI
Jockusch, C. G. jun. Relationships between reducibilities. (English) Zbl 0188.02604 Trans. Am. Math. Soc. 142, 229-237 (1969). PDF BibTeX XML Cite \textit{C. G. Jockusch jun.}, Trans. Am. Math. Soc. 142, 229--237 (1969; Zbl 0188.02604) Full Text: DOI
Florence, J. B. Partially ordered sets representable by recursively enumerable classes. (English) Zbl 0188.02603 J. Symb. Log. 34, 8-12 (1969). PDF BibTeX XML Cite \textit{J. B. Florence}, J. Symb. Log. 34, 8--12 (1969; Zbl 0188.02603) Full Text: DOI
Florence, J. B. Strong enumeration properties of recursively enumerable classes. (English) Zbl 0188.02602 Z. Math. Logik Grundlagen Math. 15, 181-192 (1969). PDF BibTeX XML Cite \textit{J. B. Florence}, Z. Math. Logik Grundlagen Math. 15, 181--192 (1969; Zbl 0188.02602) Full Text: DOI
Péter, Rózsa Automatische Programmierung zur Berechnung der partiell-rekursiven Funktionen. (German) Zbl 0188.02501 Stud. Sci. Math. Hung. 4, 447-463 (1969). MSC: 03D75 PDF BibTeX XML Cite \textit{R. Péter}, Stud. Sci. Math. Hung. 4, 447--463 (1969; Zbl 0188.02501)
Döpp, K. Über die Homogenisierbarkeit von Rechenprogrammen. (German) Zbl 0187.27705 Arch. Math. Logik Grundlagenforsch. 12, 66-71 (1969). PDF BibTeX XML Cite \textit{K. Döpp}, Arch. Math. Logik Grundlagenforsch. 12, 66--71 (1969; Zbl 0187.27705) Full Text: DOI EuDML