One of the open problems in the philosophy of information is whether there is an information logic (IL), different from epistemic (EL) and doxastic logic (DL), which formalises the relation “a is informed that p” (Iap) satisfactorily. In this paper, the problem is solved by arguing that the axiom schemata of the normal modal logic (NML) KTB (also known as B or Br or Brouwer’s system) are well suited to formalise the relation of “being informed”. After (...) having shown that IL can be constructed as an informational reading of KTB, four consequences of a KTB-based IL are explored: information overload; the veridicality thesis (Iap → p); the relation between IL and EL; and the Kp → Bp principle or entailment property, according to which knowledge implies belief. Although these issues are discussed later in the article, they are the motivations behind the development of IL. (shrink)

The logicality of language is the hypothesis that the language system has access to a ‘natural’ logic that can identify and filter out as unacceptable expressions that have trivial meanings—that is, that are true/false in all possible worlds or situations in which they are defined. This hypothesis helps explain otherwise puzzling patterns concerning the distribution of various functional terms and phrases. Despite its promise, logicality vastly over-generates unacceptability assignments. Most solutions to this problem rest on specific stipulations about the (...) properties of logical form—roughly, the level of linguistic representation which feeds into the interpretation procedures—and have substantial implications for traditional philosophical disputes about the nature of language. Specifically, contextualism and semantic minimalism, construed as competing hypotheses about the nature and degree of context-sensitivity at the level of logical form, suggest different approaches to the over-generation problem. In this paper, I explore the implications of pairing logicality with various forms of contextualism and semantic minimalism. I argue that to adequately solve the over-generation problem, logicality should be implemented in a constrained contextualist framework. (shrink)

Many philosophers have been attracted to the idea of using the logical form of a true sentence as a guide to the metaphysical grounds of the fact stated by that sentence. This paper looks at a particular instance of that idea: the widely accepted principle that disjunctions are grounded in their true disjuncts. I will argue that an unrestricted version of this principle has several problematic consequences and that it’s not obvious how the principle might be restricted in order to (...) avoid them. My suggestion is that, instead of trying to restrict the principle, we should distinguish between metaphysical and conceptual grounds and take the principle to apply exclusively to the latter. This suggestion, if correct, carries over to other prominent attempts at using logical form as a guide to ground. (shrink)

Leibniz argues that there must be a fundamental level of simple substances because composites borrow their reality from their constituents and not all reality can be borrowed. I contend that the underlying logic of this ‘borrowed reality argument’ has been misunderstood, particularly the rationale for the key premise that not all reality can be borrowed. Contrary to what has been suggested, the rationale turns neither on the alleged viciousness of an unending regress of reality borrowers nor on the Principle (...) of Sufficient Reason, but on the idea that composites are phenomena and thus can be real only insofar as they have a foundation in substances, from which they directly ‘borrow’ their reality. The claim that composites are phenomena rests in turn on Leibniz's conceptualism about relations. So understood, what initially looked like a disappointingly simple argument for simples turns out to be a rather rich and sophisticated one. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...) for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

At least since Aristotle’s famous 'sea-battle' passages in On Interpretation 9, some substantial minority of philosophers has been attracted to the doctrine of the open future--the doctrine that future contingent statements are not true. But, prima facie, such views seem inconsistent with the following intuition: if something has happened, then (looking back) it was the case that it would happen. How can it be that, looking forwards, it isn’t true that there will be a sea battle, while also being (...) true that, looking backwards, it was the case that there would be a sea battle? This tension forms, in large part, what might be called the problem of future contingents. A dominant trend in temporal logic and semantic theorizing about future contingents seeks to validate both intuitions. Theorists in this tradition--including some interpretations of Aristotle, but paradigmatically, Thomason (1970), as well as more recent developments in Belnap, et. al (2001) and MacFarlane (2003, 2014)--have argued that the apparent tension between the intuitions is in fact merely apparent. In short, such theorists seek to maintain both of the following two theses: (i) the open future: Future contingents are not true, and (ii) retro-closure: From the fact that something is true, it follows that it was the case that it would be true. It is well-known that reflection on the problem of future contingents has in many ways been inspired by importantly parallel issues regarding divine foreknowledge and indeterminism. In this paper, we take up this perspective, and ask what accepting both the open future and retro-closure predicts about omniscience. When we theorize about a perfect knower, we are theorizing about what an ideal agent ought to believe. Our contention is that there isn’t an acceptable view of ideally rational belief given the assumptions of the open future and retro-closure, and thus this casts doubt on the conjunction of those assumptions. (shrink)

This paper develops a new class of justification logic, the logic of epistemic entitlement. The logic of epistemic entitlement invokes the notion of epistemic entitlement in epistemology, and interprets a justification formula in the form of???? ∶???? as follows: the warrant???? entitles the agent to believe????. In the logic of epistemic entitlement, the formula???? ∶???? is true if and only if???? is true in all possible worlds entitled to be conceived by????. In contrast to the standard (...) epistemic semantics of justification logic, the formula???? ∶???? in Fitting’s model is true if and only if???? is true in all possible worlds that can be conceived of and satisfies the evidential condition: the epistemic state???? ∈ ℰ(????,????) that the epistemic agent is in. Thus, if???? is not a dead point in the model, the point model of???? cannot satisfy both formulas of the form???? ∶???? and????′∶ ¬????. Thus standard justification logic cannot characterize the conflicting beliefs of agents for different warrants. Instead, the logic of epistemic entitlement solves this problem by entitling agents to believe???? and ¬???? on two disjoint sets of possible worlds on????,???? and????′, respectively. ℳ,???? ⊩???? ∶???? if and only if ℳ,???? ⊩???? for every???? ∈????????????(????,????) with????????????. Such an epistemic entitlement in the paper is axiomatized into the logic J_???????????? and the validity of its axioms is verified. And a canonical model of J_???????????? is established to prove its completeness. Finally, extensions of J_???????????? are attempted to explore the logic of entitlement of belief J_EntD4 and logic of entitlement of knowledge J_EntT4. (shrink)

_Framing effects_ concern the having of different attitudes towards logically or necessarily equivalent contents. Framing is of crucial importance for cognitive science, behavioral economics, decision theory, and the social sciences at large. We model a typical kind of framing, grounded in (i) the structural distinction between beliefs activated in working memory and beliefs left inactive in long term memory, and (ii) the topic- or subject matter-sensitivity of belief: a feature of propositional attitudes which is attracting growing research attention. We introduce (...) a class of models featuring (i) and (ii) to represent, and reason about, agents whose belief states can be subject to framing effects. We axiomatize a logic which we prove to be sound and complete with respect to the class. (shrink)

Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth-conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the `logicality of language', accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter-examples consisting of acceptable tautologies and contradictions, the logicality of language is often paired (...) with an additional assumption according to which logical forms are radically underspecified: i.e., the language system can see functional terms but is `blind' to open class terms to the extent that different tokens of the same term are treated as if independent. This conception of logical form has profound implications: it suggests an extreme version of the modularity of language, and can only be paired with non-classical---indeed quite exotic---kinds of deductive systems. The aim of this paper is to show that we can pair the logicality of language with a different and ultimately more traditional account of logical form. This framework accounts for the basic acceptability patterns which motivated the logicality of language, can explain why some tautologies and contradictions are acceptable, and makes better predictions in key cases. As a result, we can pursue versions of the logicality of language in frameworks compatible with the view that the language system is not radically modular vis-a-vis its open class terms and employs a deductive system that is basically classical. (shrink)

In some recent works, Crupi and Iacona have outlined an analysis of ‘if’ based on Chrysippus’ idea that a conditional holds whenever the negation of its consequent is incompatible with its antecedent. This paper presents a sound and complete system of conditional logic that accommodates their analysis. The soundness and completeness proofs that will be provided rely on a general method elaborated by Raidl, which applies to a wide range of systems of conditional logic.

What follows is a summary of basic principles pertaining to the definitions used in constructing an ontology. A definition is a statement of necessary and sufficient conditions. What this means in the simplest case can be understood as follows. To say that ɸ‐ing is a necessary condition for being an A is just another way of saying that every A ɸ’s; to say that ɸ‐ing is a sufficient condition for being an A is just another way of saying (...) that everything that ɸ’s is an A. The goal in writing a definition is to specify a set of conditions of this sort which are all necessary, and which are jointly sufficient. (shrink)

A principle, according to which any scientific theory can be mathematized, is investigated. That theory is presupposed to be a consistent text, which can be exhaustedly represented by a certain mathematical structure constructively. In thus used, the term “theory” includes all hypotheses as yet unconfirmed as already rejected. The investigation of the sketch of a possible proof of the principle demonstrates that it should be accepted rather a metamathematical axiom about the relation of mathematics and reality. Its investigation needs philosophical (...) means. Husserl’s phenomenology is what is used, and then the conception of “bracketing reality” is modelled to generalize Peano arithmetic in its relation to set theory in the foundation of mathematics. The obtained model is equivalent to the generalization of Peano arithmetic by means of replacing the axiom of induction with that of transfinite induction. A comparison to Mach’s doctrine is used to be revealed the fundamental and philosophical reductionism of Husserl’s phenomenology leading to a kind of Pythagoreanism in the final analysis. Accepting or rejecting the principle, two kinds of mathematics appear differing from each other by its relation to reality. Accepting the principle, mathematics has to include reality within itself in a kind of Pythagoreanism. These two kinds are called in paper correspondingly Hilbert mathematics and Gödel mathematics. The sketch of the proof of the principle demonstrates that the generalization of Peano arithmetic as above can be interpreted as a model of Hilbert mathematics into Gödel mathematics therefore showing that the former is not less consistent than the latter, and the principle is an independent axiom. An information interpretation of Hilbert mathematics is involved. It is a kind of ontology of information. Thus the problem which of the two mathematics is more relevant to our being is discussed. An information interpretation of the Schrödinger equation is involved to illustrate the above problem. (shrink)

In this article, I outline a logic of design of a system as a specific kind of conceptual logic of the design of the model of a system, that is, the blueprint that provides information about the system to be created. In section two, I introduce the method of levels of abstraction as a modelling tool borrowed from computer science. In section three, I use this method to clarify two main conceptual logics of information inherited from modernity: Kant’s (...) transcendental logic of conditions of possibility of a system, and Hegel’s dialectical logic of conditions of in/stability of a system. Both conceptual logics of information analyse structural properties of given systems. Strictly speaking, neither is a conceptual logic of information about the conditions of feasibility of a system, that is, neither is a logic of information as a logic of design. So, in section four, I outline this third conceptual logic of information and then interpret the conceptual logic of design as a logic of requirements, by introducing the relation of “sufficientisation”. In the conclusion, I argue that the logic of requirements is exactly what we need in order to make sense of, and buttress, a constructionist approach to knowledge. (shrink)

Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary “propositional” logic should in general be the logic of subsets of a given universe set. Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of epimorphisms and monomorphisms—which is reflected in the duality between quotient objects and subobjects throughout algebra. If “propositional” logic is thus seen as (...) the logic of subsets of a universe set, then the question naturally arises of a dual logic of partitions on a universe set. This paper is an introduction to that logic of partitions dual to classical subset logic. The paper goes from basic concepts up through the correctness and completeness theorems for a tableau system of partition logic. (shrink)

Let PLω be the provability logic of IΔ0 + ω1. We prove some containments of the form L ⊆ PLω < Th(C) where L is the provability logic of PA and Th(C) is a suitable class of Kripke frames.

There is no abstract for this chapter. The following is a summary. -/- We distinguish between, explicit, inadvertent, and habitual racist actions. We argue that while inadvertent bigots and habitual racists are inclined to (sincerely) deny that they committed a racially motivated action, they have different reasons for their denial. Inadvertent bigots are denying it because, however deeply they search, they are not going to find any such motive. Habitual racists, by contrast, may hold explicit egalitarian attitudes but they are (...) nonetheless implicitly racially motivated. There is thus an implicit stressful conflict between their covert racist intentions and their overt egalitarian attitudes. While they aren’t aware of the source of this distress, cognitive dissonance theory predicts that they nevertheless will engage in dissonance-reducing strategies. Specifically, we argue that habitual racists will be inclined to confabulate a description of the action in non-racial terms. (shrink)

Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth‐conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the ‘logicality of language’, accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter‐examples consisting of acceptable tautologies and contradictions, the logicality of language is often paired (...) with an additional assumption according to which logical forms are radically underspecified: i.e., the language system can see functional terms but is ‘blind’ to open class terms to the extent that different tokens of the same term are treated as if independent. This conception of logical form has profound implications: it suggests an extreme version of the modularity of language, and can only be paired with non‐classical—indeed quite exotic—kinds of deductive systems. The aim of this paper is to show that we can pair the logicality of language with a different and ultimately more traditional account of logical form. This framework accounts for the basic acceptability patterns which motivated the logicality of language, can explain why some tautologies and contradictions are acceptable, and makes better predictions in key cases. As a result, we can pursue versions of the logicality of language in frameworks compatible with the view that the language system is not radically modular vis‐á‐vis its open class terms and employs a deductive system that is basically classical. (shrink)

Logics of joint strategic ability have recently received attention, with arguably the most influential being those in a family that includes Coalition Logic (CL) and Alternating-time Temporal Logic (ATL). Notably, both CL and ATL bypass the epistemic issues that underpin Schelling-type coordination problems, by apparently relying on the meta-level assumption of (perfectly reliable) communication between cooperating rational agents. Yet such epistemic issues arise naturally in settings relevant to ATL and CL: these logics are standardly interpreted on structures (...) where agents move simultaneously, opening the possibility that an agent cannot foresee the concurrent choices of other agents. In this paper we introduce a variant of CL we call Two-Player Strategic Coordination Logic (SCL2). The key novelty of this framework is an operator for capturing coalitional ability when the cooperating agents cannot share strategic information. We identify significant differences in the expressive power and validities of SCL2 and CL2, and present a sound and complete axiomatization for SCL2. We briefly address conceptual challenges when shifting attention to games with more than two players and stronger notions of rationality. (shrink)

Bilattices, introduced by Ginsberg as a uniform framework for inference in artificial intelligence, are algebraic structures that proved useful in many fields. In recent years, Arieli and Avron developed a logical system based on a class of bilattice-based matrices, called logical bilattices, and provided a Gentzen-style calculus for it. This logic is essentially an expansion of the well-known Belnap–Dunn four-valued logic to the standard language of bilattices. Our aim is to study Arieli and Avron’s logic from the (...) perspective of abstract algebraic logic . We introduce a Hilbert-style axiomatization in order to investigate the properties of the algebraic models of this logic, proving that every formula can be reduced to an equivalent normal form and that our axiomatization is complete w.r.t. Arieli and Avron’s semantics. In this way, we are able to classify this logic according to the criteria of AAL. We show, for instance, that it is non-protoalgebraic and non-self-extensional. We also characterize its Tarski congruence and the class of algebraic reducts of its reduced generalized models, which in the general theory of AAL is usually taken to be the algebraic counterpart of a sentential logic. This class turns out to be the variety generated by the smallest non-trivial bilattice, which is strictly contained in the class of algebraic reducts of logical bilattices. On the other hand, we prove that the class of algebraic reducts of reduced models of our logic is strictly included in the class of algebraic reducts of its reduced generalized models. Another interesting result obtained is that, as happens with some implicationless fragments of well-known logics, we can associate with our logic a Gentzen calculus which is algebraizable in the sense of Rebagliato and Verdú . We also prove some purely algebraic results concerning bilattices, for instance that the variety of distributive bilattices is generated by the smallest non-trivial bilattice. This result is based on an improvement of a theorem by Avron stating that every bounded interlaced bilattice is isomorphic to a certain product of two bounded lattices. We generalize it to the case of unbounded interlaced bilattices. (shrink)

Theories of epistemic justification are commonly assessed by exploring their predictions about particular hypothetical cases – predictions as to whether justification is present or absent in this or that case. With a few exceptions, it is much less common for theories of epistemic justification to be assessed by exploring their predictions about logical principles. The exceptions are a handful of ‘closure’ principles, which have received a lot of attention, and which certain theories of justification are well known to invalidate. But (...) these closure principles are only a small sample of the logical principles that we might consider. In this paper, I will outline four further logical principles that plausibly hold for justification and two which plausibly do not. While my primary aim is just to put these principles forward, I will use them to evaluate some different approaches to justification and (tentatively) conclude that a ‘normic’ theory of justification best captures its logic. (shrink)

The classical theory of computation does not represent an adequate model of reality for simulation in the social sciences. The aim of this paper is to construct a methodological perspective that is able to conciliate the formal and empirical logic of program verification in computer science, with the interpretative and multiparadigmatic logic of the social sciences. We attempt to evaluate whether social simulation implies an additional perspective about the way one can understand the concepts of program and computation. (...) We demonstrate that the logic of social simulation implies at least two distinct types of program verifications that reflect an epistemological distinction in the kind of knowledge one can have about programs. Computer programs seem to possess a causal capability (Fetzer, 1999) and an intentional capability that scientific theories seem not to possess. This distinction is associated with two types of program verification, which we call empirical and intentional verification. We demonstrate, by this means, that computational phenomena are also intentional phenomena, and that such is particularly manifest in agent-based social simulation. Ascertaining the credibility of results in social simulation requires a focus on the identification of a new category of knowledge we can have about computer programs. This knowledge should be considered an outcome of an experimental exercise, albeit not empirical, acquired within a context of limited consensus. The perspective of intentional computation seems to be the only one possible to reflect the multiparadigmatic character of social science in terms of agent-based computational social science. We contribute, additionally, to the clarification of several questions that are found in the methodological perspectives of the discipline, such as the computational nature, the logic of program scalability, and the multiparadigmatic character of agent-based simulation in the social sciences. (shrink)

In the present paper we propose a system of propositional logic for reasoning about justification, truthmaking, and the connection between justifiers and truthmakers. The logic of justification and truthmaking is developed according to the fundamental ideas introduced by Artemov. Justifiers and truthmakers are treated in a similar way, exploiting the intuition that justifiers provide epistemic grounds for propositions to be considered true, while truthmakers provide ontological grounds for propositions to be true. This system of logic is then (...) applied both for interpreting the notorious definition of knowledge as justified true belief and for advancing a new solution to Gettier counterexamples to this standard definition. (shrink)

The purpose of this paper is twofold: (1) to clarify Ludwig Wittgenstein’s thesis that colours possess logical structures, focusing on his ‘puzzle proposition’ that “there can be a bluish green but not a reddish green”, (2) to compare modeltheoretical and gametheoretical approaches to the colour exclusion problem. What is gained, then, is a new gametheoretical framework for the logic of ‘forbidden’ (e.g., reddish green and bluish yellow) colours. My larger aim is to discuss phenomenological principles of the demarcation of (...) the bounds of logic as formal ontology of abstract objects. (shrink)

A general theory of logical oppositions is proposed by abstracting these from the Aristotelian background of quantified sentences. Opposition is a relation that goes beyond incompatibility (not being true together), and a question-answer semantics is devised to investigate the features of oppositions and opposites within a functional calculus. Finally, several theoretical problems about its applicability are considered.

Is logic normative for reasoning? In the wake of work by Gilbert Harman and John MacFarlane, this question has been reduced to: are there any adequate bridge principles which link logical facts to normative constraints on reasoning? Hitherto, defenders of the normativity of logic have exclusively focussed on identifying adequate validity bridge principles: principles linking validity facts—facts of the form 'gamma entails phi'—to normative constraints on reasoning. This paper argues for two claims. First, for the time being (...) at least, Harman’s challenge cannot be surmounted by articulating validity bridge principles. Second, Harman’s challenge can be met by articulating invalidity bridge principles: principles linking invalidity facts of the form 'gamma does not entail phi' to normative constraints on reasoning. In doing so, I provide a novel defence of the normativity of logic. (shrink)

An interesting question is whether deflationism about truth (and falsity) extends to related properties and relations on truthbearers. Lionel Shapiro (2011) answers affirmatively by arguing that a certain deflationism about truth is as plausible as an analogous version of deflationism about logical consequence. I argue that the argument fails on two counts. First, it trivializes to any relation between truthbearers, including substantive ones; in other words, his argument can be used to establish that deflationism about truth is as plausible as (...) deflationism about an arbitrary sentential relation. Second, the alleged analogy between the arguments for deflationism about truth and deflationism about consequence fails. Along the way I consider what implications the failure of the equiplausibility thesis has for deflationism about falsity. (shrink)

In this paper I propose and motivate a logic of the interdefined concepts of making true and control, understood as intensional propositional operators to be indexed to an agent. While bearing a resemblance to earlier logics in the tradition, the motivations, semantics, and object language theory differ on crucial points. Applying this logic to widespread formal theories of agency, I use it as a framework to argue against the ubiquitous assumption that the strongest actions or options available to (...) a given agent must always be pairwise incompatible. The conclusion is that this assumption conflicts with failures of higher order control of agents over their degree or precision of control, failures exhibited by such imperfect agents as ourselves. I discuss models in this setting for understanding such imperfectly self-controlling agents. In an appendix, I prove several relevant results about the logic described, including soundness and completeness both for it and for certain natural extensions. (shrink)

I want to model a finite, fallible cognitive agent who imagines that p in the sense of mentally representing a scenario—a configuration of objects and properties—correctly described by p. I propose to capture imagination, so understood, via variably strict world quantifiers, in a modal framework including both possible and so-called impossible worlds. The latter secure lack of classical logical closure for the relevant mental states, while the variability of strictness captures how the agent imports information from actuality in the imagined (...) non-actual scenarios. Imagination turns out to be highly hyperintensional, but not logically anarchic. Section 1 sets the stage and impossible worlds are quickly introduced in Sect. 2. Section 3 proposes to model imagination via variably strict world quantifiers. Section 4 introduces the formal semantics. Section 5 argues that imagination has a minimal mereological structure validating some logical inferences. Section 6 deals with how imagination under-determines the represented contents. Section 7 proposes additional constraints on the semantics, validating further inferences. Section 8 describes some welcome invalidities. Section 9 examines the effects of importing false beliefs into the imagined scenarios. Finally, Sect. 10 hints at possible developments of the theory in the direction of two-dimensional semantics. (shrink)

In his article “Issues of Pragmaticism” published in 1905, in The Monist, Charles S. Peirce complains that “Logicians have been at fault in giving Vagueness the go-by, so far as not even to analyze it.” That same year, occupying himself with the consequences of “Critical commonsensism,” he affirmed, “I have worked out the logic of vagueness with something like completeness,” a statement that causes the majority of the commentators on his work, including the editors of the Collected Papers to (...) ask where this logic is to be found. The fever for finding Peirce's manuscripts is fed by the hope of some researchers of discovering the logic of vagueness, a hope that has grown since Carolyn Eisele's publication of his mathematical works. Others - and I count myself among them - believe that in reality this is a matter of something already known. That is, they interpret the affirmation ending the paragraph of reproach addressed to logicians, “The present writer has done his best to work out the Stechiology, Critic, and Methodeutik of the subject,” as a tripartite semiotic of the vague, still limited, according to Peirce's older works, to symbols, that is, to the signs of natural language examined from the perspective of logic. (shrink)

I introduce a formalization of probability which takes the concept of 'evidence' as primitive. In parallel to the intuitionistic conception of truth, in which 'proof' is primitive and an assertion A is judged to be true just in case there is a proof witnessing it, here 'evidence' is primitive and A is judged to be probable just in case there is evidence supporting it. I formalize this outlook by representing propositions as types in Martin-Lof type theory (MLTT) and defining a (...) 'probability type' on top of the existing machinery of MLTT, whose inhabitants represent pieces of evidence in favor of a proposition. One upshot of this approach is the potential for a mathematical formalism which treats 'conjectures' as mathematical objects in their own right. Other intuitive properties of evidence occur as theorems in this formalism. (shrink)

Book review of 'More Kinds of Being: A Further Study of Individuation, Identity, and the Logic of Sortal Terms'. By E. J. LOWE.

This is a commentary on MM McCabe's "First Chop your logos... Socrates and the sophists on language, logic, and development". In her paper MM analyses Plato's Euthydemos, in which Plato tackles the problem of falsity in a way that takes into account the speaker and complements the Sophist's discussion of what is said. The dialogue looks as if it is merely a demonstration of the silly consequences of eristic combat. And so it is. But a main point of MM's (...) paper is that there is serious philosophy in the Euthydemos, too. MM argues that to counter the sophist brothers Euthydemos and Dionysodoros, Socrates points out that that there are different aspects to the verb 'to say' that run in parallel to the different aspects of the very 'to learn'. So just as there is continuity rather than ambiguity between 'to learn' and 'to understand', so there is continuity between the different aspects of saying. Thus Socrates puts forward a teleological account of both learning and meaning. Following up on some of MM's thoughts, I argue that the sophists subscribe, despite appearance, to a theory of meaning that respects serious and widely accepted philosophical theses on meaning. -/- Forthcoming in the Australasian Philosophical Review. The curator of the volume is Fiona Leigh, and the committee also has Hugh Benson and Tim Clarke. You can find MM's paper as well as the commentaries by Nicholas Denyer and Russell E. Jones and Ravi Sharma (and myself) by registering. (shrink)

Darwiche and Pearl’s seminal 1997 article outlined a number of baseline principles for a logic of iterated belief revision. These principles, the DP postulates, have been supplemented in a number of alternative ways. Most suggestions have resulted in a form of ‘reductionism’ that identifies belief states with orderings of worlds. However, this position has recently been criticised as being unacceptably strong. Other proposals, such as the popular principle (P), aka ‘Independence’, characteristic of ‘admissible’ operators, remain commendably more modest. (...) In this paper, we supplement the DP postulates and (P) with a number of novel conditions. While the DP postulates constrain the relation between a prior and a posterior conditional belief set, our new principles notably govern the relation between two posterior conditional belief sets obtained from a common prior by different revisions. We show that operators from the resulting family, which subsumes both lexicographic and restrained revision, can be represented as relating belief states associated with a ‘proper ordinal interval’ (POI) assignment, a structure more fine-grained than a simple ordering of worlds. We close the paper by noting that these operators satisfy iterated versions of many AGM era postulates, including Superexpansion, that are not sound for admissible operators in general. (shrink)

Both Heidegger and Wittgenstein consider the possibility of a philosophical inquiry of an absolutely universal scope—an inquiry into the being of all beings, in Heidegger’s case, and into the logical form of everything that can be meaningfully said, in Wittgenstein’s. Moreover, they both raise the worry that the theoretical language by means of which we speak of particular beings and assert particular facts is not suited to this task. And yet their own philosophical work seems to include many assertions (...) of ordinary, theoretical language. Are they being inconsistent? Or are they hoping to use theoretical language in a way that conveys what cannot be said in that language? Much of the scholarship on each of these thinkers takes the form of one of the two horns of this dilemma. In the context of Wittgenstein scholarship, however, a third alternative has been proposed: the Resolute Reading of the Tractatus. My aim is to establish the availability of a similar solution to Heidegger’s predicament. It will emerge that Heidegger rejects the possibility of a theoretical account of being and pursues a project of a radically different sort, whose goal is to bring about a transformation of our fundamental relation to being. (shrink)

Intuitionistic logic provides an elegant solution to the Sorites Paradox. Its acceptance has been hampered by two factors. First, the lack of an accepted semantics for languages containing vague terms has led even philosophers sympathetic to intuitionism to complain that no explanation has been given of why intuitionistic logic is the correct logic for such languages. Second, switching from classical to intuitionistic logic, while it may help with the Sorites, does not appear to offer any advantages (...) when dealing with the so-called paradoxes of higher-order vagueness. We offer a proposal that makes strides on both issues. We argue that the intuitionist’s characteristic rejection of any third alethic value alongside true and false is best elaborated by taking the normal modal system S4M to be the sentential logic of the operator ‘it is clearly the case that’. S4M opens the way to an account of higher-order vagueness which avoids the paradoxes that have been thought to infect the notion. S4M is one of the modal counterparts of the intuitionistic sentential calculus and we use this fact to explain why IPC is the correct sentential logic to use when reasoning with vague statements. We also show that our key results go through in an intuitionistic version of S4M. Finally, we deploy our analysis to reply to Timothy Williamson’s objections to intuitionistic treatments of vagueness. (shrink)

This short essay attempts to challenge some of widely held philosophical assumptions on the nature of the relationship between logic, language and reality. In Section 1 the hegemony of theoretical logic is being questioned; Section 2 proposes a hypothesis on socially mediated semantics; Section 3 addresses the problem of ontology of logical sentential moods.

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)

The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case of QmbC, (...) the simpler quantified LFI expanding classical logic, will be analyzed in detail. An axiomatic extension of QmbC called QLFI1o is also studied, which is equivalent to the quantified version of da Costa and D'Ottaviano 3-valued logic J3. The semantical structures for this logic turn out to be Tarkian structures based on twist structures. The expansion of QmbC and QLFI1o with a standard equality predicate is also considered. (shrink)

The logic of academic writing is the argumentative strategy on which our papers, our sections, and our paragraphs are based. It is a strategy, as it is a plan that connects different steps and has a specific goal, namely convincing the audience of an original and important idea. And it is argumentative, for two reasons. First, we can defend our idea and we can convince our audience only through arguments, which only in very few disciplines are formal deductions. In (...) most cases, the arguments that we use are based on premises accepted by a community and the conclusions are drawn from principles that in the ancient dialectics were called “maxims,” principles shared by everyone. Second, a paper is a dialogue between the author and his or her readers. An idea can be considered as interesting and worth reading only when it addresses a topic that is perceived as important by the readers and tackles a problem that is open and needs to be solved. Our arguments are acceptable when they start from the premises of our community of readers, avoiding repeating what is obvious for them or taking for granted what is obscure or unknown to them. In this book, we present the argumentative approach to academic writing that we used in classroom. What characterizes it and makes it unique is the perspective that is adopted. We do not start from preexisting ideas that only need to be presented in a way that is suitable to an academic public. We intend to show that writing academically is a consequence of thinking academically, or rather “strategically.” We want to explain how the linguistic and presentational devices are the result of a much deeper plan underlying them, and how mastering the logic of a paper leads to understanding and even developing academic styles. The logic of academic writing is not aimed at teaching how to use language and write texts academically, but at enabling readers to create their own style based on their own argumentative strategies. (shrink)

In this historical article, Newton da Costa discusses Francisco Miró Quesada’s philosophical ideas about logic. He discusses the topics of reason, logic, and action in Miró Quesada’s work, and in the final section he offers his critical view. In particular, he disagrees with Miró Quesada’s stance on the historicity of reason, for whom “reason is essentially absolute”, whereas for da Costa it “is being constructed in the course of history”. Da Costa concludes by emphasizing the importance of (...) Miró Quesada’s theory of logic and reason, despite it still being incomplete. -/- Historical article by Newton da Costa, annotated and translated by J. C. Cifuentes and L. F. Bartolo Alegre. (shrink)

In this paper we present a philosophical motivation for the logics of formal inconsistency, a family of paraconsistent logics whose distinctive feature is that of having resources for expressing the notion of consistency within the object language in such a way that consistency may be logically independent of non-contradiction. We defend the view according to which logics of formal inconsistency may be interpreted as theories of logical consequence of an epistemological character. We also argue that in order to philosophically justify (...) paraconsistency there is no need to endorse dialetheism, the thesis that there are true contradictions. Furthermore, we show that mbC, a logic of formal inconsistency based on classical logic, may be enhanced in order to express the basic ideas of an intuitive interpretation of contradictions as conflicting evidence. (shrink)

This article develops a logical (or semantic) response to scepticism about the existence of an external world. Specifically, it is argued that any doubt about the existence of an external world can be proved to be false, but whatever appears to be doubt about the existence of an external world that _cannot_ be proved to be false is nonsense, insofar as it must rely on the assertion of something that is logically impossible. The article further suggests that both G. E. (...) Moore and Ludwig Wittgenstein worked towards the same solution but left their work unfinished. (shrink)

According to the reading of Spinoza that Gilles Deleuze presents in Expressionism in Philosophy: Spinoza, Spinoza's philosophy should not be represented as a moment that can be simply subsumed and sublated within the dialectical progression of the history of philosophy, as it is figured by Hegel in the Science of Logic, but rather should be considered as providing an alternative point of view for the development of a philosophy that overcomes Hegelian idealism. Indeed, Deleuze demonstrates, by means of Spinoza, (...) that a more complex philosophy antedates Hegel's which cannot be supplanted by it. Spinoza therefore becomes a significant figure in Deleuze's project of tracing an alternative lineage in the history of philosophy, which, by distancing itself from Hegelian idealism, culminates in the construction of a philosophy of difference. Deleuze presents Spinoza's metaphysics as determined according to a 'logic of expression', which, insofar as it contributes to the determination of a philosophy of difference, functions as an alternative to the Hegelian dialectical logic. Deleuze's project in Expressionism in Philosophy is therefore to redeploy Spinoza in order to mobilize his philosophy of difference as an alternative to the dialectical philosophy determined by the Hegelian dialectic logic. (shrink)

The aim of this paper is to provide an intuitive semantics for systems of justification logic which allows us to cope with the distinction between implicit and explicit justifiers. The paper is subdivided into three sections. In the first one, the distinction between implicit and explicit justifiers is presented and connected with a proof-theoretic distinction between two ways of interpreting sequences of sentences; that is, as sequences of axioms in a certain set and as sequences proofs constructed from that (...) set of axioms. In the second section, a basic system of justification logic for implicit and explicit justifiers is analyzed and some significant facts about it are proved. In the final section, an adequate semantics is proposed, and the system is proved to be sound and complete whit respect to it. (shrink)

This paper presents two systems of natural deduction for the rejection of non-tautologies of classical propositional logic. The first system is sound and complete with respect to the body of all non-tautologies, the second system is sound and complete with respect to the body of all contradictions. The second system is a subsystem of the first. Starting with Jan Łukasiewicz's work, we describe the historical development of theories of rejection for classical propositional logic. Subsequently, we present the two (...) systems of natural deduction and prove them to be sound and complete. We conclude with a ‘Theorem of Inversion’. (shrink)

Suppose that a sign at the entrance of a hotel reads: “Don’t enter these premises unless you are accompanied by a registered guest”. You see someone who is about to enter, and you tell her: “Don’t enter these premises if you are an unaccompanied registered guest”. She asks why, and you reply: “It follows from what the sign says”. It seems that you made a valid inference from an imperative premise to an imperative conclusion. But it also seems that imperatives (...) cannot be true or false, so what does it mean to say that your inference is valid? It cannot mean that the truth of its premise guarantees the truth of its conclusion. One is thus faced with what is known as “Jørgensen’s dilemma” (Ross 1941: 55-6): it seems that imperative logic cannot exist because logic deals only with entities that, unlike imperatives, can be true or false, but it also seems that imperative logic must exist. It must exist not only because inferences with imperatives can be valid, but also because imperatives (like “Enter” and “Don’t enter”) can be inconsistent with each other, and also because one can apply logical operations to imperatives: “Don’t enter” is the negation of “Enter”, and “Sing or dance” is the disjunction of “Sing” and “Dance”. A standard reaction to this dilemma consists in basing imperative logic on analogues of truth and falsity. For example, the imperative “Don’t enter” is satisfied if you don’t enter and is violated if you enter, and one might say that an inference from an imperative premise to an imperative conclusion is valid exactly if the satisfaction (rather than the truth) of the premise guarantees the satisfaction of the conclusion. But before getting into the details, more needs to be said on what exactly imperatives are. (shrink)

The verb ‘to know’ can be used both in ascriptions of propositional knowledge and ascriptions of knowledge of acquaintance. In the formal epistemology literature, the former use of ‘know’ has attracted considerable attention, while the latter is typically regarded as derivative. This attitude may be unsatisfactory for those philosophers who, like Russell, are not willing to think of knowledge of acquaintance as a subsidiary or dependent kind of knowledge. In this paper we outline a logic of knowledge of acquaintance (...) in which ascriptions like ‘Mary knows Smith’ are regarded as formally interesting in their own right, remaining neutral on their relation to ascriptions of propositional knowledge. The resulting logical framework, which is based on Hintikka’s modal approach to epistemic logic, provides a fresh perspective on various issues and notions at play in the philosophical debate on acquaintance. (shrink)

In his Science of Logic Hegel purports to give an account of a dialectical logic that generates the totality of being’s fundamental structures. This totality does not exhaust the richness of being, but it exhausts the basis of this richness. Any phenomenon, whether cognitive, scientific, social or political, is based upon some or all of those structures. The paper presents and examines the logic of a structure which pervades each and every phenomenon: the border(die Grenze). (...) It is analyzed as an advanced manifestation of “determinateness,” an even more primitive structure of being, which makes explicit its intrinsic connection with not-being. What is distinctive about Hegel’s analysis is that it establishes a logical character concerning the concept of “border” that precedes empirical observation and a connection with space. The aim of the paper is to reconstruct Hegel’s dialectic of the border in such a way as to make this logical character apparent and convincing to contemporary audience, who begin from the assumption that all discourse about border has an empirical basis and presupposes reference to space. It will be argued that, contrary to received opinion, the very phenomenon of “border” has certain universal and necessary features which explain its very possibility, are completely a priori and are established prior to any reference to space. A discussion about “borders” that excludes any a priori investigation into this phenomenon from its domain simply fails to illuminate its most important dimension: its logical core or, if you will, its universal and necessary attributes. (shrink)

This paper investigates and develops generalizations of two-dimensional modal logics to any finite dimension. These logics are natural extensions of multidimensional systems known from the literature on logics for a priori knowledge. We prove a completeness theorem for propositional n-dimensional modal logics and show them to be decidable by means of a systematic tableau construction.