Simple and subdirectly irreducible finitely supported \(Cb\)-sets

DOI10.1016/J.TCS.2017.08.003zbMath1380.68122OpenAlexW2747695077MaRDI QIDQ1680555

Mojgan Mahmoudi, M. Mehdi Ebrahimi, Khadijeh Keshvardoost

Publication date: 16 November 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.08.003

zbMATH Keywords

indecomposablesupportsimplesubdirectly irreducible\(Cb\)-set

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Unnamed Item

Uses Software

• Nominal Isabelle
• FreshOCaml

Cites Work

• Nominal monoids
• A new approach to abstract syntax with variable binding
• Nominal techniques in Isabelle/HOL
• Nominal logic, a first order theory of names and binding
• Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers
• Nominal Sets
• Automata theory in nominal sets
• Towards nominal computation
• Absolute retractness of automata on directed complete posets
• One-and-a-halfth-order Logic
• Nominal Domain Theory for Concurrency
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simple and subdirectly irreducible finitely supported \(Cb\)-sets