LFCS 2007: New York, NY, USA

• Evangelia Antonakos:
  Justified and Common Knowledge: Limited Conservativity. 1-11
  
• Sergei N. Artëmov, Eduardo Bonelli:
  The Intensional Lambda Calculus. 12-25
  
• Arnon Avron, Anna Zamansky:
  Generalized Non-deterministic Matrices and (n, k)-ary Quantifiers. 26-40
  
• Howard A. Blair, David W. Jakel, Robert J. Irwin, Angel Rivera:
  Elementary Differential Calculus on Discrete and Hybrid Structures. 41-53
  
• Benedikt Bollig, Ingmar Meinecke:
  Weighted Distributed Systems and Their Logics. 54-68
  
• Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier:
  Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! 69-83
  
• Davide Bresolin, Valentin Goranko, Angelo Montanari, Guido Sciavicco:
  On Decidability and Expressiveness of Propositional Interval Neighborhood Logics. 84-99
  
• Rémi Brochenin, Stéphane Demri, Étienne Lozes:
  Reasoning About Sequences of Memory States. 100-114
  
• Guillaume Burel, Claude Kirchner:
  Cut Elimination in Deduction Modulo by Abstract Completion. 115-131
  
• Agata Ciabattoni, George Metcalfe:
  Density Elimination and Rational Completeness for First-Order Logics. 132-146
  
• Robert L. Constable, Wojciech Moczydlowski:
  Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus. 147-161
  
• Jennifer M. Davoren:
  Topological Semantics and Bisimulations for Intuitionistic Modal Logics and Their Classical Companion Logics. 162-179
  
• Stéphane Demri, Deepak D'Souza, Régis Gascon:
  A Decidable Temporal Logic of Repeating Values. 180-194
  
• Kai Engelhardt, Peter Gammie, Ron van der Meyden:
  Model Checking Knowledge and Linear Time: PSPACE Cases. 195-211
  
• Melvin Fitting:
  Realizations and LP. 212-223
  
• Raffaella Gentilini, Klaus Schneider, B. Mishra:
  Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking. 224-240
  
• Evan Goris:
  Explicit Proofs in Formal Provability Logic. 241-253
  
• Srikanth Gottipati, Anil Nerode:
  A Synthesis Algorithm for Hybrid Systems. 254-268
  
• Bernhard Heinemann:
  Including the Past in 'Topologic'. 269-283
  
• Max I. Kanovich:
  A Note on Rewriting Proofs and Fibonacci Numbers. 284-292
  
• Bakhadyr Khoussainov, Jiamou Liu:
  On Complexity of Ehrenfeucht-Fraïssé Games. 293-309
  
• Bjørn Kjos-Hanssen, Anil Nerode:
  The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion. 310-317
  
• Hidenori Kurokawa:
  Hypersequent Calculus for Intuitionistic Logic with Classical Atoms. 318-331
  
• Roman Kuznets:
  Proof Identity for Classical Logic: Generalizing to Normality. 332-348
  
• Robert S. Lubarsky, Michael Rathjen:
  On the Constructive Dedekind Reals: Extended Abstract. 349-362
  
• Zohar Manna, Henny B. Sipma, Ting Zhang:
  Verifying Balanced Trees. 363-378
  
• Victor W. Marek, Jeffrey B. Remmel:
  Compactness Properties for Stable Semantics of Logic Programs. 379-400
  
• Virgile Mogbil, Vincent Rahli:
  Uniform Circuits, & Boolean Proof Nets. 401-421
  
• André Nies, Pavel Semukhin:
  Finite Automata Presentable Abelian Groups. 422-436
  
• Michael O'Connor:
  Embeddings into Free Heyting Algebras and Translations into Intuitionistic Propositional Logic. 437-448
  
• Rohit Parikh:
  Some Puzzles About Probability and Probabilistic Conditionals. 449-456
  
• André Platzer:
  A Temporal Dynamic Logic for Verifying Hybrid System Invariants. 457-471
  
• Brian F. Redmond:
  Multiplexor Categories and Models of Soft Linear Logic. 472-485
  
• Vladimir V. Rybakov:
  Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms. 486-497
  
• David Steiner, Thomas Studer:
  Total Public Announcements. 498-511
  

Last update Sun May 26 02:42:49 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page