Trees and diagrams of decomposition

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1985 English Publisher:Springer Science and Business Media LLCJournal:Studia Logica, volume 44, pages 139-158 (issn: 0039-3215, eissn: 1572-8730,

Copyright policy )

Authors: Anita Wasilewska;

doi: 10.1007/bf00379763

Trees and diagrams of decomposition

- Summary
- Subjects
- Metrics

Abstract

A general schema is presented for transformation of and/or proof search trees (in systems with the strong subformula property ensuring termination of the search process) into and-trees. The schema is then generalised to contraction-like rules when a bound of the number of applications in one branch is given. No applications to particular systems are presented.

Related Organizations

Lafayette College
United States

Keywords

Classical propositional logic, contraction-like rules, strong subformula property, and-trees, General logic, transformation of and/or proof search trees

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average