The aim of this paper is to make sense of the Keynes–Johnson octagon of oppositions. We will discuss Keynes' logical theory, and examine how his view is reflected on this octagon. Then we will show how this structure is to be handled by means of a semantics of partition, thus computing logical relations between matching formulas with a semantic method that combines model theory and Boolean algebra.

Bertrand Russell offered an influential paradox of propositions in Appendix B of The Principles of Mathematics, but there is little agreement as to what to conclude from it. We suggest that Russell's paradox is best regarded as a limitative result on propositional granularity. Some propositions are, on pain of contradiction, unable to discriminate between classes with different members: whatever they predicate of one, they predicate of the other. When accepted, this remarkable fact should cast some doubt upon some of the (...) uses to which modern descendente of Russell's paradox of propositions have been put in recent literature. (shrink)

(2013). What are Propositions? Canadian Journal of Philosophy: Vol. 43, Essays on the Nature of Propositions, pp. 702-719.

This paper deals with two issues. First, it identifies structured propositions with logical procedures. Second, it considers various rigorous definitions of the granularity of procedures, hence also of structured propositions, and comes out in favour of one of them. As for the first point, structured propositions are explicated as algorithmically structured procedures. I show that these procedures are structured wholes that are assigned to expressions as their meanings, and their constituents are sub-procedures occurring in executed mode. Moreover, procedures are not (...) mere aggregates of their parts; rather, procedural constituents mutually interact. As for the second point, there is no universal criterion of the structural isomorphism of meanings, hence of co-hyperintensionality, hence of synonymy for every kind of language. The positive result I present is an ordered set of rigorously defined criteria of fine-grained individuation in terms of the structure of procedures. Hence procedural semantics provides a solution to the problem of the granularity of co-hyperintensionality. (shrink)

In recent years a number of authors sympathetic to Referentialistaccounts of proper names have argued that utterances containingempty names express `gappy,' or incomplete, propositions. In this paper I want to take issue with this suggestion.In particular, I argue versions of this approach developedby David Braun, Nathan Salmon, Ken Taylor, and by Fred Adams,Gary Fuller, and Robert Stecker.

In this paper, I argue that Scott Soames’ theory of naturalized cognitive propositions faces a serious objection: there are true propositions for which NCP cannot account. More carefully, NCP cannot account for certain truths of mathematics unless it is possible for there to be an infinite intellect. For those who reject the possibility of an infinite intellect, this constitutes a reductio of NCP.

Some Presentists—according to whom everything is present—identify instants of time with propositions of a certain kind. However, the view that times are propositions seems to be at odds with Presentism: if there are times then there are past times, and therefore things that are past; but how could there be things that are past if everything is present? In this paper, we describe the Presentist view that times are propositions ; we set out the argument that Presentism is incompatible with (...) the view that times are propositions ; and then we describe three possible responses to that argument on behalf of Presentists who identify times with propositions. We argue that each of these responses comes with significant costs. Finally, we describe a fourth possible response—according to which times are irreducibly higher-order entities—which appears to avoid the costs of the other three. We also describe and respond to two objections to the higher-order strategy. (shrink)

I develop here a novel version of the Fregean view of belief ascriptions (i.e., sentences of the form ‘S believes that p’) and I explain how my view accounts for various problem cases that many philosophers have supposed are incompatible with Fregeanism. The so-called problem cases involve (a) what Perry calls essential indexicals and (b) de re ascriptions in which it is acceptable to substitute coreferential but non-synonymous terms in belief contexts. I also respond to two traditional worries about what (...) the sense of a proper name could be, and I explain how my view provides intuitively pleasing solutions to Kripke’s ‘London’–‘Londres’ puzzle and his Paderewski puzzle. Finally, in addition to defending my view, I also argue very briefly against Russellian alternatives to Fregeanism. (shrink)

This monograph is a defence of the Fregean take on logic. The author argues that Frege ́s projects, in logic and philosophy of language, are essentially connected and that the formalist shift produced by the work of Peano, Boole and Schroeder and continued by Hilbert and Tarski is completely alien to Frege's approach in the Begriffsschrift. A central thesis of the book is that judgeable contents, i.e. propositions, are the primary bearers of logical properties, which makes logic embedded in our (...) conceptual system. This approach allows coherent and correct definitions of logical constants, logical consequence, and truth and connects their use to the practices of rational agents in science and everyday life. (shrink)

A first-person proposition is a proposition that only a single subject can assert or believe. When I assert ‘I am on fire’ I assert a first-person proposition that only I have access to, in the sense that no one else can assert or believe this proposition. This is in contrast to third-person propositions, which can be asserted or believed by anyone.

Without violating the spirit of Game-Theoretical semantics, its results can be re-worked in Martin-Löf''s Constructive Type Theory by interpreting games as types of Myself''s winning strategies. The philosophical ideas behind Game-Theoretical Semantics in fact highly recommend restricting strategies to effective ones, which is the only controversial step in our interpretation. What is gained, then, is a direct connection between linguistic semantics and computer programming.

In order to fulfil their essential roles as the bearers of truth and the relata of logical relations, propositions must be public and shareable. That requirement has favoured Platonist and other nonmental views of them, despite the well-known problems of Platonism in general. Views that propositions are mental entities have correspondingly fallen out of favour, as they have difficulty in explaining how propositions could have shareable, objective properties. We revive a mentalist view of propositions, inspired by Artificial Intelligence work on (...) perceptual algorithms, which shows how perception causes persistent mental entities with shareable properties that allow them to fulfil the traditional roles of (one core kind of) propositions. The clustering algorithms implemented in perception produce outputs which are (implicit) atomic propositions in different minds. Coordination of them across minds proceeds by game-theoretic processes of communication. The account does not rely on any unexplained notions such as mental content, representation, or correspondence (although those notions are applicable in philosophical analysis of the result). (shrink)

Bertrand Russell and the Nature of Propositions offers the first book-length defence of the Multiple Relation Theory of Judgement (MRTJ). Although the theory was much maligned by Wittgenstein and ultimately rejected by Russell himself, Lebens shows that it provides a rich and insightful way to understand the nature of propositional content. In Part I, Lebens charts the trajectory of Russell’s thought before he adopted the MRTJ. Part II reviews the historical story of the theory: What led Russell to deny the (...) existence of propositions altogether? Why did the theory keep evolving throughout its short life? What role did G. F. Stout play in the evolution of the theory? What was Wittgenstein’s concern with the theory, and, if we can’t know what his concern was exactly, then what are the best contending hypotheses? And why did Russell give the theory up? In Part III, Lebens makes the case that Russell’s concerns with the theory weren’t worth its rejection. Moreover, he argues that the MRTJ does most of what we could want from an account of propositions at little philosophical cost. This book bridges the history of early analytic philosophy with work in contemporary philosophy of language. It advances a bold reading of the theory of descriptions and offers a new understanding of the role of Stout and the representation concern in the evolution of the MRTJ. It also makes a decisive contribution to philosophy of language by demonstrating the viability of a no-proposition theory of propositions. (shrink)

Realists about possible worlds typically identify possible worlds with abstract objects, such as propositions or properties. However, they face a significant objection due to Lewis (1986), to the effect that there is no way to explain how possible worlds-as-abstract objects represent possibilities. In this paper, I describe a response to this objection on behalf of realists. The response is to identify possible worlds with propositions, but to deny that propositions are abstract objects, or indeed objects at all. Instead, I argue (...) that realists should follow Prior (1971) and others in treating higher-order quantification (e.g. quantification into predicate or sentence position) as a genuine form of quantification in its own right, and so in particular, not to be analysed in terms of first-order quantification over abstract objects. I argue that from this ‘higher-orderist’ perspective, there is a relatively straightforward answer to the question of how possible worlds-as-propositions succeed in representing possibilities. (shrink)

The meanings of utterances and thoughts are commonly regarded in philosophical semantics as abstract objects, called «propositions», which account for how different utterances and thoughts can be synonymous and which constitute the primary truth-bearers. I argue that meanings are instead natural properties that play causal roles in the world, that the kind of «One over Many» thinking underlying the characterization of shared meanings as abstract objects is misguided and that utterances and thoughts having truth-values in virtue of their meanings does (...) not entail that meanings themselves are truth-bearers. (shrink)

The idea of rejection of some sentences on the basis of others comes from Aristotle, as Jan Łukasiewicz states in his studies on Aristotle's syllogistic [1939, 1951], concerning rejection of the false syllogistic form and those on certain calculus of propositions. Short historical remarks on the origin and development of the notion of a rejected sentence, introduced into logic by Jan Łukasiewicz, are contained in the Introduction of this paper. This paper is to a considerable extent a summary of papers (...) which are not easily available, even to the Polish reader: (1) J. Słupecki, Funkcja Łukasiewicza (Łukasiewicz’s function), Zeszyty Naukowe Uniwersytetu Wrocławskiego, Seria B, nr 3 (1959), 33-40; (2) U. Wybraniec-Skardowska, Teoria zdań odrzuconych (Theory of Rejected Sentences), (doctoral dissertation under the supervision of Jerzy Słupecki, published as a monograph), Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Studia i Monografie, Nr 22 (1969), 5-131; (3) G. Bryll, Kilka uzupełnień teorii zdań odrzuconych (Some supplements to the theory of rejcted sentences), Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Studia i Mnografie, Nr 22 (1969), 153-154. The paper also contains a good number of results which have not been published yet. Chapter I contains results presented in the papers (1)-(3). It provides an extension of Alfred Tarski’s theory of deductive systems presented by him in the papers [1930]: Fundamentale Begriffe der Methodologie der deduktiven Wssenschaften, I and Über einige fundamentale Begriffe der Metamathematik. The enriched theory is marked with T. The most essential new concept in T is the function Cn-1, whose definition was given by Słupecki in (1) on the basis of the so-called Tarski’s general theory of deductive systems. It has the form: y e Cn-1X iff Ex e X (x e Cn {y}), where Cn is Tarski’s consequence operation. In accordance with the definition: A sentence y is rejected on the basis of the sentences of the set X iff at least one of sentences of X is a consequence of y (is deducible from y). The intuitive meaning of the rejection function Cn-1: on the basis of false sentences we can reject false sentences only (while by means of the consequence operation Cn on the basis of true sentences we can deduce true sentences only). The function Cn-1 is a generalization of the notion of rejected sentences which was introduced into logic by Łukasiewicz. The essential property of the rejection function Cn-1 is that it satisfies the axioms of general Tarski’s consequence Cn, so it is a consequence operation, called the rejection consequence. In addition, it is an additive and normal operation. In Chapter I, there are given notions analogous to those of the theory of deductive systems, but they are written down by means of the symbol ‘Cn-1’ and not ‘Cn’. There are established the properties of introduced notions and differences and analogies taking place between them and properties of respective notions of the theory T. There are also given generalizations of the notions of ‘decidable system’ and ‘consistent system’ used by Łukasiewicz. The short Chapter II contains axioms of the system T’ which is equivalent to the system T. The only difference between sets of primitive notions of these systems consists in the appearance of the function Cn-1 in the system T’ instead of the function Cn. This chapter reproduces the results given in (2), but they are partially simplified. (shrink)

In this paper, I discuss two concerns for pluralist truth theories: a concern about a key detail of these theories and a concern about their viability. The detail-related concern is that pluralists have relied heavily upon the notion of a domain, but it is not transparent what they take domains to be. Since the notion of a domain has been present in philosophy for some time, it is important for many theorists, not only truth pluralists, to be clear on what (...) domains are and what work they can do. The viability-related concern is that it’s not clear how a pluralist truth theory could explain the truth-conditions of mixed atomic propositions. To address this concern, truth pluralists should recognize something to which they have not been sufficiently attentive: that some atomic propositions belong to more than one domain. But, recognizing this requires rethinking the relationships between the nature of propositions, their membership in domains, and their truth. I address these issues and propose an understanding of them that is preferable to the best existing account of them, that offered by Michael Lynch. (shrink)