72 citations · 342 across the 22 of their papers we have counts for
Showing 2002Show all
3 papers · 1 filter
math.LO2002★ 30 cited
Hilbert's "Verunglueckter Beweis," the first epsilon theorem, and consistency proofs
Richard Zach
In the 1920s, Ackermann and von Neumann, in pursuit of Hilbert's Programme, were working on consistency proofs for arithmetical systems. One proposed method of giving such proofs i…
math.LO2002★ 5 cited
Approximating Propositional Calculi by Finite-valued Logics
Matthias Baaz, Richard Zach
Bernays introduced a method for proving underivability results in propositional calculi by truth tables. In general, this motivates an investigations of how to find, given a propos…
math.LO2002★ 7 cited
Decidability of quantified propositional intuitionistic logic and S4 on trees
Richard Zach
Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kr…