^ n_ 0-equivalence relations
From MaRDI portal
Publication:793716
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 Σ1 1 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
Cites work
- scientific article; zbMATH DE number 3790416 (Why is no real title available?)
- scientific article; zbMATH DE number 3577197 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Classifying positive equivalence relations
- On the relation provable equivalence and on partitions in effectively inseparable sets
- Positive equivalences
- The relation of A to Prov ˹A˺ in the Lindenbaum sentence algebra
Cited in
(8)- On Some Properties of Recursively Enumerable Equivalence Relations
- \(UV^ n\)-equivalence and \(n\)-equivalence
- Complexity of equivalence relations and preorders from computability theory
- Precomplete Equivalence Relations in Dominical Categories
- Weakly precomplete equivalence relations in the Ershov hierarchy
- Complete, Recursively Enumerable Relations in Arithmetic
- On the relationship between ATR0 and
- On Σ1 1 equivalence relations over the natural numbers
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)
