Meet ApplyKite Twin, the application assistant that learns with you

Meet your Twin, it learns with you

Your Twin learns with you

Launch week codes:30% off annual Pro20% off monthly Pro

Ends in00h00m00s

Juha Kontinen

Has grant

University of Helsinki

Finland

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

Professors in Finland

Recent Grants

Grant: Close

Dependence Logic and Its Applications

Open Date: 2017-01-01

Close Date: 2020-01-01

Articles (24)

Year:

2027

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2024

Year:

2024

Year:

2024

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2021

Year:

2020

Collaborators (10)

Jonni Virtema

Lecturer in Verification

University of Glasgow

UNITED KINGDOM

View details

Fan Yang

assistant professor

Utrecht University

NETHERLANDS

View details

Arne Meier

Professor

Leibniz University Hannover

GERMANY

View details

Miika Hannula

University of Helsinki

FINLAND

View details

Max Sandström

University of Helsinki

FINLAND

View details

Sebastian Link

Professor

University of Auckland

NEW ZEALAND

View details

Heribert Vollmer

Professor, Institutsleiter

Leibniz University Hannover

GERMANY

View details

Kerkko Luosto

University Lecturer

University of Tampere

FINLAND

View details

Minna Hirvonen

University of Helsinki

FINLAND

View details

Arnaud Durand

Professor

Université Paris Cité

FRANCE

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Juha Kontinen

Research Interests

Make your next move.

Explore related searches

Recent Grants

Articles (24)

A Circuit-Theoretic View of $$\textrm{FO}$$ over Semirings

Independence Under Incomplete Information

Counting of Teams in First-Order Team Logics

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex

On the Expressive Power of Inquisitive Team Logic and Inquisitive First-Order Logic

Expressivity of asynchronous TeamLTL and HyperLTL

Towards new characterizations of small circuit classes via discrete ordinary differential equations

Logics with probabilistic team semantics and the Boolean negation

Regular Representations of Uniform TC 0

The flattening operator in team-based logics

Set semantics for asynchronous TeamLTL

Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations

On the Complexity and Properties of Preferential Propositional Dependence Logic

Modular SAT-based techniques for reasoning tasks in team semantics

Parameterized complexity of weighted team definability

Logics for Dependence and Independence: Expressivity and Complexity (Dagstuhl Seminar 24111)

Complete logics for elementary team properties

Complexity Aspects of Logics in Team Semantics

A parameterized view on the complexity of dependence and independence logic

On elementary logics for quantitative dependencies

Tractability Frontier of Data Complexity in Team Semantics

Preface

Descriptive complexity of #P functions

Polyteam semantics

Collaborators (10)

Jonni Virtema

Fan Yang

Arne Meier

Miika Hannula

Max Sandström

Sebastian Link

Heribert Vollmer

Kerkko Luosto

Minna Hirvonen

Arnaud Durand

Make your next move.