scientific article; zbMATH DE number 7089067

MaRDI QIDQ5227517zbMATH OpenFDO

Authors Erwin Engeler

Publication date 6 August 2019

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

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03)

Cites work

• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• scientific article; zbMATH DE number 5219795 (Why is no real title available?)
• Algebras and combinators
• Computation in networks of passively mobile finite-state sensors
• Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
• Deciding parity games in quasipolynomial time
• Fixed-dimensional energy games are in pseudo-polynomial time
• Games for synthesis of controllers with partial observation.
• Hilbert's Twenty-Fourth Problem
• Infinite Synchronizing Words for Probabilistic Automata
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Keeping a crowd safe: on the complexity of parameterized verification (invited talk)
• Lambda terms for natural deduction, sequent calculus and cut elimination
• Limit synchronization in Markov decision processes
• On regularity of unary probabilistic automata
• Parameterised model checking for alternating-time temporal logic
• Probabilistic automata on finite words: decidable and undecidable problems
• Reachability games on extended vector addition systems with states
• Reasoning about systems with many processes
• Synchronizing Automata and the Černý Conjecture
• The Last Mathematician from Hilbert's Göttingen: Saunders Mac Lane as Philosopher of Mathematics
• Verification of population protocols

Cited in

(1)

• A Forgotten Theory of Proofs ?

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227517)