Creative sets
From MaRDI portal
Publication:5848891
DOI10.1002/malq.19550010205zbMath0065.00105OpenAlexW4253210619WikidataQ59666204 ScholiaQ59666204MaRDI QIDQ5848891
Publication date: 1955
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19550010205
Related Items
On the expressiveness of choice quantification, A complete classification of the Δ₂¹-functions, Kleene's Amazing Second Recursion Theorem, Deduction-preserving “recursive isomorphisms” between theories, Quantifying over propositions in relevance logic: nonaxiomatisability of primary interpretations of ∀p and ∃p, Orbits of Creative Subspaces, Effectively extensible theories, A generalisation of productive set, Index sets of finite classes of recursively enumerable sets, Constructively accessible ordinal numbers, Every polynomial-time 1-degree collapses if and only if P = PSPACE, Collapsing degrees, Asymptotic density, immunity and randomness, “Recursive isomorphism” and effectively extensible theories, Creativeness and completeness in recursion categories of partial recursive operators, On the Degrees of Index Sets, Deficiency Sets and Bounded Information Reducibilities, A survey of one-way functions in complexity theory, A Simple Set Which is Not Effectively Simple, Complete Recursively Enumerable Sets, From Turing machines to computer viruses, On Creative Sets and Indices of Partial Recursive Functions, Report on attainability of systems of identities, Extensions of the constructive ordinals, Isomorphism Types of Index Sets of Partial Recursive Functions, On Semi-Cylinders, Splinters, and Bounded-Truth-Table Reducibility, Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I, Effectively infinite classes of numberings of computable families of reals, THE DISCONTINUITY PROBLEM, Effectively infinite classes of numberings and computable families of reals, Degrees of unsolvability associated with classes of formalized theories, Completeness criteria for a class of reducibilities, PA RELATIVE TO AN ENUMERATION ORACLE, Relationships Between Reducibilities, A discrete chain of degrees of index sets, A Survey on Universal Computably Enumerable Equivalence Relations, Gödel numberings of partial recursive functions, Introduction to Autoreducibility and Mitoticity, On a general method of constructing post reducibilities and the corresponding completeness criteria, Recursion-theoretic ranking and compression, Effective Inseparability for Sequences of Sets, Completeness, the Recursion Theorem, and Effectively Simple Sets, Bounded enumeration reducibility and its degree structure, Notation Systems and an Effective Fixed Point Property, A Note on Bounded-Truth-Table Reducibility, Elementary theories and hereditary undecidability for semilattices of numberings, On p-creative sets and p-completely creative sets, The recursive sets in certain monadic second order fragments of arithmetic, Hyperarithmetical Sets, Classifying positive equivalence relations, Bibliography of John Myhill, Myhill's work in recursion theory, Irreducible, singular, and contiguous degrees, Representability of recursively enumerable sets in formal theories, Representability op recursively enumerable sets in formal theories, Splinters of recursive functions, R. e. presented linear orders, RELATIVIZING CHAITIN'S HALTING PROBABILITY, Creativity and Effective Inseparability, Recursively enumerable sets and degrees, Exact Separation of Recursively Enumerable Sets Within Theories, On \(1\)-degrees inside \(m\)-degrees, Kleene’s Amazing Second Recursion Theorem, The use of lists in the study of undecidable problems in automata theory, Computing degrees of unsolvability, Recursive digraphs, splinters and cylinders, Stateless turing machines and fixed points, Some Theorems on Classes of Recursively Enumerable Sets, Recursion theory on orderings. I. A model theoretic setting, Recursion theory on orderings. II, Sequences Having an Effective Fixed-Point Property, A note on context free languages, complexity classes, and diagonalization, Recursive Functions Over Well Ordered Partial Orderings, On the indexing of classes of recursively enumerable sets, Classes bounded by incomplete sets, On \(sQ\)-completeness of recursively enumerable sets
