1.4k citations
- Centre National de la Recherche ScientifiqueFR23 papers
- Aalto UniversityFI19 papers
- University of PotsdamDE16 papers
- Charles UniversityCZ13 papers
- Franche-Comté Électronique Mécanique Thermique et Optique - Sciences et TechnologiesFR10 papers
- University of HelsinkiFI10 papers
- European Southern ObservatoryCL9 papers
- Observatoire de la Côte d’AzurFR9 papers
- Search for Extraterrestrial IntelligenceUS9 papers
- Adam Mickiewicz University in PoznańPL8 papers
- Institut de Mécanique Céleste et de Calcul des ÉphéméridesFR8 papers
- Laboratoire d’Astrophysique de MarseilleFR8 papers
4 papers · 1 filter
Team Semantics and Recursive Enumerability
Antti Kuusisto
It is well known that dependence logic captures the complexity class NP, and it has recently been shown that inclusion logic captures P on ordered models. These results demonstrate…
Boolean Dependence Logic and Partially-Ordered Connectives
Johannes Ebbing, Lauri Hella, Peter Lohmann +1
We introduce a new variant of dependence logic called Boolean dependence logic. In Boolean dependence logic dependence atoms are of the type =(x_1,...,x_n,α), where αis a Boolean v…
One-dimensional fragment of first-order logic
Lauri Hella, Antti Kuusisto
We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (…
The size of a formula as a measure of complexity
Lauri Hella, Jouko Väänänen
We introduce a refinement of the usual Ehrenfeucht-Fra\"ıssé game. The new game will help us make finer distinctions than the traditional one. In particular, it can be used to meas…