Peter Clote, Helmut Schwichtenberg
Proceedings of the 14th EACSL Annual Conference on Computer Science Logic
CSL, 2000.

@proceedings{CSL-2000,
	address       = "Fischbachau, Germany",
	editor        = "Peter Clote and Helmut Schwichtenberg",
	isbn          = "3-540-67895-6",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 14th EACSL Annual Conference on Computer Science Logic}",
	volume        = 1862,
	year          = 2000,
}

Contents (36 items)

9 ×#logic
4 ×#complexity
4 ×#on the
2 ×#bound
2 ×#dependent type
2 ×#fixpoint
2 ×#game studies
2 ×#graph
2 ×#linear
2 ×#proving

CSL-2000-BlassG

Background, Reserve, and Gandy Machines (AB, YG), pp. 1–17.

CSL-2000-BlassG00a #polynomial

Choiceless Polynomial Time Computation and the Zero-One Law (AB, YG), pp. 18–40.

CSL-2000-BorgerS #composition #concept

Composition and Submachine Concepts for Sequential ASMs (EB, JS), pp. 41–60.

CSL-2000-Poizat #french

Une tentative malheureuse do construire une structure éliminant rapidement les quanteurs (BP), pp. 61–70.

CSL-2000-Schulte #state machine

Translating Theory into Practice — Abstract State Machines within Microsoft (WS), p. 71.

CSL-2000-Shelah #logic

Choiceless Polynominal Time Logic: Inability to Express (SS), pp. 72–125.

CSL-2000-Stirling #revisited

Schema Revisited (CS), pp. 126–138.

CSL-2000-Vardi #automation #automaton #graph #logic #verification

Automated Verification = Graphs, Automata, and Logic (MYV), p. 139.

CSL-2000-AbramskyL #ml #polymorphism

A Fully Complete PER Model for ML Polymorphic Types (SA, ML), pp. 140–155.

CSL-2000-Aspinall #type system

Subtyping with Power Types (DA), pp. 156–171.

CSL-2000-Atserias #bound #complexity #fixpoint

The Descriptive Complexity of the Fixed-Points of Bounded Formulas (AA), pp. 172–186.

CSL-2000-BaazZ #fuzzy #logic #proving

Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic (MB, RZ), pp. 187–201.

CSL-2000-BauerB #dependent type

Continuous Functionals of Dependent Types and Equilogical Spaces (AB, LB), pp. 202–216.

CSL-2000-BenediktK #constraints #linear

Definability over Linear Constraints (MB, HJK), pp. 217–231.

CSL-2000-Blumensath #bound #complexity

Bounded Arithmetic and Descriptive Complexity (AB), pp. 232–246.

CSL-2000-Bradfield #concurrent #independence #logic #named

Independence: Logics and Concurrency (JCB), pp. 247–261.

CSL-2000-ComonC

Flatness Is Not a Weakness (HC, VC), pp. 262–276.

CSL-2000-CoquandZ

Sequents, Frames, and Completeness (TC, GQZ), pp. 277–291.

CSL-2000-DanosK

Disjunctive Tautologies as Synchronisation Schemes (VD, JLK), pp. 292–301.

CSL-2000-Esik #axiom #fixpoint

Axiomatizing the Least Fixed Point Operation and Binary Supremum (ZÉ), pp. 302–316.

CSL-2000-HancockS #dependent type #interactive #source code #type system

Interactive Programs in Dependent Type Theory (PH, AS), pp. 317–331.

CSL-2000-Hemaspaandra #linear #satisfiability

Modal Satisfiability Is in Deterministic Linear Space (EH), pp. 332–342.

CSL-2000-Jaume #induction #logic programming

Logic Programming and Co-inductive Definitions (MJ), pp. 343–355.

CSL-2000-KahleS #formal method

A Theory of Explicit Mathematics Equivalent to ID1 (RK, TS), pp. 356–370.

CSL-2000-Kuznets #complexity #logic #on the

On the Complexity of Explicit Modal Logics (RK), pp. 371–383.

CSL-2000-Laird #finite #modelling

Finite Models and Full Completeness (JL), pp. 384–398.

CSL-2000-MakowskyM #combinator #complexity #generative #graph #on the

On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale (JAM, KM), pp. 399–410.

CSL-2000-Momigliano #framework #logic

Elimination of Negation in a Logical Framework (AM), pp. 411–426.

CSL-2000-MurawskiO #game studies #logic

Discreet Games, Light Affine Logic and PTIME Computation (ASM, CHLO), pp. 427–441.

CSL-2000-Naijun #calculus #higher-order

Completeness of Higher-Order Duration Calculus (ZN), pp. 442–456.

CSL-2000-OhsakiMG #equation #semantics #termination

Equational Termination by Semantic Labelling (HO, AM, JG), pp. 457–471.

CSL-2000-Parigot #on the

On the Computational Interpretation of Negation (MP), pp. 472–484.

CSL-2000-Pauly #bisimulation #game studies #safety #source code

From Programs to Games: Invariance and Safety for Bisimulation (MP), pp. 485–496.

CSL-2000-PowerR #abstraction #logic

Logical Relations and Data Abstraction (JP, ER), pp. 497–511.

CSL-2000-Schuster #analysis

Elementary Choiceless Constructive Analysis (PS), pp. 512–526.

CSL-2000-Yavorsky #logic #on the #proving #standard

On the Logic of the Standard Proof Predicate (REY), pp. 527–541.