Finitary birepresentations of finitary bicategories
نویسندگان
چکیده
Abstract In this paper, we discuss the generalization of finitary 2-representation theory 2-categories to birepresentation bicategories. previous papers on subject, classification simple transitive 2-representations a given 2-category was reduced that for certain subquotients. These reduction results were all formulated as bijections between equivalence classes 2-representations. generalize them biequivalences birepresentations. Furthermore, prove an analog double centralizer theorem in theory.
منابع مشابه
Finitary Languages
The class of ω-regular languages provides a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually”. Finitary liveness was proposed by Alur and Henzinger as a stronger formulation of liveness [AH98]. It requires that there exists an unknown, fixed bound b...
متن کاملFinitary Coloring
Suppose that the vertices of Z are assigned random colors via a finitary factor of independent identically distributed (iid) vertex-labels. That is, the color of vertex v is determined by a rule that examines the labels within a finite (but random and perhaps unbounded) distance R of v, and the same rule applies at all vertices. We investigate the tail behavior of R if the coloring is required ...
متن کاملFinitary Sketches
Finitary sketches, i.e., sketches with nite-limit and nite-colimit specii-cations, are proved to be as strong as geometric sketches, i.e., sketches with nite-limit and arbitrary colimit speciications. Categories sketchable by such sketches are fully characterized in the innnitary rst-order logic: they are axiomatizable by-coherent theories, i.e., basic theories using nite conjunctions, countabl...
متن کاملFinitary Algebraic Superspace
An algebraic scheme is suggested in which discretized spacetime turns out to be a quantum observable. As an example, a toy model producing spacetimes of four points with diierent topologies is presented. The possibility of incorporating this scheme into the framework of non-commutative diierential geometry is discussed.
متن کاملFinitary Deduction Systems
Cryptographic protocols are the cornerstone of security in distributed systems. The formal analysis of their properties is accordingly one of the focus points of the security community, and is usually split among two groups. In the first group, one focuses on trace-based security properties such as confidentiality and authentication, and provides decision procedures for the existence of attacks...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Forum Mathematicum
سال: 2021
ISSN: ['1435-5337', '0933-7741']
DOI: https://doi.org/10.1515/forum-2021-0021