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

DOI10.1002/MALQ.19820281408zbMATH Open0506.03001OpenAlexW2052267847MaRDI QIDQ4742764FDOQ4742764

Authors: 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

formal proofproof systemupper bound for proof lengthautomated proof- searchcomplexity of formal proofs

Mathematics Subject Classification ID

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

Cited In (8)

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

This page was built for publication: Upper Bounds for Proof‐Search in a Sequent Calculus for Relational Equations

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