Hypersequents, logical consequence and intermediate logics for concurrency

  • Arnon Avron


The existence of simple semantics and appropriate cut-free Gentzen-type formulations are fundamental intrinsic criteria for the usefulness of logics. In this paper we show that by using hypersequents (which are multisets of ordinary sequents) we can provide such Gentzen-type systems to many logics. In particular, by using a hypersequential generalization of intuitionistic sequents we can construct cut-free systems for some intermediate logics (including Dummett's LC) which have simple algebraic semantics that suffice, e.g., for decidability. We discuss the possible interpretations of these logics in terms of parallel computation and the role that the usual connectives play in them (which is sometimes different than in the sequential case).


Neural Network Artificial Intelligence Complex System Nonlinear Dynamics Parallel Computation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A.R. Anderson and N.P. Belnap,Entailment, vol. 1 (Princeton University Press, Princeton, NJ, 1975).Google Scholar
  2. [2]
    A. Avron, A constructive analysis of RM, J. Symbolic Logic 52 (1987) 939–951.Google Scholar
  3. [3]
    A. Avron, Natural 3-valued logic: foundations and proof theory, to appear in J. Symbolic Logic.Google Scholar
  4. [4]
    A. Avron, Simple consequence relations, to appear in Information and Computation.Google Scholar
  5. [5]
    A. Avron, The semantics and proof theory of linear logic, Theor. Comp. Sci. 57 (1988) 161–184.Google Scholar
  6. [6]
    A. Avron, Gentzen-type systems, resolution and tableaux, Technical Report 161/90, The Eskenasy Institute of Computer Science, Tel Aviv University, Tel Aviv, Israel.Google Scholar
  7. [7]
    A. Avron, On an implication connective of RM, Notre Dame J. Formal Logic 27 (1986) 201–209.Google Scholar
  8. [8]
    R.L. Constable et al.,Implementing Mathematics with the NuPRL Proof Development System (Prentice-Hall, Englewood Cliffs, NJ, 1986).Google Scholar
  9. [9]
    J.M. Dunn, Relevant logic and entailment, in:Handbook of Philosophical Logic, vol. 3, eds. D. Gabbay and F. Guenthner (Reidel, Dordrecht, Holland; Boston, USA, 1984).Google Scholar
  10. [10]
    M. Dummett, A propositional calculus with denumerable matrix, J. Symbolic Logic 24 (1959) 96–107.Google Scholar
  11. [11]
    J.M. Dunn and R.K. Mayer, Algebraic completeness results for Dummett's LC and its extensions, Z. math. Logik und Grundlagen der Mathematik 17 (1971) 225–230.Google Scholar
  12. [12]
    G. Gentzen, Investigations into logical deduction, in:The Collected Works of Gerhard Gentzen, ed. M.E. Szabo (North-Holland, Amsterdam, 1969).Google Scholar
  13. [13]
    J.Y. Girard, Linear logic, Theor. Comp. Sci. 50 (1987) 1–101.Google Scholar
  14. [14]
    K. Gödel, Zum intuitionistishen Aussagenkalküul, Ergeb. Math. Koll. 4 (1933) 34–38.Google Scholar
  15. [15]
    J.Y. Girard, Y. Lafont and P. Taylor,Proof and Types (Cambridge University Press, 1989).Google Scholar
  16. [16]
    G. Huet, Deduction and computation, in:Fundamentals of Artificial Intelligence, eds. W. Bibel and K. Jorrand, Lecture Notes in Computer Science (Springer, 1986).Google Scholar
  17. [17]
    R. Milner,Communication and Concurrency (Prentice-Hall, 1989).Google Scholar
  18. [18]
    B. Nordström, K. Peterson and J. Smith, Programming in Martin-Löf's type theory, preprint, University of Göteborg, Sweden (Midsummer 1988).Google Scholar
  19. [19]
    G. Pottinger, Uniform, cut-free formulations of T, S4 and S5, (abstract), J. Symbolic Logic 48 (1983) 900.Google Scholar
  20. [20]
    D. Prawitz,Natural Deduction — A Proof-theoretical Study (Almquist and Wiksell, Stockholm, 1965).Google Scholar
  21. [21]
    O. Sonobo, A. Gentzen-type formulation of some intermediate propositional logics, J. Tsuda College 7 (1975) 7–14.Google Scholar
  22. [22]
    A. Urquhart, Many-valued logic, in:Handbook of Philosophical Logic, vol. 3, eds. D. Gabbay and F. Guenthner (Reidel, Dordrecht, Holland; Boston, USA, 1984).Google Scholar
  23. [23]
    A. Visser, On the completeness principle: A study of provability in Heyting's arithmetic, Ann. Math. Logic 22 (1982) 263–295.Google Scholar
  24. [24]
    J. Zucker, The correspondence between cut-elimination and normalization, Ann. Math. Logic 7 (1974) 1–112.Google Scholar

Copyright information

© J.C. Baltzer A.G. Scientific Publishing Company 1991

Authors and Affiliations

  • Arnon Avron
    • 1
  1. 1.Department of Computer Science, Raymond and Beverly Sackler Faculty of Exact SciencesUniversity of Tel AvivTel AvivIsrael

Personalised recommendations