## Abstract Connections between partially ordered connectives and Henkin quantifiers are considered. It is proved that the logic with all partially ordered connectives and the logic with all Henkin quantifiers coincide. This implies that the hierarchy of partially ordered connectives is strongly hi
On the concept of formalization and partially ordered quantifiers
✍ Scribed by Bengt-Olof Qvarnström
- Publisher
- Springer Netherlands
- Year
- 1977
- Tongue
- English
- Weight
- 833 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0165-0157
No coin nor oath required. For personal study only.
✦ Synopsis
ON THE CONCEPT OF FORMALIZATION AND PARTIALLY ORDERED QUANTIFIERS.* * I would like to thank an anonymous referee for very useful comments on an earlier version of this paper and Krister Segerberg, Erik Stenius and in particular Risto Hilpinen and Patrick Sibelius for discussing the topic of this paper with me. I am also grateful to Russel Ultan for his help in improving my English.
Linguistics and Philosophy 1 (1977) 307-319. All Rights Reserved.
📜 SIMILAR VOLUMES
Nondeterministic exponential time complexity bounds are established for recognizing true propositional formulas with partially ordered quantiÿers on propositional variables.