Recursively enumerable classes and their application to recursive sequences of formal theories

DOI10.1007/BF01976264zbMath0242.02046OpenAlexW1979343006MaRDI QIDQ5652663

Marian Boykan Pour-El, Hilary Putnam

Publication date: 1965

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137783

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

On the relation provable equivalence and on partitions in effectively inseparable sets, Effectively closed sets and enumerations, A Theorem on Recursively Enumerable Classes and Splinters, The Family of all Recursively Enumerable Classes of Finite Sets, Classifying positive equivalence relations, On recursive enumerability with finite repetitions, The synthesis of language learners.

Cites Work

• Unnamed Item
• Undecidable theories
• Two theories with axioms built by means of pleonasms
• Some Theorems on Classes of Recursively Enumerable Sets
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication