Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding workshop see [Zbl 1130.68007].
Indexed articles:
Abramsky, Samson, Full completeness: Interactive and geometric characterizations of the space of proofs (abstract), 1-2 [Zbl 1179.03058]
de Alfaro, Luca, The symbolic approach to repeated games (abstract), 3 [Zbl 1179.91033]
Beckmann, Arnold, Proofs, programs and abstract complexity, 4-5 [Zbl 1177.03059]
Dawar, Anuj, Model-checking first-order logic: Automata and locality, 6 [Zbl 1179.68081]
Kupferman, Orna, Tightening the exchange rates between automata, 7-22 [Zbl 1179.68072]
Gawlitza, Thomas; Seidl, Helmut, Precise relational invariants through strategy iteration, 23-40 [Zbl 1179.68037]
Kopczyński, Eryk, Omega-regular half-positional winning conditions, 41-53 [Zbl 1179.68071]
Obdržálek, Jan, Clique-width and parity games, 54-68 [Zbl 1179.68090]
Rabinovich, Alexander; Thomas, Wolfgang, Logical refinements of Church’s problem, 69-83 [Zbl 1179.03038]
Dawar, Anuj; Richerby, David, The power of counting logics on restricted classes of finite structures, 84-98 [Zbl 1179.68061]
Abdulla, Parosh Aziz; Delzanno, Giorgio; Van Begin, Laurent, Comparing the expressive power of well-structured transition systems, 99-114 [Zbl 1179.68065]
Finkel, Olivier; Lecomte, Dominique, There exist some \(\omega \)-powers of any Borel rank, 115-129 [Zbl 1179.68069]
Filiot, Emmanuel; Talbot, Jean-Marc; Tison, Sophie, Satisfiability of a spatial logic with tree variables, 130-145 [Zbl 1179.03036]
Bojańczyk, Mikołaj, Forest expressions, 146-160 [Zbl 1179.68068]
Carayol, Arnaud; Löding, Christof, MSO on the infinite binary tree: Choice and order, 161-176 [Zbl 1179.03016]
Fournier, Hervé; Gardy, Danièle; Genitrini, Antoine; Zaionc, Marek, Classical and intuitionistic logic are asymptotically identical, 177-193 [Zbl 1179.03015]
Bodirsky, Manuel; Chen, Hubie, Qualitative temporal and spatial reasoning revisited, 194-207 [Zbl 1179.68150]
Bagan, Guillaume; Durand, Arnaud; Grandjean, Etienne, On acyclic conjunctive queries and constant delay enumeration, 208-222 [Zbl 1179.68047]
Korovin, Konstantin; Voronkov, Andrei, Integrating linear arithmetic into superposition calculus, 223-237 [Zbl 1179.03018]
Kesner, Delia, The theory of calculi with explicit substitutions revisited, 238-252 [Zbl 1179.03022]
Gaboardi, Marco; Ronchi Della Rocca, Simona, A soft type assignment system for \(\lambda \)-calculus, 253-267 [Zbl 1179.03062]
Berline, Chantal; Manzonetto, Giulio; Salibra, Antonino, Lambda theories of effective lambda models, 268-282 [Zbl 1179.03020]
Lassen, Soren B.; Levy, Paul Blain, Typed normal form bisimulation, 283-297 [Zbl 1179.68038]
Bucciarelli, Antonio; Ehrhard, Thomas; Manzonetto, Giulio, Not enough points is enough, 298-312 [Zbl 1179.03021]
Miquel, Alexandre, Classical program extraction in the calculus of constructions, 313-327 [Zbl 1179.68039]
Blanqui, Frédéric; Jouannaud, Jean-Pierre; Strub, Pierre-Yves, Building decision procedures in the calculus of inductive constructions, 328-342 [Zbl 1179.68135]
Weis, P.; Immerman, N., Structure theorem and strict alternation hierarchy for FO\(^{2}\) on words, 343-357 [Zbl 1168.03328]
Göller, Stefan, On the complexity of reasoning about dynamic policies, 358-373 [Zbl 1179.03037]
Aehlig, Klaus; Cook, Stephen; Nguyen, Phuong, Relativizing small complexity classes and their theories, 374-388 [Zbl 1179.68059]
Chen, Yijia; Flum, Jörg, Subexponential time and fixed-parameter tractability: Exploiting the miniaturization mapping, 389-404 [Zbl 1179.68060]
Miller, Dale; Saurin, Alexis, From proofs to focused proofs: A modular proof of focalization in linear logic, 405-419 [Zbl 1179.03064]
Hoshino, Naohiko, Linear realizability, 420-434 [Zbl 1179.03068]
Jacobé de Naurois, Paulin; Mogbil, Virgile, Correctness of multiplicative (and exponential) proof structures is NL-complete, 435-450 [Zbl 1179.03063]
Liang, Chuck; Miller, Dale, Focusing and polarization in intuitionistic logic, 451-465 [Zbl 1179.03057]
Miller, Dale; Nigam, Vivek, Incorporating tables into proofs, 466-480 [Zbl 1179.03019]
Gaintzarain, Joxe; Hermo, Montserrat; Lucio, Paqui; Navarro, Marisa; Orejas, Fernando, A cut-free and invariant-free sequent calculus for PLTL, 481-495 [Zbl 1179.03056]
Burel, Guillaume, Unbounded proof-length speed-up in deduction modulo, 496-511 [Zbl 1179.03059]
Aehlig, Klaus; Beckmann, Arnold, Propositional logic for circuit classes, 512-526 [Zbl 1179.03035]
Hertel, Alexander; Urquhart, Alasdair, Game characterizations and the PSPACE-completeness of tree resolution space, 527-541 [Zbl 1179.03060]
Goubault-Larrecq, Jean, Continuous previsions, 542-557 [Zbl 1179.68074]
Murawski, Andrzej S., Bad variables under control, 558-572 [Zbl 1179.68020]
McCusker, Guy; Pym, David, A games model of bunched implications, 573-588 [Zbl 1179.03024]
Grohe, Martin; Hyland, Martin; Makowsky, Johann A.; Niwinski, Damian, The Ackermann Award 2007, 589-597 [Zbl 1177.03006]