Generalizing proofs in monadic languages (with a postscript by Georg Kreisel).

DOI10.1016/J.APAL.2007.10.010zbMath1153.03040OpenAlexW2030319866MaRDI QIDQ930260

Piotr Wojtylak, Matthias Baaz

Publication date: 23 June 2008

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2007.10.010

zbMATH Keywords

monadic languageproof complexitygeneralization of proofsmodification of Kreisel's conjecturepartial proof datauniform derivability of a proof schema

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Structure of proofs (03F07) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (3)

Proof generalization in \(\mathrm {LK}\) by second order unifier minimization ⋮ Note on the Benefit of Proof Representations by Name ⋮ Herbrand's theorem and term induction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
• The number of proof lines and the size of proofs in first order logic
• A unification algorithm for second-order monadic terms
• On the number of steps in proofs
• The undecidability of the second-order unification problem
• The undecidability of \(k\)-provability
• A theorem on generalizations of proofs
• Some applications of formalized consistency proofs
• Arithmetic on curves
• Sets of theorems with short proofs
• One hundred and two problems in mathematical logic
• On Gödel's theorems on lengths of proofs I: Number of lines and speedup for arithmetics
• Recursive Functions of One Variable
• Some Results on the Length of Proofs
• Foundations of mathematics for the working mathematician
• Proof theory

This page was built for publication: Generalizing proofs in monadic languages (with a postscript by Georg Kreisel).