Gianluca Paolini

dblp:163/6399 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
3since 2021 · last 2024
0000-0002-8266-362XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5 · 2 first-author · 3 since 2021
YearPublicationVenuePosition
2024 Computable Scott sentences and the weak Whitehead problem for finitely presented groups
Gianluca Paolini
Ann. Pure Appl. Log.1
2021 First-order model theory of free projective planes
Tapani Hyttinen, Gianluca Paolini
Ann. Pure Appl. Log.2
2021 Strongly Minimal Steiner Systems I: existence
abstract
Abstract A linear space is a system of points and lines such that any two distinct points determine a unique line; a Steiner k-system (for $k \geq 2$ ) is a linear space such that each line has size exactly k. Clearly, as a two-sorted structure, no linear space can be strongly minimal. We formulate linear spaces in a (bi-interpretable) 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 minimal Steiner k-system $\mathcal {G}_\mu $ , whose algebraic closure geometry has all the properties of the ab initio Hrushovski construction. Thus each is a counterexample to the Zilber Trichotomy Conjecture.
John Baldwin, Gianluca Paolini
J. Symb. Log.2
2018 Beyond abstract elementary classes: On the model theory of geometric lattices
Tapani Hyttinen, Gianluca Paolini
Ann. Pure Appl. Log.2
2016 Dependence Logic in pregeometries and ω-stable Theories
abstract
Abstract We present a framework for studying the concept of independence in a general context covering database theory, algebra and model theory as special cases. We show that well-known axioms and rules of independence for making inferences concerning basic atomic independence statements are complete with respect to a variety of semantics. Our results show that the uses of independence concepts in as different areas as database theory, algebra, and model theory, can be completely characterized by the same axioms. We also consider concepts related to independence, such as dependence.
Gianluca Paolini, Jouko A. Väänänen
J. Symb. Log.1