Upper Bounds for Proof‐Search in a Sequent Calculus for Relational Equations

DOI10.1002/malq.19820281408zbMath0506.03001OpenAlexW2052267847MaRDI QIDQ4742764

Wolfgang Schönfeld

Publication date: 1982

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19820281408

zbMATH Keywords

proof systemformal proofupper bound for proof lengthautomated proof- searchcomplexity of formal proofs

Mathematics Subject Classification ID

Classical first-order logic (03B10) Cut-elimination and normal-form theorems (03F05) Complexity of proofs (03F20)

Related Items

Analysis of an experiment aimed at improving the reliability of transmission centre shafts, Survival ensembles by the sum of pairwise differences with application to lung cancer microarray studies, A nonparametric test for diagnosis of the proportionality assumption, A Completeness Result for Relation Algebra with Binders, Applying competing risks regression models: an overview, An efficient relational deductive system for propositional non-classical logics, Statistical analysis of zero-inflated nonnegative continuous data: a review, A sequent calculus for relation algebras