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 paper presents a formal explication of the early Wittgenstein's views on ontology, the syntax and semantics of an ideal logical language, and the propositional attitudes. It will be shown that Wittgenstein gave a language of thought analysis of propositional attitude ascriptions, and that his ontological views imply that such ascriptions are truth-functions of (and supervenient upon) elementary sentences. Finally, an axiomatization of a quantified doxastic modal logic corresponding to Tractarian semantics will be given.

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 present discussion takes up an issue raised in Section 5 of Ross Brady and Penelope Rush’s paper ‘Four Basic Logical Issues’ concerning the (claimed) triviality – in the sense of automatic availability – of soundness and completeness results for a logic in a metalanguage employing at least as much logical vocabulary as the object logic, where the metalogical behaviour of the common logical vocabulary is as in the object logic. We shall see – in Propositions 4.5–4.7 – that this (...) triviality claim faces difficulties in the face of Halldén incompleteness, for essentially the same reasons that Halldén thought this phenomenon raised seman- tic difficulties for the modal logics of C. I. Lewis exhibiting it. To counter any inclination to dismiss the phenomenon as providing at best a marginal range of counterexamples to the triviality claim, a Postscript assembles some reminders of the extent of – and the varied considerations favouring – Halldén incompleteness. (shrink)

In this paper, I develop a new set of doxastic logical systems and I show how they can be used to solve several well-known problems in doxastic logic, for example the so-called problem of logical omniscience. According to this puzzle, the notions of knowledge and belief that are used in ordinary epistemic and doxastic symbolic systems are too idealised. Hence, those systems cannot be used to model ordinary human or human-like agents' beliefs. At best, they can describe idealised individuals. The (...) systems in this paper can be used to symbolise not only the doxastic states of perfectly rational individuals, but also the beliefs of finite humans. Proof-theoretically, I will use a tableau technique. Every system is combined with predicate logic with necessary identity and ‘possibilist’ quantifiers and modal logic with two kinds of modal operators for relative and absolute necessity. The semantics is a possible world semantics. Finally, I prove that every tableau system in the paper is sound and complete with respect to its semantics. (shrink)

The textbook-like history of analytic philosophy is a history of myths, re-ceived views and dogmas. Though mainly the last few years have witnessed a huge amount of historical work that aimed to reconsider our narratives of the history of ana-lytic philosophy there is still a lot to do. The present study is meant to present such a micro story which is still quite untouched by historians. According to the received view Kripke has defeated all the arguments of Quine against quantified (...) modal logic and thus it became a respectful tool for philosophers. If we accept the historical interpreta-tion of the network between Quine, Kripke and modal logic, which is to be presented here, we have to conclude that Quine’s real philosophical animadversions against the modalities are still on the table: though Kripke has provided some important (formal-logical) answers, Quine’s animadversions are still viable and worthy of further consideration. (shrink)

In this paper I focus on a recently discussed phenomenon illustrated by sentences containing predicates of taste: the phenomenon of " perspectival plurality " , whereby sentences containing two or more predicates of taste have readings according to which each predicate pertains to a different perspective. This phenomenon has been shown to be problematic for (at least certain versions of) relativism. My main aim is to further the discussion by showing that the phenomenon extends to other perspectival expressions than predicates (...) of taste and by proposing a general solution to the problem raised by it on behalf of the relativist. The core claim of the solution (" multiple indexing ") is that utterances of sentences containing perspectival expressions should be evaluated with respect to (possibly infinite) sequences of perspective parameters. (shrink)

An overcomplete logic is a logic that ‘ceases to make the difference’: According to such a logic, all inferences hold independently of the nature of the statements involved. A negation-inconsistent logic is a logic having at least one model that satisfies both some statement and its negation. A negation-incomplete logic has at least one model according to which neither some statement nor its negation are satisfied. Paraconsistent logics are negation-inconsistent yet non-overcomplete; paracomplete logics are negation-incomplete yet non-overcomplete. A paranormal logic (...) is simply a logic that is both paraconsistent and paracomplete. -/- Despite being perfectly consistent and complete with respect to classical negation, nearly every normal modal logic, in its ordinary language and interpretation, admits to some latent paranormality: It is paracomplete with respect to a negation defined as an impossibility operator, and paraconsistent with respect to a negation defined as non-necessity. In fact, as it will be shown here, even in languages without a primitive classical negation, normal modal logics can often be alternatively characterized directly by way of their paranormal negations and related operators. So, instead of talking about ‘necessity’, ‘possibility’, and so on, modal logics could be seen just as devices tailored for the study of (modal) negation. This paper shows how and to what extent this alternative characterization of modal logics can be realized. (shrink)

Arguably, there is no substantial, general answer to the question of what makes for the approximate truth of theories. But in one class of cases, the issue seems simply resolved. A wide class of applied dynamical theories can be treated as two-component theories—one component specifying a certain kind of abstract geometrical structure, the other giving empirical application to this structure by claiming that it replicates, subject to arbitrary scaling for units etc., the geometric structure to be found in some real-world (...) dynamical phenomenon. In such a case, a theory is approximately true just if the one geometric structure approximately replicates the other (and if problems remain here, they are problems in geometry, of specifying suitable metric approximation relations, not conceptual problems). This article amplifies and defends this simple approach to approximate truth for dynamical theories. (shrink)

Normal 0 21 false false false PT-BR X-NONE X-NONE MicrosoftInternetExplorer4 Normal 0 21 false false false PT-BR X-NONE X-NONE MicrosoftInternetExplorer4 Normative fragment of natural language make up sentences that express acts and describe norms. In this fragment there are criteria of logic thuth and relation of consequence between sentences which constitute a natural deontic logic. This paper adopts at ranslation function from the set of sentences of the normative fragment of natural language in to the set of formulae in the (...) formal language and claims that such function translates logically true sentences of the natural language into provable formulae of the formal calculus. With Von Wright's deontic calculus (1951), it does not fit and generates paradoxes, which are known as Prior's paradoxes. Cruz's paraconsistent deontic propositional calculus, D 1 (1993) avoids some paradoxes, except that generated by the formula OB-O (A- B). One builds a relevant deontic propositional calculus that aims to avoid these paradoxes and keeps intact all other fundamental features of deontic operators, since the formula B - (A - B) is improable in some relavant calculi.  . (shrink)

First - order modal logic is very much under current development, with many different semantics proposed. The use of rigid objects goes back to Saul Kripke. More recently, several semantics based on counterparts have been examined, in a development that goes back to David Lewis. There is yet another line of research, using intensional objects, that traces back to Richard Montague. I have been involved with this line of development for some time. In the present paper, I briefly sketch several (...) of the approaches to first - order modal logic. Then I present one that I call FOIL in the Montague tradition that, I believe, is both expressive and natural. I briefly discuss in what sense it can be made to encompass the other approaches. Finally, I provide tableau rules to go with the FOIL semantics. (shrink)

The view that mathematical objects are indefinite in nature is presented and defended, hi the first section, Field's argument for fictionalism, given in response to Benacerraf's problem of identification, is closely examined, and it is contended that platonists can solve the problem equally well if they take the view that mathematical objects are indefinite. In the second section, two general arguments against the intelligibility of objectual indefiniteness are shown erroneous, hi the final section, the view is compared to mathematical structuralism, (...) and it is shown that a version of structuralism should be understood as embracing the same view. (shrink)

In this work we extend results from [4], [3] and [2] about propositional calculi with graded modalities to the predicative level. Our semantic is based on Kripke models with a single domain of interpretation for all the worlds. Therefore the axiomatic system will need a suitable generalization of the Barcan formula. We haven't considered semantics with world-relative domains because they don't present any new difficulties with respect to classical case. Our language will have, as in [1], constant and function symbols, (...) but they will have a rigid interpretation. In this instance the terms will be considered "rigid designators", that is, their interpretations will be the same in all possible worlds. Nevertheless we will not consider languages with identity: in this way we avoid the problems of identity in modal contexts. On the other hand, we think that in that context would arise essentially the same problems which occur in classical predicative modal logic. Finally we will consider only denumerable languages because the extension to non denumerable ones isn't conceptually problematic. (shrink)

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)

In [8] Jakowski defined by means of an appropriate interpretation a paraconsistent calculusD 2 . In [9] J. Kotas showed thatD 2 is equivalent to the calculusM(S5) whose theses are exactly all formulasa such thatMa is a thesis ofS5. The papers [11], [7], [3], and [4] showed that interesting paraconsistent calculi could be obtained using modal systems other thanS5 and modalities other thanM. This paper generalises the above work. LetA be an arbitrary modality (i.e. string ofM''s,L''s and negation signs). Then (...) theA-extension of a set of formulasX is {¦A X}}. Various properties ofA-extensions of normal modal systems are examined, including a problem of their axiomatizability. (shrink)