
Finite Model Theory of the Triguarded Fragment and Related Logics
The Triguarded Fragment (TGF) is among the most expressive decidable fra...
read it

Bringing Trimmed Serendipity Methods to Computational Practice in Firedrake
We present an implementation of the trimmed serendipity finite element f...
read it

Alternation diameter of a product object
We prove that every permutation of a Cartesian product of two finite set...
read it

Polymorphism and the free bicartesian closed category
We study two decidable fragments of System F, the polynomial and the Yon...
read it

An adaptive finite element approach for lifted branched transport problems
We consider socalled branched transport and variants thereof in two spa...
read it

Generic properties in some classes of automaton groups
We prove, for various important classes of Mealy automata, that almost a...
read it

Comonadic semantics for guarded fragments
In previous work, Abramsky, Dawar and Wang (LiCS 2017) and Abramsky and ...
read it
Products in a Category with Only One Object
We consider certain decision problems for the free model of the theory of Cartesian monoids. We introduce a model of computation based on the notion of a single stack oneway PDA due to Ginsburg, Greibach and Harrison. This model allows us to solve problems such as (1) Given a finite set B of elements and an element F, is F a product of members of B? (2) Is the submonoid generated by the finite set B infinite? for certain fragments of the free Cartesian monoid. These fragments include the submonoid of right invertible elements and so our results apply to the ThompsonHigman groups.
READ FULL TEXT
Comments
There are no comments yet.