-
Minimal functions on the random graph
32 pages; this is an extension of article 0903.2553 by the same authors -
Topological Birkhoff
21 pages -
Horn versus full first-order: complexity dichotomies in algebraic constraint ...
International audience -
Essential Convexity and Complexity of Semi-Algebraic Constraints
International audience -
New Ramsey Classes from Old
11 pages. In the second version, to be submitted for journal publication, a number of typos has been removed, and a grant acknowledgement has been added -
Datalog and Constraint Satisfaction with Infinite Templates
International audience -
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
Extended abstract appeared at 25th Symposium on Logic in Computer Science (LICS 2010). This version will appear in the LMCS special issue associated with LICS 2010 -
Logic in the Hyperfinite Factor: Geometry of Interaction and Complexity
This work is a study of the geometry of interaction in the hyperfinite factor introduced by Jean-Yves Girard, and of its relations with ancient constructions. We start... -
Intersection Types with Subtyping by Means of Cut Elimination
International audience -
More infinity for a better finitism
International audience -
Chang's conjecture may fail at supercompact cardinals
We prove a revised version of Laver's indestructibility theorem which slightly improves over the classical result. An application yields the consistency of... -
Forcing indestructibility of set-theoretic axioms
Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show... -
Kurepa-trees and Namba-forcing
We show that compact cardinals and {\rm MM} are sensitive to $\lambda$-closed forcings for arbitrarily large $\lambda$. This is done by adding 'regressive'... -
La forme ou l'arithmetique du temps
This book is designed as the experimental support which makes it possible to the reader to constitute his own imaginary representation of the contents of this writing.... -
On the structure of the monadic logic of the binary tree
International audience -
Variable types for meaning assembly: a logical syntax for generic noun phrase...
International audience -
Elimination of Hyperimaginaries and Stable Independence in simple CM-trivial ...
International audience -
Computational interpretation of classical logic with explicit structural rules
We present a calculus providing a Curry-Howard correspondence to classical logic represented in the sequent calculus with explicit structural rules, namely weakening... -
On the definability of radicals in supersimple groups
If G is a group with supersimple theory having finite SU-rank, the subgroup of G generated by all of its normal nilpotent subgroups is definable and nilpotent. This...
