On a “proof” of non-synonymy
✍ Scribed by Robert J. Richman
- Publisher
- Springer Netherlands
- Year
- 1957
- Tongue
- English
- Weight
- 152 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0031-8116
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In his program-stating paper 'On the Construction of Machine Language for an Information Machine', the Soviet pioneer of information science, V. A. Uspenski [9], has specified some requirements that should be met by the information language to be used in any computerized information system. One of t
We show that an LK proof of size m of a monotone sequent (a sequent that contains only formulas in the basis 4; 3) can be turned into a proof containing only monotone formulas of size m Oðlog mÞ and with the number of proof lines polynomial in m: Also we show that some interesting special cases, nam