A general method for generating contraction- and cut-free sequent calculi for a large family of normal modal logics is presented. The method covers all modal logics characterized by Kripke frames determined by universal or geometric properties and it can be extended to treat also Gödel-Löb provability logic. The calculi provide direct decision methods through terminating proof search. Syntactic proofs of modal undefinability results are obtained in the form of conservativity theorems.

Standard approaches to possible-world semantics allow us to define necessity and logical truth, but analyticity is considerably more difficult to account for. The source of this difficulty lies in the received model-theoretical conception of a language interpretation. In intuitive terms, analyticity amounts to truth in virtue of meaning alone, i.e. solely in virtue of the interpretation of linguistic expressions. In other words, an analytic sentence should remain true under all variations of ‘extralinguistic reality’ as long as the interpretation is kept (...) constant. However, the received conception of an interpretation as a mapping from language to a model frame hinders keeping the interpretation constant while varying other components of the model. To make room for analyticity, the concept of an interpretation should therefore be revised. The latter should be made richer in content than it has usually been assumed. As a by-product, this revision also gives us a one-dimensional analogue of the influential two-dimensional account of a priori. We are thus able to map out the network of formal connections between the notions of analyticity, apriority, logical truth and necessity. (shrink)

The axiomatic presentation of modal systems and the standard formulations of natural deduction and sequent calculus for modal logic are reviewed, together with the difficulties that emerge with these approaches. Generalizations of standard proof systems are then presented. These include, among others, display calculi, hypersequents, and labelled systems, with the latter surveyed from a closer perspective.

The papers where Gerhard Gentzen introduced natural deduction and sequent calculi suggest that his conception of logic differs substantially from the now dominant views introduced by Hilbert, Gödel, Tarski, and others. Specifically, (1) the definitive features of natural deduction calculi allowed Gentzen to assert that his classical system nk is complete based purely on the sort of evidence that Hilbert called ?experimental?, and (2) the structure of the sequent calculi li and lk allowed Gentzen to conceptualize completeness as a question (...) about the relationships among a system's individual rules (as opposed to the relationship between a system as a whole and its ?semantics?). Gentzen's conception of logic is compelling in its own right. It is also of historical interest, because it allows for a better understanding of the invention of natural deduction and sequent calculi. (shrink)

This collection of essays is the definitive version of a widely discussed debate over the origins of the New Theory of Reference. In new articles, written especially for this volume, Quentin Smith and Scott Soames, the original participants in the debate, elaborate their positions on who was responsible for the ideas that Saul Kripke presented in his Naming and Necessity. They are joined by John Burgess, who weighs in on the side of Soames, while Smith adds a further dimension in (...) discussing the contributions of philosophers such as Follesdal, Geach, Hintikka, and Plantinga. Also included are lengthy excerpts from Follesdal's 1961 Harvard dissertation and a careful examination by Sten Lindstrom of the respective contributions of Kripke and Stig Kanger to the development of modal semantics. The collection will be essential reading for anyone acquainted with these influential ideas. (shrink)

Theoria , the international Swedish philosophy journal, was founded in 1935. Its contributors in the first 75 years include the major Swedish philosophers from this period and in addition a long list of international philosophers, including A. J. Ayer, C. D. Broad, Ernst Cassirer, Hector Neri Castañeda, Arthur C. Danto, Donald Davidson, Nelson Goodman, R. M. Hare, Carl G. Hempel, Jaakko Hintikka, Saul Kripke, Henry E. Kyburg, Keith Lehrer, Isaac Levi, David Lewis, Gerald MacCallum, Richard Montague, Otto Neurath, Arthur N. (...) Prior, W. V. Quine, Nicholas Rescher, Ernest Sosa, Robert C. Stalnaker, P. F. Strawson, Patrick Suppes, Johan van Benthem, Georg Henrik von Wright and many others. Hempel's confirmation paradoxes, Ross's deontic paradox, Montague's universal grammar and Lindström's theorem are among the contributions to philosophy that were first published in Theoria. (shrink)

This paper is a reply to some of Scott Soames ' comments on my colloquium paper Marcus, Kripke, and the Origin of the New Theory of Reference. Except for the indicated parts added in May, 1995, this paper was written on December 16th–25th, 1994 as my reply to Soames for the APA colloquium in Boston, December 28, 1994. In this paper, I argue that Soames ' contention that Marcus is not one of the primary founders of contemporary nondescriptivist theories of (...) reference is false. Soames presents numerous arguments for his thesis that Marcus did not originate ideas later elaborated upon by Kripke, but his arguments are unsound; they are based in part on a misunderstanding of Marcus' theory and in part on an inadequate grasp of some of the key notions of the New Theory of Reference, such as the notion of a posteriori necessities and the notion of reference-fixing descriptions. (shrink)

The so-called New Theory of Reference (Marcus, Kripke etc.) is inspired by the insight that in modal and intensional contexts quantifiers presuppose nondescriptive unanalyzable identity criteria which do not reduce to any descriptive conditions. From this valid insight the New Theorists fallaciously move to the idea that free singular terms can exhibit a built-in direct reference and that there is even a special class of singular terms (proper names) necessarily exhibiting direct reference. This fallacious move has been encouraged by a (...) mistaken belief in the substitutional interpretation of quantifiers, by the myth of thede re reference, and a mistaken assimilation of direct reference to ostensive (perspectival) identification. Thede dicto vs.de re contrast does not involve direct reference, being merely a matter of rule-ordering (scope).The New Theorists' thesis of the necessity of identities of directly referred-to individuals is a consequence of an unmotivated and arbitrary restriction they tacitly impose on the identification of individuals. (shrink)

This paper describes and compares the first step in modern semantic theory for deontic logic which appeared in works of Stig Kanger, Jaakko Hintikka, Richard Montague and Saul Kripke in late 50s and early 60s. Moreover, some further developments as well as systematizations are also noted.

The Reduction of the Possible to the Real. Modern philosophy cannot avoid dealing with possible worlds - neither in the field of intensional logic nor in other fields not directly connected with logical investigations. This paper attempts to develop a method to substitute possible worlds by the real world, referring to the works of Stig Kanger and Nino B. Cocchiarella. This is done by investigating the metaphorical and dynamical functions of natural languages. It is proved that this new technique is (...) adequate for use in the semantics of intensional languages. As an example a language is constructed, which is based on the aristotelian view of universal concepts. (shrink)

This article traces the development of possible worlds semantics through the work of: Wittgenstein, 1913-1921; Feys, 1924; McKinsey, 1945; Carnap, 1945-1947; McKinsey, Tarski and Jónsson, 1947-1952; von Wright, 1951; Becker, 1952; Prior, 1953-1954; Montague, 1955; Meredith and Prior, 1956; Geach, 1960; Smiley, 1955-1957; Kanger, 1957; Hintikka, 1957; Guillaume, 1958; Binkley, 1958; Bayart, 1958-1959; Drake, 1959-1961; Kripke, 1958-1965.

The status of the equality predicate as a logical constant is problematic. In the paper we look at the problem from the proof-theoretic standpoint and survey several ways of treating equality in formal systems of different sorts. In particular, we focus on the framework of sequent calculus and examine equality in the light of criteria of logicality proposed by Hacking and Došen. Both attempts were formulated in terms of sequent calculus rules, although in the case of Došen it has a (...) nonstandard character. It will be shown that equality can be characterised in a way which satisfies Došen’s criteria of logicality. In the case of Hacking’s approach the fully satisfying result can be obtained only for languages with a nonempty, finite set of predicate constants other than equality. Otherwise, cut elimination theorem fails to hold. (shrink)

This open access book is a superb collection of some fifteen chapters inspired by Schroeder-Heister's groundbreaking work, written by leading experts in the field, plus an extensive autobiography and comments on the various contributions by Schroeder-Heister himself. For several decades, Peter Schroeder-Heister has been a central figure in proof-theoretic semantics, a field of study situated at the interface of logic, theoretical computer science, natural-language semantics, and the philosophy of language. -/- The chapters of which this book is composed discuss the (...) subject from a rich variety of angles, including the history of logic, the proper interpretation of logical validity, natural deduction rules, the notions of harmony and of synonymy, the structure of proofs, the logical status of equality, intentional phenomena, and the proof theory of second-order arithmetic. All chapters relate directly to questions that have driven Schroeder-Heister's own research agenda and to which he has made seminal contributions. The extensive autobiographical chapter not only provides a fascinating overview of Schroeder-Heister's career and the evolution of his academic interests but also constitutes a contribution to the recent history of logic in its own right, painting an intriguing picture of the philosophical, logical, and mathematical institutional landscape in Germany and elsewhere since the early 1970s. The papers collected in this book are illuminatingly put into a unified perspective by Schroeder-Heister's comments at the end of the book. Both graduate students and established researchers in the field will find this book an excellent resource for future work in proof-theoretic semantics and related areas. (shrink)

در نگاه نخست به نظر می‌رسد می‌توان شباهت‌هایی بین جهان‌های ممکن مورد نظر لوئیس و نظریۀ جهان‌های موازی فیزیک یافت. هر دو این نظریات به امکان وجود جهان‌هایی بیش از جهانی که در آن زندگی می‌کنیم، اشاره دارند. پس از رسالۀ اورت، توجه فیزیک‌دانان به چندجهانی و جهان‌های موازی جلب شد. اکنون جهان‌های موازی یکی از نظریه‌های مورد توجه دانشمندان و پژوهشگران حوزۀ فیزیک است. دیوید لوئیس با تکیه بر فیزیکالیسم و رئالیسم موجهاتی از جمله طرفداران نظریۀ جهان‌های ممکن است. (...) در این مقاله کوشیده‌ایم با استفاده از روش تحلیلی-توصیفی ابتدا مبانی دو نظریه را تبیین کرده و سپس نظریۀ لوئیس را در مورد جهان‌های ممکن با توجه به نظریۀ جهان‌های موازی مورد بررسی قرار دهیم. هر دو نظریه وجود جهان‌های دیگر را ممکن می‌دانند. نظریه لوئیس شش ویژگی اصلی دارد: ۱- وجود و واقعیت جهان‌های ممکن، ۲- عدم وجود رابطه علی میان‌ جهان‌های ممکن، ۳- شباهت جهان‌های ممکن با جهان ما و تفاوت در محتوای جهان‌ها، ۴- عدم امکان تقلیل جهان‌های ممکن، ۵- نمایه‌ای بودن واقعیت و ۶- اتحاد مکان- زمان اجزای هر جهان و مجزا بودن روابط زمان-مکان جهان‌ها. نتایج پژوهش نشان می‌دهد در صورتی که جهان‌های موازی، زمانی به عنوان یک حقیقت علمی مورد تأیید قرار بگیرند، آنگاه ممکن است ویژگی‌های دوم، سوم و ششم نظریۀ لوئیس با واقعیت فیزیکی در تضاد قرار بگیرند. در صورت وجود تضاد -به جهت بنیادی بودن این ویژگی‌ها- نظریۀ جهان‌های ممکن لوئیس دچار تزلزل فراوان خواهد شد. (shrink)

This chapter contains sections titled: Introduction Modal propositional Logics (MPLs) Modal Quantificational Logics(QMLs).

Charles Sanders Peirce was one of the United States’ most original and profound thinkers, and a prolific writer. Peirce’s game theory-based approaches to the semantics and pragmatics of signs and language, to the theory of communication, and to the evolutionary emergence of signs, provide a toolkit for contemporary scholars and philosophers. Drawing on unpublished manuscripts, the book offers a rich, fresh picture of the achievements of a remarkable man.

This volume is a collection of some of the most important philosophical papers by Peter Gärdenfors. Spanning a period of more than 20 years of his research, they cover a wide ground of topics, from early works on decision theory, belief revision and nonmonotonic logic to more recent work on conceptual spaces, inductive reasoning, semantics and the evolutions of thinking. Many of the papers have only been published in places that are difficult to access. The common theme of all the (...) papers is the dynamics of thought. Several of the papers have become minor classics and the volume bears witness of the wide scope of Gärdenfors’ research and of his crisp and often witty style of writing. The volume will be of interest to researchers in philosophy and other cognitive sciences. (shrink)

A new type of formalization of classical first-order logic with equality is introduced on the basis of the sequent calculus. It serves to justify the claim that equality is a logical constant characterised by well-behaved rules satisfying properties usually regarded as essential. The main feature of this approach is the application of sequents built not only from formulae but also from terms. Two variants of sequent calculus are examined, a structural and a logical one. The former is defined in accordance (...) with Dos̆en’s criteria for logical constants. The latter is a standard Gentzen’s sequent calculus and satisfies Hacking’s criteria for logicality, including cut elimination. It is also shown that provided rules are harmonious in the sense advocated by Gratzl and Orlandelli. (shrink)

This book offers a concise introduction to both proof-theory and algebraic methods, the core of the syntactic and semantic study of logic respectively. The importance of combining these two has been increasingly recognized in recent years. It highlights the contrasts between the deep, concrete results using the former and the general, abstract ones using the latter. Covering modal logics, many-valued logics, superintuitionistic and substructural logics, together with their algebraic semantics, the book also provides an introduction to nonclassical logic for undergraduate (...) or graduate level courses.The book is divided into two parts: Proof Theory in Part I and Algebra in Logic in Part II. Part I presents sequent systems and discusses cut elimination and its applications in detail. It also provides simplified proof of cut elimination, making the topic more accessible. The last chapter of Part I is devoted to clarification of the classes of logics that are discussed in the second part. Part II focuses on algebraic semantics for these logics. At the same time, it is a gentle introduction to the basics of algebraic logic and universal algebra with many examples of their applications in logic. Part II can be read independently of Part I, with only minimum knowledge required, and as such is suitable as a textbook for short introductory courses on algebra in logic. (shrink)

Special issue: "Reflecting on the Legacy of C.I. Lewis: Contemporary and Historical Perspectives on Modal Logic".

We present a proof of the equivalence between two deductive systems for constructive necessity, namely an axiomatic characterisation inspired by Hakli and Negri's system of derivations from assumptions for modal logic , a Hilbert-style formalism designed to ensure the validity of the deduction theorem, and the judgmental reconstruction given by Pfenning and Davies by means of a natural deduction approach that makes a distinction between valid and true formulae, constructively. Both systems and the proof of their equivalence are formally verified (...) using the state-of-the-art proof assistant Coq. The proof approach taken throughout the paper unveils the use of some alternative proof methods that allow for a smooth transition from the high-level mathematical proofs to their mechanised counterparts. (shrink)

According to actualism, modal reality is constructed out of valuations (combinations of truth values for all propositions). According to possibilism, modal reality consists in a set of possible worlds, conceived as independent objects that assign truth values to propositions. According to possibilism, accounts of modal reality can intelligibly disagree with each other even if they agree on which valuations are contained in modal reality. According to actualism, these disagreements (possibilist disagreements) are completely unintelligible. An essentially actualist semantics for modal propositional (...) logic specifies which sets of valuations are compatible with the meanings of the truth-functional connectives and modal operators without drawing on formal resources that would enable us to represent possibilist disagreements. The paper discusses the availability of an essentially actualist semantics for modal propositional logic. I argue that the standard Kripkean semantics is not essentially actualist and that other extant approaches also fail to provide a satisfactory essentially actualist semantics. I end by describing an essentialist actualist semantics for modal propositional logic. (shrink)

The main chapters of this thesis develop and defend a version of two-dimensional semantics that provides an account of Kripkean a posteriori necessity.

We present a cut-admissible system for the modal logic S5 in a formalism that makes explicit and intensive use of deep inference. Deep inference is induced by the methods applied so far in conceptually pure systems for this logic. The system enjoys systematicity and modularity, two important properties that should be satisfied by modal systems. Furthermore, it enjoys a simple and direct design: the rules are few and the modal rules are in exact correspondence to the modal axioms.

In this paper I argue against the commonly received view that Kripke's formal Possible World Semantics (PWS) reflects the adoption of a metaphysical interpretation of the modal operators. I consider in detail Kripke's three main innovations vis-à-vis Carnap's PWS: a new view of the worlds, variable domains of quantification, and the adoption of a notion of universal validity. I argue that all these changes are driven by the natural technical development of the model theory and its related notion of validity: (...) they are dictated by merely formal considerations, not interpretive concerns. I conclude that Kripke's model theoretic semantics does not induce a metaphysical reading of necessity, and is formally adequate independently of the specific interpretation of the modal operators. (shrink)

This paper charts some early history of the possible worlds semantics for modal logic, starting with the pioneering work of Prior and Meredith. The contributions of Geach, Hintikka, Kanger, Kripke, Montague, and Smiley are also discussed.

Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is presented, together with an easy cut-admissibility proof; both extend to cover, in a uniform fashion, all intermediate logics characterised by frames satisfying conditions expressible by one or more geometric implications. Each of these logics is embedded by the Gödel–McKinsey–Tarski translation into an extension of S4. Faithfulness of the embedding is proved in a simple and general way by constructive proof-theoretic methods, without appeal to semantics other than in the (...) explanation of the rules. (shrink)

Model-theoretic 1-types overa given first-order theory T may be construed as natural metalogical miniatures of G. W. Leibniz' ``complete individual notions'', ``substances'' or ``substantial forms''. This analogy prompts this essay's modal semantics for an essentiallyundecidable first-order theory T, in which one quantifies over such ``substances'' in a boolean universe V(C), where C is the completion of the Lindenbaum-algebra of T.More precisely, one can define recursively a set-theoretic translate of formulae N of formulae of a normal modal theory Tm based on (...) T, such that the counterpart `i' of a the modal variable `xi' of L(Tm) in this translation-scheme ranges over elements of V(C) that are 1-types of T with value 1 (sometimes called `definite' C-valued 1-types of T). (shrink)

Condensed detachment is usually regarded as a notation, and defined by example. In this paper it is regarded as a rule of inference, and rigorously defined with the help of the Unification Theorem of J. A. Robinson. Historically, however, the invention of condensed detachment by C. A. Meredith preceded Robinson's studies of unification. It is argued that Meredith's ideas deserve recognition in the history of unification, and the possibility that Meredith was influenced, through ukasiewicz, by ideas of Tarski going back (...) at least to 1939, and possibly to 1930 or earlier, is discussed. It is proved that a term is derivable by substitution and ordinary detachment from given axioms if and only if it is a substitution instance of a term which is derivable from these axioms by condensed detachment, and it is shown how this theorem enables the ideas of ukasiewicz and Tarski mentioned above to be formalized and extended. Finally, it is shown how condensed detachment may be subsumed within the resolution principle of J. A. Robinson, and several computer studies of particular Hilbert-type propositional calculi using programs based on condensed detachment or on resolution are briefly discussed. (shrink)

The paper is devoted to the concise description of some Natural Deduction System (ND for short) for Linear Temporal Logic. The system's distinctive feature is that it is labelled and analytical. Labels convey necessary semantic information connected with the rules for temporal functors while the analytical character of the rules lets the system work as a decision procedure. It makes it more similar to Labelled Tableau Systems than to standard Natural Deduction. In fact, our solution of linearity representation is rather (...) independent of the underlying proof method, provided that some form of (analytic) cut is admissible. We will also discuss some generalisations of the system and compare it with other formalizations of linearity. (shrink)