- Composed Bisimulation for Tree Automata Parosh A. Abdulla Ahmed Bouajjani Lukáš Holík Lisa Kaati Tomas Vojnar Tue 09 April 2013
- On Mathematicians Who Liked Logic Ivor Grattan-Guinness Tue 09 April 2013
- Unifying Buchi Complementation Constructions Seth J. Fogarty Orna Kupferman Thomas Wilke Moshe Y. Vardi Mon 08 April 2013
- Recognition and parsing of context-free languages in time n3 Daniel H. Younger Mon 08 April 2013
- Linear-time algorithms for testing the satisfiability of propositional horn formulae William F. Dowling Jean H. Gallier Mon 08 April 2013
- The Horn mu-calculus W. Charatonik D. McAllester D. Niwinski A. Podelski I. Walukiewicz Mon 08 April 2013
- On Greatest Fixpoint Semantics of Logic Programming Mathieu Jaume Mon 08 April 2013
- Probabilistic ømega-automata Christel Baier Marcus Grøsser Nathalie Bertrand Mon 08 April 2013
- Profinite Solutions for Recursive Domain Equations Carl A. Gunter Mon 08 April 2013
- Universal profinite domains Carl A. Gunter Mon 08 April 2013
- Duality and recognition Mai Gehrke Mon 08 April 2013
- Automatic Methods of Inductive Inference Gordon Plotkin Sun 07 April 2013
- Domains Gordon Plotkin Sun 07 April 2013
- Intuitionistic propositional logic is polynomial-space complete Richard Statman Fri 05 April 2013
- The Lattice of Subsemilattices of a Semilattice Leonid Libkin Ilya Muchnik Fri 05 April 2013
- Stable models of typed łambda-calculi Gérard Berry Wed 03 April 2013
- Functional Characters of Solvable Terms M. Coppo M. Dezani Ciancaglini B. Venneri Tue 02 April 2013
- Finite Model Theory in the Simply Typed Lambda Calculus Gerd G. Hillebrand Mon 01 April 2013
- Algebraic automata and context-free sets J. Mezei J.B. Wright Mon 01 April 2013
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory J. W. Thatcher Mon 01 April 2013
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 15:38:46,
Build Time: N/A
