scientific article; zbMATH DE number 7147442

MaRDI QIDQ5207050

Pierre Pradic, Colin Riba

Publication date: 3 January 2020

Full work available at URL: https://arxiv.org/abs/1803.08958

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Second- and higher-order arithmetic and fragments (03F35) Intuitionistic mathematics (03F55) Higher-order logic (03B16)

Related Items (2)

Monoidal-closed categories of tree automata ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesis of Reactive(1) designs
• Antichains and compositional algorithms for LTL synthesis
• Lectures on the Curry-Howard isomorphism
• Automata, logics, and infinite games. A guide to current research
• A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words
• Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
• Facets of Synthesis: Revisiting Church’s Problem
• LMSO
• Monoidal-closed categories of tree automata
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• Testing and generating infinite sequences by a finite automaton
• Safraless Compositional Synthesis

This page was built for publication: