output
20232026
most citedA higher-order transformation approach to the formalization and analysis of BPMN using graph transformation systems

6 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing math.LOShow all

4 papers · 1 filter

math.LO2026

On the Diophantine problem related to power circuits

Alexander Rybalov

Myasnikov, Ushakov, and Won introduced power circuits in 2012 to construct a polynomial-time algorithm for the word problem in the Baumslag group, which has a non-elementary Dehn f…

math.LO2025

Constraint satisfaction problems, compactness and non-measurable sets

Claude Tardif

A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the exis…

math.LO2023

Multi-representation associated to the numbering of a subbasis and formal inclusion relations

Emmanuel Rauzy

We revisit Dieter Spreen's notion of a representation associated to a numbered basis equipped with a strong inclusion relation. We show that by relaxing his requirements, we obtain…

math.LO2023

Relating homotopy equivalences to conservativity in dependent type theories with computation axioms

Matteo Spadetto

We prove a conservativity result for extensional type theories over propositional ones, i.e. dependent type theories with propositional computation rules, or computation axioms, us…