The SCEAS System
Navigation Menu

Conferences in DBLP

Conference for Computer Science Logic (CSL) (csl)
2000 (conf/csl/2000)

  1. Andreas Blass, Yuri Gurevich
    Background, Reserve, and Gandy Machines. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:1-17 [Conf]
  2. Andreas Blass, Yuri Gurevich
    Choiceless Polynominal Time Computation and the Zero-One Law. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:18-40 [Conf]
  3. Egon Börger, Joachim Schmid
    Composition and Submachine Concepts for Sequential ASMs. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:41-60 [Conf]
  4. Bruno Poizat
    Une tentative malheureuse do construire une structure éliminant rapidement les quanteurs. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:61-70 [Conf]
  5. Wolfram Schulte
    Translating Theory into Practice - Abstract State Machines within Microsoft. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:71- [Conf]
  6. Saharon Shelah
    Choiceless Polynominal Time Logic: Inability to Express. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:72-125 [Conf]
  7. Colin Stirling
    Schema Revisited. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:126-138 [Conf]
  8. Moshe Y. Vardi
    Automated Verification = Graphs, Automata, and Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:139- [Conf]
  9. Samson Abramsky, Marina Lenisa
    A Fully Complete PER Model for ML Polymorphic Types. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:140-155 [Conf]
  10. David Aspinall
    Subtyping with Power Types. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:156-171 [Conf]
  11. Albert Atserias
    The Descriptive Comlexity of the Fixed-Points of Bounded Formulas. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:172-186 [Conf]
  12. Matthias Baaz, Richard Zach
    Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:187-201 [Conf]
  13. Andrej Bauer, Lars Birkedal
    Continuous Functionals of Dependent Types and Equilogical Spaces. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:202-216 [Conf]
  14. Michael Benedikt, H. Jerome Keisler
    Definability over Linear Constraints. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:217-231 [Conf]
  15. Achim Blumensath
    Bounded Arithmetic and Descriptive Complexity. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:232-246 [Conf]
  16. Julian C. Bradfield
    Independence: Logics and Concurrency. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:247-261 [Conf]
  17. Hubert Comon, Véronique Cortier
    Flatness Is Not a Weakness. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:262-276 [Conf]
  18. Thierry Coquand, Guo-Qiang Zhang
    Sequents, Frames, and Completeness. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:277-291 [Conf]
  19. Vincent Danos, Jean-Louis Krivine
    Disjunctive Tautologies as Synchronisation Schemes. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:292-301 [Conf]
  20. Zoltán Ésik
    Axiomatizing the Least Fixed Point Operation and Binary Supremum. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:302-316 [Conf]
  21. Peter Hancock, Anton Setzer
    Interactive Programs in Dependent Type Theory. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:317-331 [Conf]
  22. Edith Hemaspaandra
    Modal Satisfiability Is in Deterministic Linear Space. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:332-342 [Conf]
  23. Mathieu Jaume
    Logic Programming and Co-inductive Definitions. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:343-355 [Conf]
  24. Reinhard Kahle, Thomas Studer
    A Theory of Explicit Mathematics Equivalent to ID1. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:356-370 [Conf]
  25. Roman Kuznets
    On the Complexity of Explicit Modal Logics. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:371-383 [Conf]
  26. James Laird
    Finite Models and Full Completeness. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:384-398 [Conf]
  27. Johann A. Makowsky, Klaus Meer
    On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:399-410 [Conf]
  28. Alberto Momigliano
    Elimination of Negation in a Logical Framework. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:411-426 [Conf]
  29. Andrzej S. Murawski, C.-H. Luke Ong
    Discreet Games, Light Affine Logic and PTIME Computation. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:427-441 [Conf]
  30. Zhan Naijun
    Completeness of Higher-Order Duration Calculus. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:442-456 [Conf]
  31. Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl
    Equational Termination by Semantic Labelling. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:457-471 [Conf]
  32. Michel Parigot
    On the Computational Interpretation of Negation. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:472-484 [Conf]
  33. Marc Pauly
    From Programs to Games: Invariance and Safety for Bisimulation. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:485-496 [Conf]
  34. John Power, Edmund Robinson
    Logical Relations and Data Abstraction. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:497-511 [Conf]
  35. Peter Schuster
    Elementary Choiceless Constructive Analysis. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:512-526 [Conf]
  36. Rostislav E. Yavorsky
    On the Logic of the Standard Proof Predicate. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:527-541 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002