default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th CSL 2000: Fischbachau, Germany
- Peter Clote, Helmut Schwichtenberg:
Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings. Lecture Notes in Computer Science 1862, Springer 2000, ISBN 3-540-67895-6
Invited Papers
- Andreas Blass, Yuri Gurevich:
Background, Reserve, and Gandy Machines. 1-17 - Andreas Blass, Yuri Gurevich:
Choiceless Polynominal Time Computation and the Zero-One Law. 18-40 - Egon Börger, Joachim Schmid:
Composition and Submachine Concepts for Sequential ASMs. 41-60 - Bruno Poizat:
Une tentative malheureuse do construire une structure éliminant rapidement les quanteurs. 61-70 - Wolfram Schulte:
Translating Theory into Practice - Abstract State Machines within Microsoft. 71 - Saharon Shelah:
Choiceless Polynominal Time Logic: Inability to Express. 72-125 - Colin Stirling:
Schema Revisited. 126-138 - Moshe Y. Vardi:
Automated Verification = Graphs, Automata, and Logic. 139
Contributed Papers
- Samson Abramsky
, Marina Lenisa:
A Fully Complete PER Model for ML Polymorphic Types. 140-155 - David Aspinall:
Subtyping with Power Types. 156-171 - Albert Atserias:
The Descriptive Comlexity of the Fixed-Points of Bounded Formulas. 172-186 - Matthias Baaz, Richard Zach:
Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic. 187-201 - Andrej Bauer, Lars Birkedal:
Continuous Functionals of Dependent Types and Equilogical Spaces. 202-216 - Michael Benedikt, H. Jerome Keisler:
Definability over Linear Constraints. 217-231 - Achim Blumensath:
Bounded Arithmetic and Descriptive Complexity. 232-246 - Julian C. Bradfield:
Independence: Logics and Concurrency. 247-261 - Hubert Comon, Véronique Cortier:
Flatness Is Not a Weakness. 262-276 - Thierry Coquand, Guo-Qiang Zhang:
Sequents, Frames, and Completeness. 277-291 - Vincent Danos, Jean-Louis Krivine:
Disjunctive Tautologies as Synchronisation Schemes. 292-301 - Zoltán Ésik:
Axiomatizing the Least Fixed Point Operation and Binary Supremum. 302-316 - Peter G. Hancock, Anton Setzer:
Interactive Programs in Dependent Type Theory. 317-331 - Edith Hemaspaandra:
Modal Satisfiability Is in Deterministic Linear Space. 332-342 - Mathieu Jaume:
Logic Programming and Co-inductive Definitions. 343-355 - Reinhard Kahle, Thomas Studer:
A Theory of Explicit Mathematics Equivalent to ID1. 356-370 - Roman Kuznets:
On the Complexity of Explicit Modal Logics. 371-383 - James Laird:
Finite Models and Full Completeness. 384-398 - 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. 399-410 - Alberto Momigliano:
Elimination of Negation in a Logical Framework. 411-426 - Andrzej S. Murawski, C.-H. Luke Ong:
Discreet Games, Light Affine Logic and PTIME Computation. 427-441 - Naijun Zhan:
Completeness of Higher-Order Duration Calculus. 442-456 - Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl:
Equational Termination by Semantic Labelling. 457-471 - Michel Parigot:
On the Computational Interpretation of Negation. 472-484 - Marc Pauly:
From Programs to Games: Invariance and Safety for Bisimulation. 485-496 - John Power, Edmund Robinson:
Logical Relations and Data Abstraction. 497-511 - Peter M. Schuster:
Elementary Choiceless Constructive Analysis. 512-526 - Rostislav E. Yavorsky:
On the Logic of the Standard Proof Predicate. 527-541
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
