Restriction of term complexity in derivations and decidable fragments of predicate calculus

DOI10.1007/BF01103259MaRDI QIDQ1102933zbMATH OpenFDO

Authors Nail Zamov

Publication date 1988

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01103259

zbMATH Keywords

resolution

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)

Review text

Translation from Issled. Prikl. Mat. 2, 56-62 (Russian) (1974; Zbl 0357.02011).

Cited in

(1)

• Decidability of the restriction equational theory in the partial lambda calculus

This page was built for publication: Restriction of term complexity in derivations and decidable fragments of predicate calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102933)