On the relation provable equivalence and on partitions in effectively inseparable sets

DOI10.1007/BF01837553zbMath0468.03020OpenAlexW2091083565MaRDI QIDQ1156125

Claudio Bernardi

Publication date: 1981

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01837553

zbMATH Keywords

Peano arithmeticcontraproductive centerrecursively enumerable class of recursively enumerable sets

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25)

Related Items

Universal recursion theoretic properties of r.e. preordered structures, UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS, Index sets for classes of positive preorders, Reducibilities among equivalence relations induced by recursively enumerable structures, Jumps of computably enumerable equivalence relations, A Survey on Universal Computably Enumerable Equivalence Relations, Minimal equivalence relations in hyperarithmetical and analytical hierarchies, The structure of computably enumerable preorder relations, Classifying positive equivalence relations, On computably enumerable structures, Maximal r.e. equivalence relations, Weakly precomplete computably enumerable equivalence relations, \(\Sigma^ n_ 0\)-equivalence relations, Graphs realised by r.e. equivalence relations, Computable embeddability for algebraic structures

Cites Work

• On the algebraization of a Feferman's predicate. (The algebraization of theories which express Theor; X)
• Theory of Formal Systems. (AM-47)
• Recursively enumerable classes and their application to recursive sequences of formal theories
• Unnamed Item
• Unnamed Item