Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)

We consider encoding finite automata as least fixed points in a proof- theoretical framework equipped with a general induction scheme, and study au- tomata inclusion in that

• We provide a declarative treatment of several basic aspects of model checking by using a proof search semantics of a fragment of multiplicative additive linear logic (MALL)

Key-words: Proof nets, cut elimination, identity of proofs, correctness criterion, multiplicative linear logic, pomset logic, classical logic... R´ esum´ e : Pas

We report on a proof-checked version of Stone’s result on the representability of Boolean algebras via the clopen sets of a totally disconnected compact Hausdor↵ space.. Our

tlaps is based on a hierarchical proof language that results in a clear proof structure and enables independent checking of the different proof obligations that arise in a proof..

Solvers and decision procedures: Some fragments of Tarski-Kleene algebras are known to be decidable, for instance the equational theories of Kleene algebras, Kleene algebras with

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

oj+e,, ri wkh Eùkp wuhh ri x1 L uvw vkrz wkdw +fi wkh sursrvlwlrq 8, li d eudqfk e ri x lv +w> d, xvhixo dqg wkhuh lv d ghfrudwlrq iru +x> e,/ wkhq wkhuh lv d ghfrudwlrq