Maureen Donnelly’s (2016) relative positionalism correctly handles any fixed arity relation with any symmetry such a relation can have, yielding the intuitively correct way(s) in which that relation can apply. And it supplies an explanation of what is going on in the world that makes this the case. But it has at least one potential shortcoming — one that its opponents are likely to seize upon: it can only handle relations with fixed arities. It is unable to handle relations (...) with variable arities. I argue that, all else being equal, relative positionalism ought nonetheless to be preferred to its closest competitors — at least to the extent that the explanation it supplies of relational application is plausible — even though those competitors can handle variable arity relations in addition to fixed arity relations. (shrink)

In a recent article, Joel Pust argued that direct inference based on reference properties of differing arity are incommensurable, and so direct inference cannot be used to resolve the Sleeping Beauty problem. After discussing the defects of Pust's argument, I offer reasons for thinking that direct inferences based on reference properties of differing arity are commensurable, and that we should prefer direct inferences based on logically stronger reference properties, regardless of arity.

We give a new and elementary construction of primitive positive decomposition of higher arity relations into binary relations on finite domains. Such decompositions come up in applications to constraint satisfaction problems, clone theory and relational databases. The construction exploits functional completeness of 2-input functions in many-valued logic by interpreting relations as graphs of partially defined multivalued ‘functions’. The ‘functions’ are then composed from ordinary functions in the usual sense. The construction is computationally effective and relies on well-developed methods of (...) functional decomposition, but reduces relations only to ternary relations. An additional construction then decomposes ternary into binary relations, also effectively, by converting certain disjunctions into existential quantifications. The result gives a uniform proof of Peirce’s reduction thesis on finite domains, and shows that the graph of any Sheffer function composes all relations there. (shrink)

In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics and a set of logical constants (with specified arities). The first generator returns formulae of exactly the given depth, using all or some of the propositional letters. The second does the same but samples up-to the given depth. The third generator outputs formulae with exactly (...) the desired depth and all the atomics in the set. To make the generators uniform (i.e. to make them return every formula in their space with the same probability), we will prove various cardinality results about those spaces. (shrink)

Maureen Donnelly has recently argued that directionalism, the view that relations have a direction, applying to their relata in an order, is unable to properly treat certain symmetric relations. She alleges that it must count the application of such a relation to an appropriate number of objects in a given order as distinct from its application to those objects in any other ordering of them. I reply by showing how the directionalist can link the application conditions of any fixed (...) class='Hi'>arity relation, no matter its arity or symmetry, and its converse(s) in such a way that directionalism will yield the correct ways in which it can apply. I thus establish that directionalism possesses the same advantage Donnelly's own account of relations, relative positionalism, has over traditional positionalist accounts of relations, which do not properly treat symmetric relations. I then note some advantages that directionalism has over its closest competitors. This includes Donnelly's relative positionalism, since directionalism is not, like relative positionalism, committed to the involvement of relative properties in every irreducibly relational claim. I close by conceding that, as Donnelly notes, directionalism is committed to the primitive relation of order-sensitive relational application. But I don't find this notion as mysterious as Donnelly does. I conclude that, even if one construes this feature of directionalism as a drawback, the two views are at worst at a draw, other things being equal, since this drawback is mitigated by the advantage directionalism has over relative positionalism. (shrink)

We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of predicate calculus. Our algebraic framework unifies natural joins and data dependencies of database theory and relational algebra of clone theory with the bond algebra of C.S. Peirce. We also offer new constructions of reductions, systematically study irreducible relations and reductions to them and introduce a new characteristic (...) of relations, ternarity, that measures their ‘complexity of relating’ and allows to refine reduction results. In particular, we refine Peirce’s controversial reduction thesis, and show that reducibility behaviour is dramatically different on finite and infinite domains. (shrink)

Speaks defends the view that propositions are properties: for example, the proposition that grass is green is the property being such that grass is green. We argue that there is no reason to prefer Speaks's theory to analogous but competing theories that identify propositions with, say, 2-adic relations. This style of argument has recently been deployed by many, including Moore and King, against the view that propositions are n-tuples, and by Caplan and Tillman against King's view that propositions are facts (...) of a special sort. We offer our argument as an objection to the view that propositions are unsaturated relations. (shrink)