
18Computable Scott sentences and the weak Whitehead problem for finitely presented groupsAnnals of Pure and Applied Logic 175 (7): 103441. 2024.

32Dependence logic in pregeometries and ωstable theoriesJournal of Symbolic Logic 81 (1): 3255. 2016.

31A logic for arguing about probabilities in measure teamsArchive for Mathematical Logic 56 (56): 475489. 2017.We use sets of assignments, a.k.a. teams, and measures on them to define probabilities of firstorder formulas in given data. We then axiomatise firstorder properties of such probabilities and prove a completeness theorem for our axiomatisation. We use the Hardy–Weinberg Principle of biology and the Bell’s Inequalities of quantum physics as examples.

46Quantum Team Logic and Bell’s InequalitiesReview of Symbolic Logic 8 (4): 722742. 2015.A logical approach to Bell's Inequalities of quantum mechanics has been introduced by Abramsky and Hardy [2]. We point out that the logical Bell's Inequalities of [2] are provable in the probability logic of Fagin, Halpern and Megiddo [4]. Since it is now considered empirically established that quantum mechanics violates Bell's Inequalities, we introduce a modified probability logic, that we call quantum team logic, in which Bell's Inequalities are not provable, and prove a Completeness Theorem …Read more

19Computable scott sentences for quasi–Hopfian finitely presented structuresArchive for Mathematical Logic 62 (1): 5565. 2023.We prove that every quasiHopfian finitely presented structure _A_ has a _d_ \(\Sigma _2\) Scott sentence, and that if in addition _A_ is computable and _Aut_(_A_) satisfies a natural computable condition, then _A_ has a computable _d_ \(\Sigma _2\) Scott sentence. This unifies several known results on Scott sentences of finitely presented structures and it is used to prove that other not previously considered algebraic structures of interest have computable _d_ \(\Sigma _2\) Scott sentences.…Read more

21Strongly minimal Steiner systems I: ExistenceJournal of Symbolic Logic 86 (4): 14861507. 2021.A linear space is a system of points and lines such that any two distinct points determine a unique line; a Steiner ksystem is a linear space such that each line has size exactly k. Clearly, as a twosorted structure, no linear space can be strongly minimal. We formulate linear spaces in a vocabulary $\tau $ with a single ternary relation R. We prove that for every integer k there exist $2^{\aleph _0}$ many integer valued functions $\mu $ such that each $\mu $ determines a distinct strongly mi…Read more

19Firstorder model theory of free projective planesAnnals of Pure and Applied Logic 172 (2): 102888. 2021.

13Coxeter Groups and Abstract Elementary Classes: The RightAngled CaseNotre Dame Journal of Formal Logic 60 (4): 707731. 2019.We study classes of rightangled Coxeter groups with respect to the strong submodel relation of a parabolic subgroup. We show that the class of all rightangled Coxeter groups is not smooth and establish some general combinatorial criteria for such classes to be abstract elementary classes (AECs), for them to be finitary, and for them to be tame. We further prove two combinatorial conditions ensuring the strong rigidity of a rightangled Coxeter group of arbitrary rank. The combination of these …Read more

24Independence in Model Theory and Team SemanticsBulletin of Symbolic Logic 24 (4): 461462. 2018.

30Beyond abstract elementary classes: On the model theory of geometric latticesAnnals of Pure and Applied Logic 169 (2): 117145. 2018.

22Reduction of database independence to dividing in atomless Boolean algebrasArchive for Mathematical Logic 55 (34): 505518. 2016.We prove that the form of conditional independence at play in database theory and independence logic is reducible to the firstorder dividing calculus in the theory of atomless Boolean algebras. This establishes interesting connections between independence in database theory and stochastic independence. As indeed, in light of the aforementioned reduction and recent work of BenYaacov :957–1012, 2013), the former case of independence can be seen as the discrete version of the latter.

23A Finite Axiomatization of GDependenceJournal of Logic, Language and Information 26 (3): 293302. 2017.We show that a form of dependence known as Gdependence admits a very natural finite axiomatization, as well as Armstrong relations. We also give an explicit translation between functional dependence and Gdependence.

42Independence logic and abstract independence relationsMathematical Logic Quarterly 61 (3): 202216. 2015.We continue the work on the relations between independence logic and the modeltheoretic analysis of independence, generalizing the results of [15] and [16] to the framework of abstract independence relations for an arbitrary AEC. We give a modeltheoretic interpretation of the independence atom and characterize under which conditions we can prove a completeness result with respect to the deductive system that axiomatizes independence in team semantics and statistics.
Amsterdam, North Holland, Netherlands
Areas of Interest
Logic and Philosophy of Logic 
Philosophy of Mathematics 