The triumphal advance of the beings from logical space seems less formidable from the inside. This chapter deals with those enthusiasts who are even now preparing to bring on the impossible world. Trial‐and‐error modal logic is not the only way to take modality as primitive. There is also the option of reducing possible worlds to maximal consistent “books” of propositions. The books may be enough like possible worlds so that at least some of the explanatory power of (...) possible worlds semantics carries over. There are unproblematic mathematical entities that can be regarded as representing distributions of matter in space‐time, and thereby as representing the possible worlds where matter is so distributed. An account is to be found in Quince's "Propositional Objects." According to classical mathematics, these representatives do form a set. But propositions are sometimes conceived differently, as language independent entities that nevertheless have something analogous to syntactic structure. (shrink)

Trial and error classifiers, corresponding to concepts which change their extensions over time, are introduced and briefly philosophically motivated. A fragment of the language of classical first-order logic is given a new semantics, using \-sequences of classical models, in order to interpret the basic predicates as classifiers of this kind. It turns out that we can use a natural deduction proof system which differs from classical logic only in the conditions for application of existential elimination. Soundness and completeness (...) theorems are proved for this system. (shrink)

This paper is part of a project that is based on the notion of a dialectical system, introduced by Magari as a way of capturing trial and error mathematics. In Amidei et al. (2016, Rev. Symb. Logic, 9, 1–26) and Amidei et al. (2016, Rev. Symb. Logic, 9, 299–324), we investigated the expressive and computational power of dialectical systems, and we compared them to a new class of systems, that of quasi-dialectical systems, that enrich Magari’s systems with a (...) natural mechanism of revision. In the present paper we consider a third class of systems, that of p-dialectical systems, that naturally combine features coming from the two other cases. We prove several results about p-dialectical systems and the sets that they represent. Then we focus on the completions of first-order theories. In doing so, we consider systems with connectives, i.e. systems that encode the rules of classical logic. We show that any consistent system with connectives represents the completion of a given theory. We prove that dialectical and q-dialectical systems coincide with respect to the completions that they can represent. Yet, p-dialectical systems are more powerful; we exhibit a p-dialectical system representing a completion of Peano Arithmetic that is neither dialectical nor q-dialectical. (shrink)

Based on Kolchinsky and Wolpert’s work on the semantics of autonomous agents, I propose an application of Mathematical Logic and Probability to model cognitive processes. In this work, I will follow Bateson’s insights on the hierarchy of learning in complex organisms and formalize his idea of applying Russell’s Type Theory. Following Weaver’s three levels for the communication problem, I link the Kolchinsky–Wolpert model to Bateson’s insights, and I reach a semantic and conceptual hierarchy in living systems as an explicative (...) model of some adaptive constraints. Due to the generality of Kolchinsky and Wolpert’s hypotheses, I highlight some fundamental gaps between the results in current Artificial Intelligence and the semantic structures in human beings. In light of the consequences of my model, I conclude the paper by proposing a general definition of knowledge in probabilistic terms, overturning de Finetti’s Subjectivist Definition of Probability. (shrink)

Quantified modal logic has reputation for complexity. Completeness results for the various systems appear piecemeal. Different tactics are used for different systems, and success of a given method seems sensitive to many factors, including the specific combination of choices made for the quantifiers, terms, identity, and the strength of the underlying propositional modal logic. The lack of a unified framework in which to view QMLs and their completeness properties puts pressure on those who develop, apply, and (...) teach QML to work with the simplest systems, namely those that adopt the Barcan Formulas and predicate logic rules for the quantifiers. In these systems, the quantifier ranges over a fixed domain of possible individuals, so advocates of these logics are sometimes called possibilists. A literature has grown up rationalizing the choice of possibilist logics despite ordinary intuitions that the resulting theorems are too strong.Williamson even takes the view that the complications to be faced within the weaker logics “are a warning sign of philosophical error”. It is the purpose of this paper to show that abandonment of the weaker QMLs is excessively fainthearted, since most QMLs can be given relatively simple formulations within one general framework. Given the straightforward nature of the systems and their completeness results, the purported complications evaporate, along with any philosophical warnings one might have associated with them. (shrink)

In the propositional modal treatment of two-variable first-order logic equality is modelled by a ‘diagonal’ constant, interpreted in square products of universal frames as the identity relation. Here we study the decision problem of products of two arbitrary modal logics equipped with such a diagonal. As the presence or absence of equality in two-variable first-order logic does not influence the complexity of its satisfiability problem, one might expect that adding a diagonal to product logics in general (...) is similarly harmless. We show that this is far from being the case, and there can be quite a big jump in complexity, even from decidable to the highly undecidable. Our undecidable logics can also be viewed as new fragments of first-order logic where adding equality changes a decidable fragment to undecidable. We prove our results by a novel application of counter machine problems. While our formalism apparently cannot force reliable counter machine computations directly, the presence of a unique diagonal in the models makes it possible to encode both lossy and insertion-error computations, for the same sequence of instructions. We show that, given such a pair of faulty computations, it is then possible to reconstruct a reliable run from them. (shrink)

The main technical errors are in the literature survey. On pages 44, 93-94, 131 and 133 I claim that Fitting's and/or Rautenberg's systems are incomplete because they omit contraction. The claim is wrong because contraction is implicit in their set notation. Their systems are complete because they allow contraction on any formula whereas the systems in this technical report explicitly build contraction into certain rules, allowing contraction only on certain types of formulae. Please accept my apologies for any confusion this (...) causes you. (shrink)

Timothy Williamson offers a reductive account of modal knowledge in terms of knowledge of counterfactual conditionals. The account is developed in a broader context of defending two more general theses regarding the subject matter and methodology of philosophy. My primary focus in this paper is Williamson’s account of modal knowledge. I argue (1) that his account of modal knowledge does not support his more general theses regarding the subject matter and methodology of philosophy; (2) that the two (...) central claims of his account of knowledge of counterfactuals are rooted in unsubstantiated empirical assumptions; and (3) that his argument in support of the conclusion that modal knowledge is a special case of counterfactual knowledge rests on three errors: conflating logical reduction and epistemological reduction, a misguided appeal to cognitive economy, and incorrectly locating what needs to be explained by an account of modal knowledge. (shrink)

In this note, an error in the axiomatization of Ivlev’s modal system Sa+ which we inadvertedly reproduced in our paper “Finite non-deterministic semantics for some modal systems”, is fixed. Additionally, some axioms proposed in were slightly modified. All the technical results in which depend on the previous axiomatization were also fixed. Finally, the discussion about decidability of the level valuation semantics initiated in is taken up. The error in Ivlev’s axiomatization was originally pointed out by H. Omori and (...) D. Skurt in the paper “More modal semantics without possible worlds”, where an alternative solution was proposed. (shrink)

In this paper, we present a new semantic challenge to the moral error theory. Its first component calls upon moral error theorists to deliver a deontic semantics that is consistent with the error-theoretic denial of moral truths by returning the truth-value false to all moral deontic sentences. We call this the ‘consistency challenge’ to the moral error theory. Its second component demands that error theorists explain in which way moral deontic assertions can be seen to differ in meaning despite necessarily (...) sharing the same intension. We call this the ‘triviality challenge’ to the moral error theory. Error theorists can either meet the consistency challenge or the triviality challenge, we argue, but are hard pressed to meet both. (shrink)

In, Kosterec attempts to provide ``model-theoretic proofs'' of certain theses involving the normal modal operators $\Diamond$ and $\square$ and the truth-in-fiction operator $F$ which he then goes on to show have counterexamples in Kripke models. He concludes from this that the embedding of modal logic under the truth-in-fiction operator is unsound. We show instead that it is the ``model-theoretic proofs'' that are themselves unsound, involving illicit substitution, a subtle error that nevertheless allows us to draw an important (...) conclusion about intensional contexts and semantic equivalences. (shrink)

Following some ideas of Roberto Magari, we propose trial and error probabilistic functions, i.e. probability measures on the sentences of arithmetic that evolve in time by trial and error. The set ℐ of the sentences that get limit probability 1 is a Π3—theory, in fact ℐ can be a Π3—complete set. We prove incompleteness results for this setting, by showing for instance that for every k > 0 there are true Π3—sentences that get limit probability less than 1/2k. No set (...) ℐ as above can contain the set of all true Π3—sentences, although we exhibit some ℐ containing all the true Σ2—sentences. We also consider an approach based on the notions of inner probability and outer probability, and we compare this approach with the one based on trial and error probabilistic functions. Although the two approaches are shown to be different, we single out an important case in which they are equivalent. (shrink)

This paper addresses the selective mechanisms by which criminal proceedings produce strong arguments. It does so by focusing on the failing of argument themes (topoi) in the course of criminal proceedings, rather than on their career. In a further step, the notion of failing is bound to learning: different forms of failing point at different ways and places of learning. The study is comparative, relating cases from four different legal regimes (England, USA, Italy and Germany) that are taken from four (...) extensive ethnographic studies in defense lawyer’s firms. We will track down the failures of topoi at three different stages (pre-trial, trial, and deliberation) in our different legal regimes. Failing occurs in all proceedings in various modes and at different stages. We argue that those modes as well as the different stages at which they occur point at the spots in the respective procedures that allow for learning about the inherent conceptions of “good reasons.”. (shrink)

The purpose of this paper is twofold. First we want to extent a specific paranormal modal logic in such a way as obtain a paraconsistent and paracomplete multimodal logic able to formalize the notions of plausibility and certainty. With this logic at hand, and this is our second purpose, we shall use a modified version of Reiter‘s default logic to build a sort of inductive logic of plausibility and certainty able to represent some basic (...) principles of epistemic inductive reasoning, such as a negative autoepistemic principle, an `error-prone feature of induction' principle and a confirmation by enumeration principle. (shrink)

Ethics and Modality calls for a reevaluation of standard views of modality. I argue that, instead of understanding de re modal talk as tracking the modal properties of things in themselves, we must recognize the importance of prior conceptual priorities and interests in shaping our de re modal judgments. A consequence of this reevaluation is that de re modal claims are indeterminate in that there can be disagreement over a claim without either side having made any (...) factual, definitional or logical mistake. According to the standard view, necessities of identity are among the most secure of de re modalities. I show how determinations of whether Hesperus is Phosphorus, or Dr. Jekyll is Mr. Hyde can be disputed without either side falling into error. Disagreements are often ended by identifying a mistake underlying one or other of the opposing views, but indeterminacy undermines the chances for such principled resolution of disagreements concerning de re modal judgments. ;This reevaluation has important practical ramifications. I argue that the notion of loss, which has great ethical and legal significance, relies on a de re modal analysis. De re modal indeterminacy threatens our ability to defend those commonplace ethical and legal judgments that rely on the modally grounded notion of loss. It is possible for disputants to agree on all relevant facts, on the concepts being deployed, on logical principles and even on matters of ethical theory, and yet still, because of modal indeterminacy, find nothing to resolve their disagreement over an alleged loss. This is troubling when we allege that an act has resulted in a loss in order to justify moral condemnation, demands for compensation and the imposition of punishment. I outline some possible responses to these difficulties. Some options preserve a notion of loss, however I do not find these conservative responses promising. I argue that abandoning commonsense ideas about compensation and doing without the notion of loss can preserve what really matters in our everyday ethical and legal thinking. (shrink)

We introduce a novel modal logic, namely the doxastic μ-calculus with error control (DμCEC), and propose a formalization of probabilistic anonymity and oblivious transfer in the logic, and the validation of these formalizations on implementations formalized in probabilistic CCS. The distinguishing feature of our logic is to provide a combination of dynamic operators for belief (whence the attribute “doxastic”) with a control on the possible error of apprehension of the perceived reality, and for internalized probability. Both (...) operators are dynamic (non-monotonic) thanks to the possibility of combining them with temporal operators, and are parameterized with a lower and upper probability bound (the error control). (shrink)

Conditional logics were originally developed for the purpose of modeling intuitively correct modes of reasoning involving conditional—especially counterfactual—expressions in natural language. While the debate over the logic of conditionals is as old as propositional logic, it was the development of worlds semantics for modal logic in the past century that catalyzed the rapid maturation of the field. Moreover, like modal logic, conditional logic has subsequently found a wide array of uses, from the traditional (...) (e.g. counterfactuals) to the exotic (e.g. conditional obligation). Despite the close connections between conditional and modal logic, both the technical development and philosophical exploitation of the latter has outstripped that of the former, with the result that noticeable lacunae exist in the literature on conditional logic. My dissertation addresses a number of these underdeveloped frontiers, producing new technical insights and philosophical applications. -/- I contribute to the solution of a problem posed by Priest of finding sound and complete labeled tableaux for systems of conditional logic from Lewis' V-family. To develop these tableaux, I draw on previous work on labeled tableaux for modal and conditional logic; errors and shortcomings in recent work on this problem are identified and corrected. While modal logic has by now been thoroughly studied in non-classical contexts, e.g. intuitionistic and relevant logic, the literature on conditional logic is still overwhelmingly classical. Another contribution of my dissertation is a thorough analysis of intuitionistic conditional logic, in which I utilize both algebraic and worlds semantics, and investigate how several novel embedding results might shed light on the philosophical interpretation of both intuitionistic logic and conditional logic extensions thereof. -/- My dissertation examines deontic and connexive conditional logic as well as the underappreciated history of connexive notions in the analysis of conditional obligation. The possibility of interpreting deontic modal logics in such systems (via embedding results) serves as an important theoretical guide. A philosophically motivated proscription on impossible obligations is shown to correspond to, and justify, certain (weak) connexive theses. Finally, I contribute to the intensifying debate over counterpossibles, counterfactuals with impossible antecedents, and take—in contrast to Lewis and Williamson—a non-vacuous line. Thus, in my view, a counterpossible like "If there had been a counterexample to the law of the excluded middle, Brouwer would not have been vindicated" is false, not (vacuously) true, although it has an impossible antecedent. I exploit impossible (non-normal) worlds—originally developed to model non-normal modal logics—to provide non-vacuous semantics for counterpossibles. I buttress the case for non-vacuous semantics by making recourse to both novel technical results and theoretical considerations. (shrink)

English law gives the competent patient the right to refuse life-saving medical treatment, either contemporaneously or in an advance directive, and a physician commits a battery when treating a patient who validly refused treatment. However, with regard to the details of a physician's liability, many questions remain unanswered, and it is not at all clear under what circumstances a patient's tort action for unwanted life-saving treatment will succeed, and what remedies would be available to the patient. The article suggests that (...) a physician should be liable in battery for administering life-saving treatment, even if he/she had doubts about the validity of the patient's treatment refusal, unless a defence of reasonable mistake can be established. Furthermore, in case of a battery which resulted in keeping the patient alive, the patient should not only be able to claim nominal damages, but general and special damages, including mental and physical pain and suffering caused by the prolongation of the patient's life, should equally be available. (shrink)

This article studies seriously actualistic quantified modal logics. A key component of the language is an abstraction operator by means of which predicates can be created out of complex formulas. This facilitates proof of a uniform substitution theorem: if a sentence is logically true, then any sentence that results from substituting a predicate abstract for each occurrence of a simple predicate abstract is also logically true. This solves a problem identified by Kripke early in the modern semantic study of (...) quantified modal logic. A tableau proof system is presented and proved sound and complete with respect to logical truth. The main focus is on seriously actualistic T, an extension of T, but the results established hold also for systems based on other propositional modal logics. Following Menzel it is shown that the formal language studied also supports an actualistic account of truth simpliciter. (shrink)

In his latest book, Eric Scerri presents a completely original account of the nature of scientific progress. It consists of a holistic and unified approach in which science is seen as a living and evolving single organism. Instead of scientific revolutions featuring exceptionally gifted individuals, Scerri argues that the "little people" contribute as much as the "heroes" of science. To do this he examines seven case studies of virtually unknown chemists and physicists in the early 20th century quest to discover (...) the structure of the atom. They include the amateur scientist Anton van den Broek who pioneered the notion of atomic number as well as Edmund Stoner a then physics graduate student who provided the seed for Pauli's Exclusion Principle. Another case is the physicist John Nicholson who is virtually unknown and yet was the first to propose the notion of quantization of angular momentum that was soon put to good use by Niels Bohr. Instead of focusing on the logic and rationality of science, Scerri elevates the role of trial and error and multiple discovery and moves beyond the notion of scientific developments being right or wrong. While criticizing Thomas Kuhn's notion of scientific revolutions he agrees with Kuhn that science is not drawn towards an external truth but is rather driven from within. The book will enliven the long-standing debate on the nature of science, which has increasingly shied away from the big question of "what is science?". (shrink)

I distinguish a priori knowledge from a priori truths or statements. A priori knowledge either is evident or is derived from evident premisses by means of correct reasoning. An a priori statement is one that reflects features of the conceptual framework within which it is placed. The statement either describes semantic relations between concepts of the framework or it characterizes the application of the framework to experience and the world. An a priori statement is not necessarily part of anyone’s a (...) priori knowledge. I also distinguish empirical knowledge from empirical statements. Both statements and theories are empirical if they are designed to characterize features of experience and the world. Knowledge is empirical if it fits experience; thus, one must check to see whether it fits. We do not obtain knowledge of logical systems by rational insight of evident truths and careful deductions from evident truths. Adequate logical systems are developed by trial and error. Logical knowledge is empirical knowledge that is not generally a priori. It is empirical knowledge of a priori truths and principles of our conceptual systems. Logical systems are empirical theories of these truths and principles. (shrink)

Analytic philosophy in the mid-twentieth century underwent a major change of direction when a prior consensus in favour of extensionalism and descriptivism made way for approaches using direct reference, the necessity of identity, and modal logic. All three were first defended, in the analytic tradition, by one woman, Ruth Barcan Marcus. But analytic philosophers now tend to credit them to Kripke, or Kripke and Carnap. I argue that seeing Barcan Marcus in her historical context – one dominated by (...) extensionalism and descriptivism – allows us to see how revolutionary she was, in her work and influence on others. I focus on her debate with Quine, who found himself retreating to softened, and more viable, versions of his anti-modal arguments as a result. I make the case that Barcan's formal logic was philosophically well-motivated, connected to her views on reference, and well-matched to her overall views on ontology. Her nominalism led her to reject posits which could not be directly observed and named, such as possibilia. She conceived of modal calculi as facilitating counterfactual discourse about actual existents. I conclude that her contributions ought to be recognized as the first of their kind. Barcan Marcus must be awarded a central place in the canon of analytic philosophy. (shrink)

In artificial intelligence (AI), responses generated by machine-learning models (most often large language models) may be unfactual information presented as a fact. For example, a chatbot might state that the Mona Lisa was painted in 1815. Such phenomenon is called AI hallucinations, seeking inspiration from human psychology, with a great difference of AI ones being connected to unjustified beliefs (that is, AI “beliefs”) rather than perceptual failures). -/- AI hallucinations may have their source in the data itself, that is, the (...) source content, or in the training procedure, i.e. the way the knowledge was encoded in the model’s parameters, so that errors in encoding and decoding textual and non-textual representations can cause hallucinations. In this paper, we will observe how such errors come to life and how they might be mitigated. For this purpose, we will analyze the usability of justification logics, to behave as a proof checker for validating the correctness of large language models’ (LLM) responses. Justification logic was developed by S. Artemov, and later on mostly by Artemov and M. Fitting, deriving its main idea from the logic of proofs (LP): knowledge and belief modalities are seen as justification terms, i.e. t:X stands for t is a (proper) justification for X. Justification logic originated from attempts to create semantics for intuitionistic logic where proofs were the most proper justifications, but in further development, justification logic could be applied to different kinds of justifications). With the recent attempts to mitigate incorrect LLM responses, we will analyze various guardrails that are currently used for LLM responses, and see how the logic of justification may provide its benefits as an AI safety layer against false data. (shrink)

The Logic of Causation: Definition, Induction and Deduction of Deterministic Causality is a treatise of formal logic and of aetiology. It is an original and wide-ranging investigation of the definition of causation (deterministic causality) in all its forms, and of the deduction and induction of such forms. The work was carried out in three phases over a dozen years (1998-2010), each phase introducing more sophisticated methods than the previous to solve outstanding problems. This study was intended as part (...) of a larger work on causal logic, which additionally treats volition and allied cause-effect relations (2004). The Logic of Causation deals with the main technicalities relating to reasoning about causation. Once all the deductive characteristics of causation in all its forms have been treated, and we have gained an understanding as to how it is induced, we are able to discuss more intelligently its epistemological and ontological status. In this context, past theories of causation are reviewed and evaluated (although some of the issues involved here can only be fully dealt with in a larger perspective, taking volition and other aspects of causality into consideration, as done in Volition and Allied Causal Concepts). Phase I: Macroanalysis. Starting with the paradigm of causation, its most obvious and strongest form, we can by abstraction of its defining components distinguish four genera of causation, or generic determinations, namely: complete, partial, necessary and contingent causation. When these genera and their negations are combined together in every which way, and tested for consistency, it is found that only four species of causation, or specific determinations, remain conceivable. The concept of causation thus gives rise to a number of positive and negative propositional forms, which can be studied in detail with relative ease because they are compounds of conjunctive and conditional propositions whose properties are already well known to logicians. The logical relations (oppositions) between the various determinations (and their negations) are investigated, as well as their respective implications (eductions). Thereafter, their interactions (in syllogistic reasoning) are treated in the most rigorous manner. The main question we try to answer here is: is (or when is) the cause of a cause of something itself a cause of that thing, and if so to what degree? The figures and moods of positive causative syllogism are listed exhaustively; and the resulting arguments validated or invalidated, as the case may be. In this context, a general and sure method of evaluation called ‘matricial analysis’ (macroanalysis) is introduced. Because this (initial) method is cumbersome, it is used as little as possible – the remaining cases being evaluated by means of reduction. Phase II: Microanalysis. Seeing various difficulties encountered in the first phase, and the fact that some issues were left unresolved in it, a more precise method is developed in the second phase, capable of systematically answering most outstanding questions. This improved matricial analysis (microanalysis) is based on tabular prediction of all logically conceivable combinations and permutations of conjunctions between two or more items and their negations (grand matrices). Each such possible combination is called a ‘modus’ and is assigned a permanent number within the framework concerned (for 2, 3, or more items). This allows us to identify each distinct (causative or other, positive or negative) propositional form with a number of alternative moduses. This technique greatly facilitates all work with causative and related forms, allowing us to systematically consider their eductions, oppositions, and syllogistic combinations. In fact, it constitutes a most radical approach not only to causative propositions and their derivatives, but perhaps more importantly to their constituent conditional propositions. Moreover, it is not limited to logical conditioning and causation, but is equally applicable to other modes of modality, including extensional, natural, temporal and spatial conditioning and causation. From the results obtained, we are able to settle with formal certainty most of the historically controversial issues relating to causation. Phase III: Software Assisted Analysis. The approach in the second phase was very ‘manual’ and time consuming; the third phase is intended to ‘mechanize’ much of the work involved by means of spreadsheets (to begin with). This increases reliability of calculations (though no errors were found, in fact) – but also allows for a wider scope. Indeed, we are now able to produce a larger, 4-item grand matrix, and on its basis find the moduses of causative and other forms needed to investigate 4-item syllogism. As well, now each modus can be interpreted with greater precision and causation can be more precisely defined and treated. In this latest phase, the research is brought to a successful finish! Its main ambition, to obtain a complete and reliable listing of all 3-item and 4-item causative syllogisms, being truly fulfilled. This was made technically feasible, in spite of limitations in computer software and hardware, by cutting up problems into smaller pieces. For every mood of the syllogism, it was thus possible to scan for conclusions ‘mechanically’ (using spreadsheets), testing all forms of causative and preventive conclusions. Until now, this job could only be done ‘manually’, and therefore not exhaustively and with certainty. It took over 72’000 pages of spreadsheets to generate the sought for conclusions. This is a historic breakthrough for causal logic and logic in general. Of course, not all conceivable issues are resolved. There is still some work that needs doing, notably with regard to 5-item causative syllogism. But what has been achieved solves the core problem. The method for the resolution of all outstanding issues has definitely now been found and proven. The only obstacle to solving most of them is the amount of labor needed to produce the remaining (less important) tables. As for 5-item syllogism, bigger computer resources are also needed. (shrink)

Fundamental problems of the uses of formal techniques and of natural and instrumental practices have been raised again and again these past two decades, in many quarters and from varying viewpoints. We have brought a number of quite basic studies of these issues together in this volume, not linked con ceptually nor by any rigorously defined problematic, but rather simply some of the most interesting and even provocative of recent research accomplish ments. Most of these papers are derived from the (...) Boston Colloquium for the Philosophy of Science during 1973-80, the two exceptions being those of Karel Berka (on scales of measurement) and A. A. Zinov'ev (on a non-tradi tional theory of quantifiers). Just how intriguing these results (or conjectures?) seem to us may be seen from some brief quotations: (1) Judson Webb: ".... the abstract machine concept has many of the appropriate kinds of properties for modelling living, reproducing, rule following, self-reflecting, accident-prone, and lucky creatures... the a priori logical results relevant to the abstract machine concept, above all Godel's, could not conceivably have turned out any better for the mechanist. " (2) M. L. Dalla Chiara: "... modal interpretation (of quantum logic) shows clearly that it possesses a logical meaning which is quite independent of quantum mechanics. " (3) Isaac Levi: (as against Peirce and Popper) "... infallibilism is con sistent with corrigibilism, and a view which respects avoidance of error is an important desideratum for science. (shrink)

The simplest quantified modal logic combines classical quantification theory with the propositional modal logic K. The models of simple QML relativize predication to possible worlds and treat the quantifier as ranging over a single fixed domain of objects. But this simple QML has features that are objectionable to actualists. By contrast, Kripke-models, with their varying domains and restricted quantifiers, seem to eliminate these features. But in fact, Kripke-models also have features to which actualists object. Though these (...) philosophers have introduced variations on Kripke-models to eliminate their objectionable features, the most well-known variations all have difficulties of their own. The present authors reexamine simple QML and discover that, in addition to having a possibilist interpretation, it has an actualist interpretation as well. By introducing a new sort of existing abstract entity, the contingently nonconcrete, they show that the seeming drawbacks of the simplest QML are not drawbacks at all. Thus, simple QML is independent of certain metaphysical questions. (shrink)

Una interpretación particularmente influyente de la teoría de la implicación lógica de Bertrand Russell y Clarence I. Lewis es la propuesta por Quine en su artículo “Reply to Professor Marcus”. Allí Quine sostiene que la lógica modal de Lewis nació en pecado: el pecado de confundir uso con mención, ya que cuando se afirma que una oración implica lógicamente a otra, estas oraciones no están siendo usadas sino mencionadas. Según la interpretación de Quine, Clarence I. Lewis persistió en el (...) error de Russell, que consistió en confundir la implicación material con la implicación lógica, y confundió la implicación estricta con la implicación lógica. Estos ‘pecados’ de Russell y Lewis pueden entenderse mejor si se tiene en cuenta que tanto Lewis como Russell sostienen que los axiomas y los teoremas en un cálculo lógico se usan de dos maneras: (a) como premisas a partir de las cuales se obtienen nuevos teoremas, y (b) como reglas de inferencia mediante las cuales se obtienen nuevos teoremas. En efecto, estos autores suscriben la teoría del doble uso de los principios lógicos que parece originarse en la obra de Peano y que ha sido casi completamente ignorada en la literatura acerca de la historia de la lógica. -/- A particularly influential interpretation of Bertrand Russell’s and Clarence I. Lewis’s theory of logical implication is the one proposed by Quine in his article "Reply to Professor Marcus". In that article Quine argues that Lewis's modal logic was born in sin: the sin of confusing use with mention, since when it is stated that a sentence logically implies another sentence, these sentences are not being used but mentioned. According to Quine's interpretation, Clarence I. Lewis persisted in Russell's error, which consisted in confusing material implication with logical implication, and confused strict implication with logical implication. These 'sins' of Russell and Lewis can be better understood if we take into account that both logicians argue that the axioms and theorems in a logical calculus are used in two ways: (a) as premises from which new theorems are obtained, and (b) as rules of inference by which new theorems are obtained. In fact, these authors subscribe to the theory of the double use of logical principles that seems to originate in Peano's work and that has been almost completely ignored in the literature about the history of logic. (shrink)

The paper presents an alternative substitutional semantics for first-order modal logic which, in contrast to traditional substitutional (or truth-value) semantics, allows for a fine-grained explanation of the semantical behavior of the terms from which atomic formulae are composed. In contrast to denotational semantics, which is inherently reference-guided, this semantics supports a non-referential conception of modal truth and does not give rise to the problems which pertain to the philosophical interpretation of objectual domains (concerning, e.g., possibilia or trans-world (...) identity). The paper also proposes the notion of modality de nomine as an alternative to the denotational notion of modality de re. (shrink)

In Part 1 the reader is introduced to some standard systems of modal logic and encouraged through a series of exercises to become proficient in manipulating these logics. The emphasis is on possible world semantics for modal logics and the semantic emphasis is carried into the formal method, Jeffrey-style truth-trees. Standard truth-trees are extended in a simple and transparent way to take possible worlds into account. Part 2 systematically explores the applications of modal logic to (...) philosophical issues such as truth, time, processes, knowledge and belief, obligation and permission. Accessible, authoritative, and assured, Modal Logics and Philosophy requires no more background than the completion of a standard introductory logic course. It will be welcomed not only by students looking for a bridge between introductory logic texts and the high-level technical literature but as a guide to, and exploration of, work at the forefront of logic and philosophy. (shrink)