-posets
Da Tarski a Hrushovski: Nascita e splendori della Teoria dei Modelli
Dal superamento del riduzionismo insiemistico alla ricerca di una più ampia e profonda comprensione tra matematici e studiosi di altre discipline scientifiche ed umanistiche
Proponiamo in questa Nota un quadro assiomatico aperto e non riduzionista, che si basa sulle idee primitive di qualità e relazione, in cui speriamo sia possibile innestare i concetti fondamentali della Matematica, della Logica e dell’Informatica (di cui diamo solo alcuni primissimi esempi). Auspichiamo che sviluppando liberamente tale quadro sia possibile giungere ad un fruttuoso confronto critico delle idee fondamentali delle diverse discipline scientifiche ed umanistiche, non ristretto agli «specialisti...
Dalle teorie -categoriche a quelle -categoriche : un passo intermedio
Dark age (but not obscure) logic -- a brief excursion.
Das Entscheidungsproblem der Klasse von Formeln, die höchstens zwei Primformeln enthalten.
Data types as lattices : retractions, closures and projections
De beaux groupes
Dans une belle paire de modèles d’une théorie stable ayant élimination des imaginaires sans la propriété de recouvrement fini, tout groupe définissable se projette, à isogénie près, sur les points -rationnels d’un groupe définissable dans le réduit à paramètres dans . Le noyau de cette projection est un groupe définissable dans le réduit.Un groupe interprétable dans une paire de corps algébriquement clos où est une extension propre de est, à isogénie près, l’extension des points -rationnels...
De la notion d'opération à celle d'opérateur ou à la recherche de formalismes intrinsèques
De l'infinitésimal au local (Thèse de Doctorat d'État)
De Morgan's and strong De Morgan's laws in a topos of shaves
Decidability and definability results related to the elementary theory of ordinal multiplication
The elementary theory of ⟨α;×⟩, where α is an ordinal and × denotes ordinal multiplication, is decidable if and only if . Moreover if and respectively denote the right- and left-hand divisibility relation, we show that Th and Th are decidable for every ordinal ξ. Further related definability results are also presented.
Decidability and structure
Decidability and undecidability of theories of abelian groups with predicates for subgroups
Decidability of code properties
We explore the borderline between decidability and undecidability of the following question: “Let C be a class of codes. Given a machine of type X, is it decidable whether the language lies in C or not?” for codes in general, ω-codes, codes of finite and bounded deciphering delay, prefix, suffix and bi(pre)fix codes, and for finite automata equipped with different versions of push-down stores and counters.
Decidability of equational theories of coverings of semigroup varieties.
Decidability of the HD0L ultimate periodicity problem
In this paper we prove the decidability of the HD0L ultimate periodicity problem.
Decidability of the rings of real algebraic and p-adic algebraic integers.
Decidability of weak equational theories
Decidability problems for the variety generated by tournaments.