𝔖 Bobbio Scriptorium
✦   LIBER   ✦

PARTIALLY ORDERED CONNECTIVES

✍ Scribed by Gabriel Sandu; Jouko Väänänen

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
527 KB
Volume
38
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We show that a coherent theory of partially ordered connectives can be developed along the same line as partially ordered quantification. We estimate the expressive power of various partially ordered connectives and use methods like Ehrenfeucht games and infinitary logic to get various undefinability results.

📜 SIMILAR VOLUMES

Hierarchies of Partially Ordered Connect
Hierarchies of Partially Ordered Connectives and Quantifiers
✍ Michał Krynicki 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB

## 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

Finite Partially-Ordered Quantifiers
Finite Partially-Ordered Quantifiers
✍ Herbert B. Enderton 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB

This is to be read "For every x there is a y and for every u there is a v (depending only on u) such that y ( x , y, u , w) ." The precise meaning of this can be given in terms of SKOLEM functions; the above formula is semantically equivalent to the second-order formula Such partially-ordered quant

Graphical partially ordered sets
Graphical partially ordered sets
✍ L. Borzacchini 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 708 KB

In this paper we study graphical partially ordered sets (GPO-sets) and their properties. Principal applicatibns of the theory of GPO-sets concern graphs, diagraphs, hypergraphs, etc. In a later section we study the generalization of reconstruction properties to GPO-sets.