摘要: Single Step Tableaux (SST) are the basis of a calculus for modal logics that combines different features sequent and prefixed tableaux into simple, modular, strongly analytic, effective wide range logics. The paper presents number computational results about SST (confluence, decidability, space complexity, modularity, etc.) compares with other formalisms such as translation methods, resolution, Gentzen-type tableaux. For instance, it discusses feasibility infeasibility deriving decision procedures translation-based methods by replacing loop checking techniques simpler termination checks. The complexity searching validity logical consequence is discussed. Minimal conditions on search strategies proven to yield Pspace (and NPtime S5 KD45) procedures. The also methodology underlying construction correctness completeness proofs.