scientific article; zbMATH DE number 4039891
The problem arises to reconstruct a logical derivation from the scheme of this derivation. In arithmetic models with the only functional symbols 0 and ' (successor) and in which addition and multiplication are expressed by ternary predicates, the problem is solved. In this paper, the author solves the same problem, but in the case of arbitrary functional symbols. Logical derivations are formulated in various calculi (Hilbert's, Gentzen's or natural deduction). The main result seems to be contained in the last theorem, which asserts the possibility of constructing an algorithm which recognizes the k- derivability of formulas by a scheme of derivation predicate calculus with identity.
- Publication:3469081
- scientific article; zbMATH DE number 3954903
- A normal form for logical derivations implying one for arithmetic derivations
- Proof reconstruction in classical and nonclassical logics (Diss., TU Darmstadt, 1999)
- Ein Direkter Beweis für die Allgemein‐Rekursive Unlösbarkeit des Entscheidungsproblems des Prädikatenkalküls der Ersten Stufe mit Identität
- The undecidability of k-provability
- Bounded arithmetic, proof complexity and two papers of Parikh
- A unification-theoretic method for investigating the k-provability problem
- Proof schemata in Hilbert-type axiomatic theories
- scientific article; zbMATH DE number 4135909 (Why is no real title available?)
- Generalizing proofs in monadic languages (with a postscript by Georg Kreisel).
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3778747)