Grigoriy V. Bokov
Published 2015-04-22Version 1
In this paper, we consider iterative propositional calculi, which are finite sets of propositional formulas together with the rules of modus ponens and weak substitution (when formula being substituted must be already inferred). We construct an undecidable iterative propositional calculus using axioms in 3 variables. Particulary, we show that the general problem of derivability for these calculi is undecidable.
Comments: 10 pages, in Russian
On topological properties of ultraproducts of finite sets
On uniform definability of types over finite sets
Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination
![QR code for arXiv:1504.05728 [math.LO]](http://oss.arxitics.com/images/favicon.svg)