^ n_ 0-equivalence relations

DOI10.1007/BF00403335zbMATH Open0539.03023MaRDI QIDQ793716FDOQ793716

Authors: Andrea Sorbi 

Publication date: 1982

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

Recommendations

• \({\Sigma}^0_1\) and \({\Pi}^0_1\) equivalence structures
• \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures
• A theorem about Σ¹₁ equivalence relations
• On Σ¹ ₁ equivalence relations over the natural numbers
• Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
• Characterization of \(\ell_p\)-like and \(c_{0}\)-like equivalence relations
• A recursion theoretic property of \(\mathbf{\Sigma ^1_1}\) equivalence relations
• On \(\ell^P\)-like equivalence relations
• \(UV^ n\)-equivalence and \(n\)-equivalence
• \(F_{\sigma}\) equivalence relations and Laver forcing

zbMATH Keywords

precomplete equivalence relationsreducibility pre-order

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Positive equivalences
• Classifying positive equivalence relations
• The relation of A to Prov ˹A˺ in the Lindenbaum sentence algebra
• On the relation provable equivalence and on partitions in effectively inseparable sets
• Title not available (Why is that?)

Cited In (8)

• Complexity of equivalence relations and preorders from computability theory
• \(UV^ n\)-equivalence and \(n\)-equivalence
• Precomplete Equivalence Relations in Dominical Categories
• Weakly precomplete equivalence relations in the Ershov hierarchy
• Complete, Recursively Enumerable Relations in Arithmetic
• On the relationship between ATR₀ and
• On Σ¹ ₁ equivalence relations over the natural numbers
• On Some Properties of Recursively Enumerable Equivalence Relations

This page was built for publication: \(\Sigma^ n_ 0\)-equivalence relations

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