Combinatory logic and the ω-rule
Completeness of cut-free type theories.
Computable categoricity versus relative computable categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1 decidable computably categorical structure is relatively Δ⁰₂ categorical. We study the complexity of various index sets associated with computable categoricity and relative computable categoricity. We also introduce and study a variation of relative computable categoricity, comparing it to both computable...
Consistency statements in formal theories
Dalle teorie -categoriche a quelle -categoriche : un passo intermedio
Definable functions in the -categorical weakly circularly minimal structures.
Dense pairs of o-minimal structures
The structure of definable sets and maps in dense elementary pairs of o-minimal expansions of ordered abelian groups is described. It turns out that a certain notion of "small definable set" plays a special role in this description.
Ein Henkin-Beweis für die Vollständigkeit eines Kalküls relativ zur Grzegorczyk-Semantik.
Elementary versions of the Sylvester-Gallai theorem.
Errata to the paper "Generalizing Vaught sentences from ω to strong cofinality ω", Fundamenta Mathematicae 82 (1974), pp. 105-119
Estimation of the algorithmic complexity of classes of computable models.
Exercices en stabilité
Exercices sur la stabilité
Failure of completeness properties of intuitionistic predicate logic for constructive models
Generalization of the concept of variety and quasivariety to partial algebras through category theory [Book]
Generalizing Vaught sentences from ω to strong cofinality ω
Gödel's diagonalization technique and related properties of theories
Homogeneous models and stable diagrams.
Index sets of decidable models.
Limits to some interpolation theorems