Abstract
We introduce here and investigate the notion of an alternative tree of decomposition. We show (Theorem 5) a general method of finding out all non-alternative trees of the alternative tree determined by a diagram of decomposition.
Similar content being viewed by others
References
G, Gentzen, Untersuchungen über das logische Schliessen, Mathematische Zeitschrift, Vol. 39 (1934–34).
S. Kanger, Provability in logic, Acta Universitatis Stocholmiensis, Stockholm, Studies in Philosophy 1 (1957) pp. 1–47.
A. Michaels, A uniform procedure for SCI tautologies, Studia Logica (1971).
G. Mirkowska, Algorithmic logic and its applications in the theory of programs II, Fundamenta Informaticae Vol. I, 2 (1977), pp. 147–165.
G. Mirkowska, Algorithmic logic with nondeterministic programs, Fundamenta Informaticae 111.1 (1980), pp. 45–64.
H. Rasiowa and R. Sikorski, On Gentzen theorem, Fundamenta Mathematicae 48 (1960), pp. 57–69.
H. Rasiowa and R. Sikorski, Mathematics of Metamathematics, PWN, Warsaw 1964.
Z. Saloni, Gentzen rules for m-valued logic, Bulletin de l'Académie Polonaise des Sciences, No. 10 (1972).
K. Schütte, Schlussweisenkalküle der Prädikaterlogik, Mathematische Annalen 122 (1950–51), pp. 46–65.
H. C. M. de Swart, A Gentzen-or Beth-type System, a practical decision procedure and a constructive completeness proof for the counterfactual logic VS and VCS, The Journal of Symbolic Logic, Vol. 84 (1983), pp. 1–20.
M. C. M. de. Swart, Gentzen type system for C, K and several extentions of C and K, Logique et Analyse, 90–91 (1980), pp. 263–284.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wasilewska, A. Trees and diagrams of decomposition. Stud Logica 44, 139–158 (1985). https://doi.org/10.1007/BF00379763
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00379763