On the $n$-back-and-forth types of Boolean algebras (Q3116576): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Pairs of recursive structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of recursive structures in arithmetical degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categoricity in hyperarithmetical degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Back and forth relations for reduced abelian \(p\)-groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isomorphism problem for computable Abelian <sub><i>p</i></sub>-groups of bounded length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean algebras, Tarski invariants, and index sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Low Boolean Algebra is Isomorphic to a Recursive One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing The Expressive Power of Some Languages for Boolean Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternative characterizations of finitary and well-founded Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $n$-back-and-forth types of Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean algebras, Stone spaces, and the iterated Turing jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimally generated Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Low 2 Boolean Algebra has a Recursive Copy / rank
 
Normal rank

Revision as of 23:12, 4 July 2024

scientific article
Language Label Description Also known as
English
On the $n$-back-and-forth types of Boolean algebras
scientific article

    Statements

    On the $n$-back-and-forth types of Boolean algebras (English)
    0 references
    0 references
    0 references
    24 February 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    Boolean algebras
    0 references
    back-and-forth equivalence
    0 references
    computational complexity
    0 references