An investigation of Proclus' logic of the syllogistic and of negations in the Elements of Theology, On the Parmenides, and Platonic Theology. It is shown that Proclus employs interpretations over a linear semantic structure with operators for scalar negations (hypemegationlalpha-intensivum and privative negation). A natural deduction system for scalar negations and the classical syllogistic (as reconstructed by Corcoran and Smiley) is shown to be sound and complete for the non-Boolean linear structures. It is explained how Proclus' syllogistic presupposes converting the (...) tree of genera and species from Plato's diairesis into the Neoplatonic linear hierarchy of Being by use of scalar hyper and privative negations. (shrink)

I explore the motivation and logical consequences of the idea that we have some (limited) ability to know contingent facts about the future, even in presence of the assumption that the future is objectively unsettled or indeterminate. I start by formally characterizing skepticism about the future. This analysis nudges the anti-skeptic towards the idea that if some propositions about the future are objectively indeterminate, then it may be indeterminate whether a suitably positioned agent knows them. -/- Philosophical Perspectives, Volume 35, (...) Issue 1, Page 50-69, December 2021. (shrink)

The canonical version of possible worlds semantics for story prefixes is due to David Lewis. This paper reassesses Lewis's theory and draws attention to some novel problems for his account.

An inexact generalization like ‘ravens are black’ will be symbolized as a prepositional function with free variables thus: ‘Rx ⇒ Bx.’ The antecedent ‘Rx’ and consequent ‘Bx’ will themselves be called absolute formulas, while the result of writing the non-boolean connective ‘⇒’ between them is conditional. Absolute formulas are arbitrary first-order formulas and include the exact generalization ‘(x)(Rx → Bx)’ and sentences with individual constants like ‘Rc & Bc.’ On the other hand the non-boolean conditional ‘⇒’ can only occur as (...) the main connective in a formula. We shall also need to consider formulas with more than one free variable such as ‘xHy ⇒ xTy,’ which might express ‘if x is the husband of y then x is taller than y.’ Though it is inessential, it will simplify things to work in ‘n-languages’ with a finite number of individual constants c1,…, cn, which are interpreted as denoting the elements of the domains of the ‘n-models’ to be described below. (shrink)

A 1-ary sentential context is aggregative (according to a consequence relation) if the result of putting the conjunction of two formulas into the context is a consequence (by that relation) of the results of putting first the one formula and then the other into that context. All 1-ary contexts are aggregative according to the consequence relation of classical propositional logic (though not, for example, according to the consequence relation of intuitionistic propositional logic), and here we explore the extent of this (...) phenomenon, generalized to having arbitrary connectives playing the role of conjunction; among intermediate logics, LC, shows itself to occupy a crucial position in this regard, and to suggest a characterization, applicable to a broader range of consequence relations, in terms of a variant of the notion of idempotence we shall call componentiality. This is an analogue, for the consequence relations of propositional logic, of the notion of a conservative operation in universal algebra. (shrink)