Creative sets - MaRDI portal

Cited in

(86)

Collapsing degrees
Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I
On p-creative sets and p-completely creative sets
Bibliography of John Myhill
Myhill's work in recursion theory
On \(sQ\)-completeness of recursively enumerable sets
Classes bounded by incomplete sets
Recursion-theoretic ranking and compression
Elementary theories and hereditary undecidability for semilattices of numberings
On the expressiveness of choice quantification
On 1-degrees inside m-degrees
The use of lists in the study of undecidable problems in automata theory
Completeness criteria for a class of reducibilities
On a general method of constructing post reducibilities and the corresponding completeness criteria
From Turing machines to computer viruses
A survey on universal computably enumerable equivalence relations
Introduction to autoreducibility and mitoticity
Orbits of Creative Subspaces
R. e. presented linear orders
Kleene's amazing second recursion theorem
Asymptotic density, immunity and randomness
Creativeness and completeness in recursion categories of partial recursive operators
Degrees of unsolvability associated with classes of formalized theories
Some Theorems on Classes of Recursively Enumerable Sets
Gödel numberings of partial recursive functions
Recursive Functions Over Well Ordered Partial Orderings
Hyperarithmetical Sets
Classifying positive equivalence relations
RELATIVIZING CHAITIN'S HALTING PROBABILITY
Kleene’s Amazing Second Recursion Theorem
Splinters of recursive functions
Deficiency Sets and Bounded Information Reducibilities
Stateless turing machines and fixed points
Recursion theory on orderings. I. A model theoretic setting
Recursion theory on orderings. II
A note on context free languages, complexity classes, and diagonalization
A survey of one-way functions in complexity theory
Sequences Having an Effective Fixed-Point Property
The recursive sets in certain monadic second order fragments of arithmetic
Recursively enumerable sets and degrees
scientific article; zbMATH DE number 972788 (Why is no real title available?)
Quantifying over propositions in relevance logic: nonaxiomatisability of primary interpretations of ∀p and ∃p
Every polynomial-time 1-degree collapses if and only if P = PSPACE
A Note on Bounded-Truth-Table Reducibility
Report on attainability of systems of identities
Extensions of the constructive ordinals
On the indexing of classes of recursively enumerable sets
On the Degrees of Index Sets
A Simple Set Which is Not Effectively Simple
Complete Recursively Enumerable Sets
Isomorphism Types of Index Sets of Partial Recursive Functions
On Creative Sets and Indices of Partial Recursive Functions
On Semi-Cylinders, Splinters, and Bounded-Truth-Table Reducibility
A complete classification of the Δ₂¹-functions
Deduction-preserving “recursive isomorphisms” between theories
Effectively extensible theories
Relationships Between Reducibilities
A generalisation of productive set
Index sets of finite classes of recursively enumerable sets
Constructively accessible ordinal numbers
Effective Inseparability for Sequences of Sets
“Recursive isomorphism” and effectively extensible theories
Notation Systems and an Effective Fixed Point Property
Completeness, the Recursion Theorem, and Effectively Simple Sets
A discrete chain of degrees of index sets
Representability of recursively enumerable sets in formal theories
Creativity and Effective Inseparability
Representability op recursively enumerable sets in formal theories
Exact Separation of Recursively Enumerable Sets Within Theories
Effectively infinite classes of numberings of computable families of reals
THE DISCONTINUITY PROBLEM
Effectively infinite classes of numberings and computable families of reals
PA RELATIVE TO AN ENUMERATION ORACLE
On computable numberings of families of Turing degrees
On the complexity of reasoning in Kleene algebra with commutativity conditions
Bounded enumeration reducibility and its degree structure
Irreducible, singular, and contiguous degrees
Expressive power of propositionally quantified modal logics on variable domain structures with accessibility
On syntactic concept lattice models for the Lambek calculus and infinitary action logic
On quasi-reducibility for c.e. sets. I: The structure of the Q-degrees and the sQ-degrees
Notes on classes of minimal numberings of arithmetical set families
A family whose computable numberings are all complete
Relative completeness of arithmetical numberings
Algorithmic complexity of theories with Kleene iteration
Computing degrees of unsolvability
Recursive digraphs, splinters and cylinders

This page was built for publication: Creative sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5848891)