You have Guest access.
Log In
Peter G. Clote and Helmut Schwichtenberg
Front matter
1-17
Background, Reserve, and Gandy Machines
18-40
Choiceless Polynomial Time Computation and the Zero-One Law
41-60
Composition and Submachine Concepts for Sequential ASMs
61-70
Une tentative malheureuse de construire une structure éliminant rapidement les quanteurs
71
Translating Theory into Practice — Abstract State Machines within Microsoft
72-125
Choiceless Polynomial Time Logic: Inability to Express
126-138
Schema Revisited
139
Automated Verification = Graphs, Automata, and Logic
140-155
A Fully Complete PER Model for ML Polymorphic Types
156-171
Subtyping with Power Types
172-186
The Descriptive Complexity of the Fixed-Points of Bounded Formulas
187-201
Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic
202-216
Continuous Functionals of Dependent Types and Equilogical Spaces
217-231
Definability over Linear Constraints
232-246
Bounded Arithmetic and Descriptive Complexity
247-261
Independence: Logics and Concurrency
262-276
Flatness Is Not a Weakness
277-291
Sequents, Frames, and Completeness
292-301
Disjunctive Tautologies as Synchronisation Schemes
302-316
Axiomatizing the Least Fixed Point Operation and Binary Supremum
317-331
Interactive Programs in Dependent Type Theory
332-342
Modal Satisfiability Is in Deterministic Linear Space
343-355
Logic Programming and Co-inductive Definitions
356-370
A Theory of Explicit Mathematics Equivalent to ID 1
371-383
On the Complexity of Explicit Modal Logics
384-398
Finite Models and Full Completeness
399-410
On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale
411-426
Elimination of Negation in a Logical Framework
427-441
Discreet Games, Light Affine Logic and PTIME Computation
442-456
Completeness of Higher-Order Duration Calculus
457-471
Equational Termination by Semantic Labelling
472-484
On the Computational Interpretation of Negation
485-496
From Programs to Games: Invariance and Safety for Bisimulation
497-511
Logical Relations and Data Abstraction
512-526
Elementary Choiceless Constructive Analysis
527-541
On the Logic of the Standard Proof Predicate
Back matter
Andreas Blass and Yuri Gurevich
Egon Börger and Joachim Schmid
Bruno Poizat
Wolfram Schulte
Saharon Shelah
Colin Stirling
Moshe Y. Vardi
Samson Abramsky and Marina Lenisa
David Aspinall
Albert Atserias
Matthias Baaz and Richard Zach
Andrej Bauer and Lars Birkedal
Michael Benedikt and H. Jerome Keisler
Achim Blumensath
J. C. Bradfield
Hubert Comon and Vèronique Cortier
Thierry Coquand and Guo-Qiang Zhang
Vincent Danos and Jean-Louis Krivine
Zoltán Ésik
Peter Hancock and Anton Setzer
Edith Hemaspaandra
Mathieu Jaume
Reinhard Kahle and Thomas Studer
Roman Kuznets
J. Laird
J. A. Makowsky and K. Meer
Alberto Momigliano
A. S. Murawski and C.-H. L. Ong
Zhan Naijun
Hitoshi Ohsaki, Aart Middeldorp and Jürgen Giesl
Michel Parigot
Marc Pauly
John Power and Edmund Robinson
Peter M. Schuster
Rostislav E. Yavorsky
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info