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

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

collaborators
Showing cs.LOShow all

31 papers · 1 filter

cs.LO2024

Synchronous Team Semantics for Temporal Logics

Andreas Krebs, Arne Meier, Jonni Virtema +1

We present team semantics for two of the most important linear and branching time specification languages, Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). With team s…

cs.LO2024

A Remark on the Expressivity of Asynchronous TeamLTL and HyperLTL

Juha Kontinen, Max Sandström, Jonni Virtema

Linear temporal logic (LTL) is used in system verification to write formal specifications for reactive systems. However, some relevant properties, e.g. non-inference in information…

cs.LO2023

Logics with probabilistic team semantics and the Boolean negation

Miika Hannula, Minna Hirvonen, Juha Kontinen +3

We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic ind…

cs.LO2023★ 1 cited

Complexity of Neural Network Training and ETR: Extensions with Effectively Continuous Functions

Teemu Hankala, Miika Hannula, Juha Kontinen +1

We study the complexity of the problem of training neural networks defined via various activation functions. The training problem is known to be existsR-complete with respect to li…

cs.LO2023

Set Semantics for Asynchronous TeamLTL: Expressivity and Complexity

Juha Kontinen, Max Sandström, Jonni Virtema

We introduce and develop a set-based semantics for asynchronous TeamLTL. We consider two canonical logics in this setting: the extensions of TeamLTL by the Boolean disjunction and…

cs.LO2023

Strongly complete axiomatization for a logic with probabilistic interventionist counterfactuals

Fausto Barbero, Jonni Virtema

Causal multiteam semantics is a framework where probabilistic notions and causal inference can be studied in a unified setting. We study a logic (PCO) that features marginal probab…