activity
20112026
most citedWeak Models of Distributed Computing, with Connections to Modal Logic

31 citations · 83 across the 33 of their papers we have counts for

collaborators
Showing math.LOShow all

20 papers · 1 filter

math.LO2026

Model Comparison Games for Generalized Quantifiers

Antti Kuusisto, Miguel Moreno, Matias Selin

We introduce three new model comparison games that characterize separability by first-order formulas with generalized quantifiers. The first is built on the Ehrenfeucht-Fraïssé gam…

math.LO2024

Description Complexity of Unary Structures in First-Order Logic with Links to Entropy

Reijo Jaakkola, Antti Kuusisto, Miikka Vilander

The description complexity of a model is the length of the shortest formula that defines the model. We study the description complexity of unary structures in first-order logic FO,…

math.LO2023

A monotone connection between model class size and description length

Reijo Jaakkola, Antti Kuusisto, Miikka Vilander

This paper links sizes of model classes to the minimum lengths of their defining formulas, that is, to their description complexities. Limiting to models with a fixed domain of siz…

math.LO2022

Relating description complexity to entropy

Reijo Jaakkola, Antti Kuusisto, Miikka Vilander

We demonstrate some novel links between entropy and description complexity, a notion referring to the minimal formula length for specifying given properties. Let MLU be the logic o…

math.LO2022

First-order logic with self-reference

Reijo Jaakkola, Antti Kuusisto

We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two…

math.LO2022

The power of clockings

Antti Kuusisto

We investigate the expressive power of a Turing-complete logic based on game-theoretic semantics. By defining suitable fragments and variants of the logic, we obtain a range of nat…