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

DOI10.1007/BF01976264zbMATH Open0242.02046OpenAlexW1979343006MaRDI QIDQ5652663FDOQ5652663

Marian Boykan Pour-El, Hilary W. 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)

Cites Work

• Title not available (Why is that?)
• Undecidable theories
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Some Theorems on Classes of Recursively Enumerable Sets
• Two theories with axioms built by means of pleonasms

Cited In (7)

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

This page was built for publication: Recursively enumerable classes and their application to recursive sequences of formal theories

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