𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Compositionality, Relevance, and Peirce’s Logic of Existential Graphs

✍ Scribed by Ahti-Veikko Pietarinen

Publisher
Springer
Year
2005
Tongue
English
Weight
363 KB
Volume
15
Category
Article
ISSN
1122-1151

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Constructive Proof of a Theorem in Rel
A Constructive Proof of a Theorem in Relevance Logic
✍ Aleksandar Kron 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 461 KB 👁 1 views

In this paper we investigate a propositional systeni L related t o T,-W of relevance logic. It has been conjectured that for any formulas A and B

Existential closure of block intersectio
Existential closure of block intersection graphs of infinite designs having infinite block size
✍ Daniel Horsley; David A. Pike; Asiyeh Sanaei 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

A graph G is n-existentially closed (n-e.c.) if for each pair (A,B) of disjoint subsets of V(G) with |A|+|B|≤n there exists a vertex in V(G)\(A∪B) which is adjacent to each vertex in A and to no vertex in B. In this paper we study the n-existential closure property of block intersection graphs of in

Existential closure of block intersectio
Existential closure of block intersection graphs of infinite designs having finite block size and index
✍ David A. Pike; Asiyeh Sanaei 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

In this article we study the n-existential closure property of the block intersection graphs of infinite t-(v, k, k) designs for which the block size k and the index k are both finite. We show that such block intersection graphs are 2-e.c. when 2 ≤ t ≤ k-1. When k = 1 and 2 ≤ t ≤ k, then a necessary