Skip to main content
Vai all'homepage della Commissione europea (si apre in una nuova finestra)
italiano it
CORDIS - Risultati della ricerca dell’UE
CORDIS

Generalised Tree Automata, Monadic Second Order Logic and Transfer Principles in Combinatorial Limits

Descrizione del progetto

Nuovi approcci a importanti questioni aperte in matematica e informatica

La logica monadica del secondo ordine (MSO, Monadic Second Order), o teoria MSO, è un tipo di logica matematica particolarmente importante per esprimere le specifiche formali delle proprietà dei grafi e per la teoria degli automi che descrive macchine semoventi sia astratte che reali. Negli ultimi cinquant’anni, gli scienziati hanno compiuto numerosi progressi nella teoria dell’MSO, ma rimangono ancora questioni aperte importanti. Con il supporto del programma di azioni Marie Skłodowska-Curie, il progetto FINTOINF sta affrontando due di questi che sono rimasti enigmi nonostante l’intenso interesse manifestato e i vasti sforzi compiuti: la congettura di Shelah sulla teoria monadica dell’ordine e i limiti combinatori numerabili.

Obiettivo

The project will concentrate on two main directions (MD), which are connected through them both relying on Monadic Second Order (MSO) and its variants. (MD 1) Shelah's conjecture. In his celebrated 1975 paper Shelah proved that the monadic second order theory (MSO) of the real order is undecidable. He conjectured in his Conjecture 7B that Conjecture: MSO of the real order where the second order quantifier ranges only over Borel sets, is decidable. In spite of important efforts on this question in both mathematics and computer science community, the conjecture is still open. Many strategies, including the one suggested by Shelah in his paper (to use Borel determinacy) have been tried. We propose to study this question using the recent methods of the generalised descriptive set theory and the generalised automata that we intend to develop. This is novel and might lead to important advances and the solution. (MD2) Countable combinatorial limits. Since the work of Lovasz and others in his group around 2006, a new area of discrete mathematics emerged: the combinatorial limits. This fast growing area aroused much interest and found many applications Its first development was that of a graphon, which is an uncountable limit of a sequence of finite graphs, but there have been several others. It is always important to understand the transfer properties of statements between the sequence forming the limit and the limit itself. The question has been considered through ultrapowers and through topology and Stone's pairings. None suffices for the transfer of MSO sentence. We propose to study that transfer through the novel notion of a countable model where the notion of satisfaction has been changed so that the countable model reflects the structure of the sequence of finite models that were used to obtain the uncountable combinatorial limit. In this sense we obtain a countable combinatorial limit which we study using the methods of finite model theory.

Campo scientifico (EuroSciVoc)

Parole chiave

Programma(i)

Argomento(i)

Meccanismo di finanziamento

MSCA-IF - Marie Skłodowska-Curie Individual Fellowships (IF)

Vedi tutti i progetti finanziati nell’ambito di questo schema di finanziamento

Invito a presentare proposte

(si apre in una nuova finestra) H2020-MSCA-IF-2020

Vedi tutti i progetti finanziati nell’ambito del bando

Coordinatore

CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE CNRS
Contributo netto dell'UE
€ 196 707,84
Indirizzo
RUE MICHEL ANGE 3
75794 Paris
Francia
Regione
Ile-de-France Ile-de-France Paris
Tipo di attività
Research Organisations
Collegamenti
Costo totale
€ 196 707,84