Related papers: Locally compact groups and continuous logic
We present a selection of results contributing to a structure theory of totally disconnected locally compact groups.
Our aim is to find some new links between linear (circular) orderability of groups and topological dynamics. We suggest natural analogs of the concept of algebraic orderability for topological groups involving order-preserving actions on…
A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…
We study analogues of Cartan decompositions of Lie groups for totally disconnected locally compact groups. It is shown using these decompositions that a large class of totally disconnected locally compact groups acting on trees and…
The representation theory for categorical groups is constructed. Each categorical group determines a monoidal bicategory of representations. Typically, these categories contain representations which are indecomposable but not irreducible. A…
Inquisitive team logic is a variant of inquisitive logic interpreted in team semantics, which has been argued to provide a natural setting for the regimentation of dependence claims. With respect to sentences, this logic is known to be…
We study totally disconnected locally compact second countable (t.d.l.c.s.c.) groups that contain a compact open subgroup with finite rank. We show such groups that additionally admit a pro-$\pi$ compact open subgroup for some finite set of…
A p-local finite group consists of a finite p-group S, together with a pair of categories which encode ``conjugacy'' relations among subgroups of S, and which are modelled on the fusion in a Sylow p-subgroup of a finite group. It contains…
Computability logic is a formal theory of computability. The earlier article "Introduction to cirquent calculus and abstract resource semantics" by Japaridze proved soundness and completeness for the basic fragment CL5 of computability…
We construct locally compact groups with no non-trivial Invariant Random Subgroups and no non-trivial Uniformly Recurrent Subgroups.
We examine sufficient conditions for the dual of a topological group to be metrizable and locally compact.
Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…
We study the expressive power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulation, for some finite k, are definable in modal logic extended…
This (quasi-)survey addresses the quasi-isometry classification of locally compact groups, with an emphasis on amenable hyperbolic locally compact groups. This encompasses the problem of quasi-isometry classification of homogeneous…
Locally conformal symplectic (l.c.s.) groupoids are introduced as a generalization of symplectic groupoids. We obtain some examples and we prove that l.c.s. groupoids are examples of Jacobi groupoids in the sense of \cite{IM}. Finally, we…
We analyse logic actions of Polish groups which arise in continuous logic. We extend the generalised model theory of H.Becker to the case of Polish G-spaces when G is an arbitrary Polish group.
Motivated by analogous results in locally conformal symplectic geometry, we study different classes of G$_2$-structures defined by a locally conformal closed 3-form. In particular, we give a complete characterization of invariant exact…
The class of locally compact near abelian groups is introduced and investigated as a class of metabelian groups formalizing and applying the concept of scalar multiplication. The structure of locally compact near abelian groups and its…
The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…