Proof schemata in Hilbert-type axiomatic theories

DOI10.1007/BF01098278zbMath0724.03009OpenAlexW2036349213MaRDI QIDQ2276941

V. P. Orevkov

Publication date: 1991

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

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

zbMATH Keywords

Hilbert-type theoriesproof schemes

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of proofs (03F20)

Related Items

Refinement of bounds of the height of terms in the most general unifier, A Decidable Class of Nested Iterated Schemata, A Tableaux-Based Decision Procedure for Multi-parameter Propositional Schemata, Bounded arithmetic, proof complexity and two papers of Parikh

Cites Work

• The number of proof lines and the size of proofs in first order logic
• Linear unification
• A Machine-Oriented Logic Based on the Resolution Principle
• Some Results on the Length of Proofs
• Unnamed Item
• Unnamed Item
• Unnamed Item