Logical aspects of Cayley-graphs: the group case (Q705541): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apal.2004.06.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976522318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domino Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic characterization of groups with soluble word problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the regular structure of prefix rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On infinite transition graphs having a decidable monadic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs, II: Infinite graphs of bounded width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second order logic of graphs. VI: On several representations of graphs by relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CAYLEY GRAPHS OF VIRTUALLY FREE GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NOTE ON THE EXISTENTIAL THEORY OF EQUATIONS IN PLAIN GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existential and positive theories of equations in graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on tree decomposition of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting up graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The accessibility of finitely presented groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability and undecidability of extensions of second (first) order theory of (generalized) successor / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups and Simple Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group presentations, formal languages and characterizations of one- counter groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgroups of finitely presented groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dehn's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4750010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DECIDABILITY OF THE UNIVERSAL AND POSITIVE THEORIES OF A FREE GROUP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4090322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups, the theory of ends, and context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of ends, pushdown automata, and second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphism groups of context-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical representatives and equations in hyperbolic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups and graphs: Groups acting on trees, ends, and cancellation diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3806816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of the models of decidable monadic theories of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective version of Stallings' theorem in the case of context-free groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic theory of order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4113396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5651924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic dynamic logic is strictly weaker than dynamic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4362730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-transitive graphs and accessibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and groups with tree-like properties / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:50, 7 June 2024

scientific article
Language Label Description Also known as
English
Logical aspects of Cayley-graphs: the group case
scientific article

    Statements

    Logical aspects of Cayley-graphs: the group case (English)
    0 references
    0 references
    0 references
    31 January 2005
    0 references
    word problem
    0 references
    context-free groups
    0 references
    Cayley graph
    0 references
    monadic second-order theory
    0 references
    decidability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references