Book contents
- Frontmatter
- Preface
- Opening speech of Petr Vopěnka
- Bolzano Medal awarded to Gaisi Takeuti
- Contents
- Collapsing Polynomial-Time Degrees
- Qualitative and Probabilistic Models of Full Belief
- Relative Splittings of in the-Enumeration Degrees
- A Realizability Interpretation for Classical Arithmetic
- An Axiomatization of Quantified Propositional Gödel Logic Using the Takeuti-Titani Rule
- Another Pathological Well-Ordering
- How Small Can the Set of Generics Be?
- Entailment Relations and Distributive Lattices
- The Friedberg Jump Inversion Theorem Revisited: A Study of Undefinable Cuts
- Hartley Rogers’ 1965 Agenda
- Liftings of Homomorphisms Between Quotient Structures and Ulam Stability
- Mathematical Fuzzy Logic – State of Art
- Reflections on the Last Delfino Problem
- Continuous Images of Coanalytic Sets
- Classification of Subsheaves over GL-Algebras
- On the Bit-Comprehension Rule
- Cardinal Invariants Associated with Predictors
- A Theorem on Countable Ordered Sets with an Application to Universal Graphs
- Dimension Theory and Smooth Stratification of Rigid Subanalytic Sets
- The Ramsey Structure of A-Determined Sets in a Saturated Universe
- On Definability of Admissible Sets
- Additive Theories
- Adding Multiplication to an O-minimal Expansion of the Additive Group of Real Numbers
- The Superjump in Martin-Löf Type Theory
- “Just Because”: Taking Belief Bases Seriously
- Artin Approximation via the Model Theory of Cohen-Macaulay Rings
- Ordinal Systems, Part 2: One Inaccessible
- Autonomous Fixed Point Progressions and Fixed Point Transfinite Recursion
- Finitary Reductions for Local Predicativity, I: Recursively Regular Ordinals
- The Complexity of Linear Logic with Weakening
- Some Remarks on the Maximality of Inner Models
- Author Index
- References
The Complexity of Linear Logic with Weakening
Published online by Cambridge University Press: 31 March 2017
Book contents
- Frontmatter
- Preface
- Opening speech of Petr Vopěnka
- Bolzano Medal awarded to Gaisi Takeuti
- Contents
- Collapsing Polynomial-Time Degrees
- Qualitative and Probabilistic Models of Full Belief
- Relative Splittings of in the-Enumeration Degrees
- A Realizability Interpretation for Classical Arithmetic
- An Axiomatization of Quantified Propositional Gödel Logic Using the Takeuti-Titani Rule
- Another Pathological Well-Ordering
- How Small Can the Set of Generics Be?
- Entailment Relations and Distributive Lattices
- The Friedberg Jump Inversion Theorem Revisited: A Study of Undefinable Cuts
- Hartley Rogers’ 1965 Agenda
- Liftings of Homomorphisms Between Quotient Structures and Ulam Stability
- Mathematical Fuzzy Logic – State of Art
- Reflections on the Last Delfino Problem
- Continuous Images of Coanalytic Sets
- Classification of Subsheaves over GL-Algebras
- On the Bit-Comprehension Rule
- Cardinal Invariants Associated with Predictors
- A Theorem on Countable Ordered Sets with an Application to Universal Graphs
- Dimension Theory and Smooth Stratification of Rigid Subanalytic Sets
- The Ramsey Structure of A-Determined Sets in a Saturated Universe
- On Definability of Admissible Sets
- Additive Theories
- Adding Multiplication to an O-minimal Expansion of the Additive Group of Real Numbers
- The Superjump in Martin-Löf Type Theory
- “Just Because”: Taking Belief Bases Seriously
- Artin Approximation via the Model Theory of Cohen-Macaulay Rings
- Ordinal Systems, Part 2: One Inaccessible
- Autonomous Fixed Point Progressions and Fixed Point Transfinite Recursion
- Finitary Reductions for Local Predicativity, I: Recursively Regular Ordinals
- The Complexity of Linear Logic with Weakening
- Some Remarks on the Maximality of Inner Models
- Author Index
- References
- Type
- Chapter
- Information
- Logic Colloquium '98 , pp. 500 - 515Publisher: Cambridge University PressPrint publication year: 2000
References
1. , Jr. Entailment: The Logic of Relevance and Necessity, Vol. 1. Princeton University Press, New Jersey, 1975.
2. , ,: Ideals, Varieties, and Algorithms. Springer Verlag, 1992.
3. : Counter machines and counter languages. Mathematical Systems Theory 2 (1968), 265-283.Google Scholar
4. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, Reading, Massachusetts, 1979.
5. : Decidability of linear affine logic. In Proceedings of the 10th annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1995.
6. ,: The finite model property for various fragments of linear logic. Journal of Symbolic Logic, 62 (1997), 1202–1208.Google Scholar
7. , ,,: Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56 (1992), 239–311.Google Scholar
9. , The complexity of theword problems for commutative semigroups and polynomial ideals. Advances in Mathematics 46 (1982), 305-329.Google Scholar
10. : The covering and boundedness problems for vector addition systems. Theoretical Computer Science, 6 (1978), 223–231.Google Scholar
11. : Lectures on Linear Logic. CSLI, Menlo Park, California, 1992.
12. : The complexity of decision procedures in relevance logic. In Truth or Consequences: Essays in honour of Nuel Belnap, ed. Dunn and Gupta, 61-76. Kluwer, Dordrecht, 1990.Google Scholar
13. ,: The complexity of decision procedures in relevance logics II. Forthcoming,Journal of Symbolic Logic.
14. : The Complexity of Boolean Functions. , Stuttgart; John Wiley and Sons, Chichester 1987.