Skip to Main content Skip to Navigation
Theses

Some proof-theoretical approaches to Monadic Second-Order logic

Abstract : This thesis studies certain aspects of Monadic Second-Order logic over infinitewords (MSO) through the lens of proof-theory. It is split into two independentparts.The first parts studies intuitionistic variants of MSO with strong witnessing properties allowing the extraction of synchronous functions from formal proof derivations.A constructive system with a suitable witnessing property is defined and proven correct and complete with respect to Church’s synthesis. To this end, the usual correspondence between MSO formulas and automata is refined to give a semantics of the constructive subsystem where proofs are correspond to simulations between non-deterministic automata. This notion is extended toalternating automata. This leads to a finer-grained system based on linear logicand MSO, which is then approached similarly. A stronger completeness theoremis shown for this latter system; the proof requires the determination of ω-regular games and an interpretation of linear formulas reminiscent of Gödel’sDialectica.The second part of this thesis is concerned with the axiomatic strength of the decidability theorem for MSO over infinite words and related results on infinite word automata. We proveamong other things an equivalence between the decidability of MSO, the additive version ofRamsey’s theorem for pairs and the principle of Σ⁰₂-induction over the weak artithmetical theoryRCA₀. We conclude this part by collecting a few results concerning the decidability of MSO overrationals, showing that axioms beyond Σ⁰₂-induction are necessary in that case.
Document type :
Theses
Complete list of metadatas

Cited literature [73 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-02954006
Contributor : Abes Star :  Contact
Submitted on : Wednesday, September 30, 2020 - 4:24:09 PM
Last modification on : Thursday, October 1, 2020 - 3:33:16 AM

File

PRADIC_Pierre_2020LYSEN028_The...
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-02954006, version 1

Citation

Pierre Pradic. Some proof-theoretical approaches to Monadic Second-Order logic. Logic in Computer Science [cs.LO]. Université de Lyon; Uniwersytet Warszawski. Wydział Matematyki, Informatyki i Mechanik, 2020. English. ⟨NNT : 2020LYSEN028⟩. ⟨tel-02954006⟩

Share

Metrics

Record views

47

Files downloads

10