This paper corrects a mistake I saw students make but I have yet to see in print. The mistake is thinking that logically equivalent propositions have the same counterexamples—always. Of course, it is often the case that logically equivalent propositions have the same counterexamples: “every number that is prime is odd” has the same counterexamples as “every number that is not odd is not prime”. The set of numbers satisfying “prime but not odd” is the same as the set of (...) numbers satisfying “not odd but not not-prime”. The mistake is thinking that every two logically-equivalent false universal propositions have the same counterexamples. Only false universal propositions have counterexamples. A counterexample for “every two logically-equivalent false universal propositions have the same counterexamples” is two logically-equivalent false universal propositions not having the same counterexamples. The following counterexample arose naturally in my sophomore deductive logic course in a discussion of inner and outer converses. “Every even number precedes every odd number” is counterexemplified only by even numbers, whereas its equivalent “Every odd number is preceded by every even number” is counterexemplified only by odd numbers. Please let me know if you see this mistake in print. Also let me know if you have seen these points discussed before. I learned them in my own course: talk about learning by teaching! (shrink)

Philosophers of science often assume that logically equivalent theories are theoretically equivalent. I argue that two theses, anti-exceptionalism about logic (which says, roughly, that logic is not a priori, that it is revisable, and that it is not special or set apart from other human inquiry) and logical realism (which says, roughly, that differences in logic reflect genuine metaphysical differences in the world), make trouble for both this commitment and the closely related commitment to theories being closed under (...) class='Hi'>logical consequence. I provide three arguments. The first two show that anti-exceptionalism about logic provides an epistemic challenge to both the closure and the equivalence claims; the third shows that logical realism provides a metaphysical challenge to both the closure and the equivalence claims. Along the way, I show that there are important methodological upshots for metaphysicians and philosophers of logic. In particular, there are lessons to be drawn about certain conceptions of naturalism as constraining the possibilities for metaphysics and the philosophy of logic. (shrink)

The theme of this study is about establishing a purely logical theory about the Universe. Logic is the premier candidate for the reality behind phenomena. If there is a final theory, the Universe must be logic itself, called pure logic, elements of which include not only logic and illogic but also logical and illogical manipulations between them. The kernel is the revised law of the excluded middle: between two basic concepts are four possible manipulations, three logical and (...) one illogical, whereas only one is realized. The key parameter for an element is aim, including reason, outcome, and neutrality. When an element is a contradiction, it can be located at three positions: reason, outcome, and manipulation, corresponding to three colors of quark. Thus, there is interaction with the SU(3) symmetry keeping the number of the three elements balanced locally. A proposition without contradiction has two independent aims. When one aim changes, there is interaction with the U(1) symmetry. When two aims change together, there is interaction with the SU(2) symmetry. (shrink)

The Concept of Life and Death of Chuang-tzu have inherited and developed Confucianism and Taoism thoughts, establishing Ontological foundation of "Life - Body", distinguishing the transcendental concept of "Dead Heart" and the empirical concept of "Death Body", as well as proposing the thought of "Equivalence of Life and Death" finally. The logic Reasoning of Chuang-tzu "Equivalence of Life and Death", start from constructing the equal status of "Life" and “Death" from ontological argument. Life and Death then are reduced (...) to be a natural phenomenon to dispel its mystery. With emphasizing the social connotation of life and death, the difference between them has been removed, and finally the Thought experiment of "Chuang-tzu dreaming butterfly" has deepened the idea of "Equivalence of Life and Death". The Ideological Characteristic of the Concept of Life and Death of Chuang-tzu mainly reflects in the aspects of Ontology, Epistemology and Ethical practice. (shrink)

Formal criteria of theoretical equivalence are mathematical mappings between specific sorts of mathematical objects, notably including those objects used in mathematical physics. Proponents of formal criteria claim that results involving these criteria have implications that extend beyond pure mathematics. For instance, they claim that formal criteria bear on the project of using our best mathematical physics as a guide to what the world is like, and also have deflationary implications for various debates in the metaphysics of physics. In this (...) paper, I investigate whether there is a defensible view according to which formal criteria have significant non-mathematical implications, of these sorts or any other, reaching a chiefly negative verdict. Along the way, I discuss various foundational issues concerning how we use mathematical objects to describe the world when doing physics, and how this practice should inform metaphysics. I diagnose the prominence of formal criteria as stemming from contentious views on these foundational issues, and endeavor to motivate some alternative views in their stead. (shrink)

I investigate syntactic notions of theoretical equivalence between logical theories and a recent objection thereto. I show that this recent criticism of syntactic accounts, as extensionally inadequate, is unwarranted by developing an account which is plausibly extensionally adequate and more philosophically motivated. This is important for recent anti-exceptionalist treatments of logic since syntactic accounts require less theoretical baggage than semantic accounts.

A consequence relation is strongly classical if it has all the theorems and entailments of classical logic as well as the usual meta-rules (such as Conditional Proof). A consequence relation is weakly classical if it has all the theorems and entailments of classical logic but lacks the usual meta-rules. The most familiar example of a weakly classical consequence relation comes from a simple supervaluational approach to modelling vague language. This approach is formally equivalent to an account of logical consequence (...) according to which α1, ..., αn entails β just in case □α1, ..., □αn entails □β in the modal logic S5. This raises a natural question: If we start with a different underlying modal logic, can we generate a strongly classical logic? This paper explores this question. In particular, it discusses four related technical issues: (1) Which base modal logics generate strongly classical logics and which generate weakly classical logics? (2) Which base logics generate themselves? (3) How can we directly characterize the logic generated from a given base logic? (4) Given a logic that can be generated, which base logics generate it? The answers to these questions have philosophical interest. They can help us to determine whether there is a plausible supervaluational approach to modelling vague language that yields the usual meta-rules. They can also help us to determine the feasibility of other philosophical projects that rely on an analogous formalism, such as the project of defining logical consequence in terms of the preservation of an epistemic status. (shrink)

When are two formal theories of broadly logical concepts, such as truth, equivalent? The paper investigates a case study, involving two well-known variants Kripke-Feferman truth. The first, KF+CONS, features a consistent but partial truth predicate. The second, KF+COMP, an inconsistent but complete truth predicate. It is well-known that the two truth predicates are dual to each other. We show that this duality reveals a much stricter correspondence between the two theories: they are intertraslatable. Intertranslatability under natural assumptions coincides with (...) definitional equivalence, and is arguably the strictest notion of theoretical equivalence different from logical equivalence. The case of KF+CONS and KF+COMP raises a puzzle: the two theories can be proved to be strictly related, yet they appear to embody remarkably different conceptions of truth. We discuss the significance of the result for the broader debate on formal criteria of conceptual reducibility for theories of truth. (shrink)

A system of logic usually comprises a language for which a model-theory and a proof-theory are defined. The model-theory defines the semantic notion of model-theoretic logical consequence (⊨), while the proof-theory defines the proof- theoretic notion of logical consequence (or logical derivability, ⊢). If the system in question is sound and complete, then the two notions of logical consequence are extensionally equivalent. The concept of full formalization is a more restrictive one and requires in addition the (...) preservation of the standard meanings of the logical terms in all the admissible interpretations of the logical calculus, as it is proof-theoretically defined. Although classical first-order logic is sound and complete, its standard formalizations fall short to be full formalizations since they allow non-intended interpretations. This fact poses a challenge for the logical inferentialism program, whose main tenet is that the meanings of the logical terms are uniquely determined by the formal axioms or rules of inference that govern their use in a logical calculus, i.e., logical inferentialism requires a categorical calculus. This paper is the first part of a more elaborated study which will analyze the categoricity problem from its beginning until the most recent approaches. I will first start by describing the problem of a full formalization in the general framework in which Carnap (1934/1937, 1943) formulated it for classical logic. Then, in sections IV and V, I shall discuss the way in which the mathematicians B.A. Bernstein (1932) and E.V. Huntington (1933) have previously formulated and analyzed it in algebraic terms for propositional logic and, finally, I shall discuss some critical reactions Nagel (1943), Hempel (1943), Fitch (1944), and Church (1944) formulated to these approaches. (shrink)

Answering a question formulated by Halbach (2009), I show that a disquotational truth theory, which takes as axioms all positive substitutions of the sentential T-schema, together with all instances of induction in the language with the truth predicate, is conservative over its syntactical base.

_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)

I explore the logic of ground. I first develop a logic of weak ground. This logic strengthens the logic of weak ground presented by Fine in his ‘Guide to Ground.’ This logic, I argue, generates many plausible principles which Fine’s system leaves out. I then derive from this a logic of strict ground. I argue that there is a strong abductive case for adopting this logic. It’s elegant, parsimonious and explanatorily powerful. Yet, so I suggest, adopting it has important consequences. (...) First, it means we should think of ground as a type of identity. Second, it means we should reject much of Fine’s logic of strict ground. I also show how the logic I develop connects to other systems in the literature. It is definitionally equivalent both to Angell’s logic of analytic containment and to Correia’s system G. (shrink)

We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x ⊧ ⍯φ (...) iff Vy(y ≠ x → y ⊧ φ). Model-theoretic characterizations of modal definability in these languages are obtained. Further we consider deductive systems in ℒ $_{c}$ . Strong completeness of the normal ℒ $_{c}$ logics is proved with respect to models in which all worlds are named. Every ℒ $_{c}$ -logic axiomatized by formulae containing only names (but not propositional variables) is proved to be strongly frame-complete. Problems concerning transfer of properties ([in]completeness, filtration, finite model property etc.) from ℒ to ℒ $_{c}$ are discussed. Finally, further perspectives for names in multimodal environment are briefly sketched. (shrink)

This paper investigates the metaphysics in higher-order counterfactual logic. I establish the necessity of identity and distinctness and show that the logic is committed to vacuism, which entails that all counteridenticals are true. I prove the Barcan, Converse Barcan, Being Constraint and Necessitism. I then show how to derive the Identity of Indiscernibles in counterfactual logic. I study a form of maximalist ontology which has been claimed to be so expansive as to be inconsistent. I show that it is equivalent (...) to the collapse of the counterfactual into the material conditional---which is itself equivalent to the modal logic TRIV. TRIV is consistent, from which it follows that maximalism is, surprisingly, consistent. I close by arguing that stating the limit assumption requires a higher-order logic. (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)

The notion of strength has featured prominently in recent debates about abductivism in the epistemology of logic. Following Williamson and Russell, we distinguish between logical and scientific strength and discuss the limits of the characterizations they employ. We then suggest understanding logical strength in terms of interpretability strength and scientific strength as a special case of logical strength. We present applications of the resulting notions to comparisons between logics in the traditional sense and mathematical theories.

The present paper intends to report two results. It is shown that the formula P(x)=∀y∀z[¬G(x, y)→¬M(z)] provides the logic underlying gauge symmetry, where M denotes the predicate of being massive. For the logic of spontaneous symmetry breaking, by Higgs mechanism, we have P(x)=∀y∀z[G(x, y)→M(z)]. Notice that the above two formulas are not logically equivalent. The results are obtained by integrating four components, namely, gauge symmetry and Higgs mechanism in quantum field theory, and Gödel's incompleteness theorem and Tarski's indefinability theorem in (...) mathematical logic. Gödel numbering is the key for arithmetic modeling applied in this paper. (shrink)

According to an influential view, when it comes to representing reality, some words are better suited for the job than others. This is elitism. There is reason to believe that the set of the best, or elite, words should not be redundant or arbitrary. However, we are often forced to choose between these two theoretical vices, especially in cases involving theories that seem to be mere notational variants. This is the riddle of redundancy: both redundancy and arbitrariness are vicious, but (...) there are cases in which one must be picked. Logical realists admit that there are some logical constants among the elite words. This leads to awkward questions, such as which among conjunction and disjunction is elite. In this paper, I show how the riddle of redundancy arises for logical realists, and offer a solution. This approach requires us to change how we represent negation. Instead of using some particular symbol, we represent negation by flipping formulae over the horizontal axis. (shrink)

Cathoristic logic is a multi-modal logic where negation is replaced by a novel operator allowing the expression of incompatible sentences. We present the syntax and semantics of the logic including complete proof rules, and establish a number of results such as compactness, a semantic characterisa- tion of elementary equivalence, the existence of a quadratic-time decision pro- cedure, and Brandom’s incompatibility semantics property. We demonstrate the usefulness of the logic as a language for knowledge representation.

We study a new formal logic LD introduced by Prof. Grzegorczyk. The logic is based on so-called descriptive equivalence, corresponding to the idea of shared meaning rather than shared truth value. We construct a semantics for LD based on a new type of algebras and prove its soundness and completeness. We further show several examples of classical laws that hold for LD as well as laws that fail. Finally, we list a number of open problems. -/- .

Logic is useful as a neutral formalism for expressing the contents of mental representations. It can be used to extract crisp conclusions regarding the higher-order theory of phenomenal consciousness developed in (McDermott 2001, 20007). A key aspect of conscious perceptions is their connection to the distinction between appearance and reality. Perceptions must often be corrected. To do so requires that the logic of perception be able to represent the logical structure of judgment events, that is, to include the formulas (...) of the logic as objects to be reasoned about. However, there is a limit to how finely humans can examine their own representations. Terms representing primary and secondary qualities seemed to be _locked,_ so that the numbers (or levels of neural activation) that are their essence are not directly accessible. Humans feel a need to invoke ``intrinsic,'' ``nonrelational'' properties of many secondary qualities --- their _qualia_ --- to ``explicate'' how we compare and discriminate among them, although this is not actually how the comparisons are accomplished. This model of qualia explains several things: It accounts for the difference between ``normal'' and ``introspective'' access to a perceptual module in terms of quotation. It dissolves Jackson's knowledge argument by explaining what Mary learns as a fictional but undoubtable belief structure. It makes spectrum inversion logically impossible by providing a degree of freedom between the physical structure of the brain and the representations it contains that redescribes putative cases of spectrum inversion as alternative but equivalent ways of mapping physical states to representational states. (shrink)

We give a complete axiomatization of the identities of the basic game algebra valid with respect to the abstract game board semantics. We also show that the additional conditions of termination and determinacy of game boards do not introduce new valid identities.En route we introduce a simple translation of game terms into plain modal logic and thus translate, while preserving validity both ways, game identities into modal formulae.The completeness proof is based on reduction of game terms to a certain ‘minimal (...) canonical form’, by using only the axiomatic identities, and on showing that the equivalence of two minimal canonical terms can be established from these identities. (shrink)

This paper is concerned with counterfactual logic and its implications for the modal status of mathematical claims. It is most directly a response to an ambitious program by Yli-Vakkuri and Hawthorne (2018), who seek to establish that mathematics is committed to its own necessity. I claim that their argument fails to establish this result for two reasons. First, their assumptions force our hand on a controversial debate within counterfactual logic. In particular, they license counterfactual strengthening— the inference from ‘If A (...) were true then C would be true’ to ‘If A and B were true then C would be true’—which many reject. Second, the system they develop is provably equivalent to appending Deduction Theorem to a T modal logic. It is unsurprising that the combination of Deduction Theorem with T results in necessitation; indeed, it is precisely for this reason that many logicians reject Deduction Theorem in modal contexts. If Deduction Theorem is unacceptable for modal logic, it cannot be assumed to derive the necessity of mathematics. (shrink)

Burgess (1997), building on Quine (1953), convincingly argued that claims in quantified modal logic cannot be understood as synonymous with or logically equivalent to claims about the analyticity of certain sentences. According to modal normativism, metaphysically necessary claims instead express or convey our actual semantic rules. In this paper, I show how the normativist can use Sidelle’s (1992a, 1995) neglected work on rigidity to account for two important phenomena in quantified modal logic: the necessity of identity and the substitutivity of (...) identicals into modal contexts. (shrink)

Sorensen (1992) has provided two modal-logical schemas to reconstruct the logical structure of two types of destructive thought experiments: the Necessity Refuter and the Possibility Refuter. The schemas consist of five propositions which Sorensen claims but does not prove to be inconsistent.We show that the five propositions, as presented by Sorensen, are not inconsistent, but by adding a premise (and a logical truth), we prove that the resulting sextet of premises is inconsistent. Häggqvist (2009) has provided a (...) different modal-logical schema (Counterfactual Refuter), which is equivalent to four premises, again claimed to be inconsistent. We show that this schema also is not inconsistent, for similar reasons. Again, we add another premise to achieve inconsistency. The conclusion is that all three modal-logical reconstructions of the arguments that accompany thought experiments, two by Sorensen and one by Häggqvist, have now been made rigorously correct. This may inaugurate new avenues to respond to destructive thought experiments. (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)

Many differences exist between the logical relations “equality” and “equivalence”. In this monograph I point out differences that concern definition, linguistics, computational gates and tables, denotation, application, negation of terms, negation of the relation, relations to other relations, the laws of symmetry, transitivity and reflexivity, the laws of commutation and permutation, the law of tautology, the law of distribution, the law of association, propositional meaning, and “genesis”. I also point out a form of “symmetry breaking”: the negation of (...) some equality may yield some non-equality, while the negation of that non-equality might not yield the same equality. (For full access: use the website link of the title page. -- Copyright License: CC BY-NC-ND. -- DOI: 10.17026/dans-zh3-h2b2 --). (shrink)

(...) However, whether we chose a weak or strong approximation, the set would not make any sense at all, if (once more) this choice would not be justified in either temporal or spatial sense or given the context of possible applicability of the set in different circumstances. This would obviously represent a dualism in itself as we would (for instance) posit and apply a full identity-equality-equivalence of x and y when applying Newtonian physics to certain observations we make (it (...) would be the case of neural correlates), and we would posit and apply a non - identity-equality-equivalence of x and y when applying Quantum mechanics to other observations. Following this dualism in and of theories, the same sate would need to be slightly modified: U2:(x~y)∪(x≈y); U3:(x~y)∩(x≈y); U4a:(x~y)⊆(x≈y) vs. U4b:(x~y)⊇(x≈y). (shrink)

The starting point of this paper concerns the apparent difference between what we might call absolute truth and truth in a model, following Donald Davidson. The notion of absolute truth is the one familiar from Tarski’s T-schema: ‘Snow is white’ is true if and only if snow is white. Instead of being a property of sentences as absolute truth appears to be, truth in a model, that is relative truth, is evaluated in terms of the relation between sentences and models. (...) I wish to examine the apparent dual nature of logical truth (without dwelling on Davidson), and suggest that we are dealing with a distinction between a metaphysical and a linguistic interpretation of truth. I take my cue from John Etchemendy, who suggests that absolute truth could be considered as being equivalent to truth in the ‘right model’, i.e., the model that corresponds with the world. However, the notion of ‘model’ is not entirely appropriate here as it is closely associated with relative truth. Instead, I propose that the metaphysical interpretation of truth may be illustrated in modal terms, by metaphysical modality in particular. One of the tasks that I will undertake in this paper is to develop this modal interpretation, partly building on my previous work on the metaphysical interpretation of the law of non-contradiction (Tahko 2009). After an explication of the metaphysical interpretation of logical truth, a brief study of how this interpretation connects with some recent important themes in philosophical logic follows. In particular, I discuss logical pluralism and propose an understanding of pluralism from the point of view of the metaphysical interpretation. (shrink)

Quantum information is discussed as the universal substance of the world. It is interpreted as that generalization of classical information, which includes both finite and transfinite ordinal numbers. On the other hand, any wave function and thus any state of any quantum system is just one value of quantum information. Information and its generalization as quantum information are considered as quantities of elementary choices. Their units are correspondingly a bit and a qubit. The course of time is what generates choices (...) by itself, thus quantum information and any item in the world in final analysis. The course of time generates necessarily choices so: The future is absolutely unorderable in principle while the past is always well-ordered and thus unchangeable. The present as the mediation between them needs the well-ordered theorem equivalent to the axiom of choice. The latter guarantees the choice even among the elements of an infinite set, which is the case of quantum information. The concrete and abstract objects share information as their common base, which is quantum as to the formers and classical as to the latters. The general quantities of matter in physics, mass and energy can be considered as particular cases of quantum information. The link between choice and abstraction in set theory allows of “Hume’s principle” to be interpreted in terms of quantum mechanics as equivalence of “many” and “much” underlying quantum information. Quantum information as the universal substance of the world calls for the unity of physics and mathematics rather than that of the concrete and abstract objects and thus for a form of quantum neo-Pythagoreanism in final analysis. (shrink)

ABSTRACT: This 1974 paper builds on our 1969 paper (Corcoran-Weaver [2]). Here we present three (modal, sentential) logics which may be thought of as partial systematizations of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of these three logics coincide with one another and with those of standard formalizations of Lewis's S5. These logics, when regarded as logistic systems (cf. Corcoran [1], p. 154), are seen to be (...) equivalent; but, when regarded as consequence systems (ibid., p. 157), one diverges from the others in a fashion which suggests that two standard measures of semantic complexity may not be as closely linked as previously thought. -/- This 1974 paper uses the linear notation for natural deduction presented in [2]: each two-dimensional deduction is represented by a unique one-dimensional string of characters. Thus obviating need for two-dimensional trees, tableaux, lists, and the like—thereby facilitating electronic communication of natural deductions. The 1969 paper presents a (modal, sentential) logic which may be thought of as a partial systematization of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of this logic coincides those of standard formalizations of Lewis’s S4. Among the paper's innovations is its treatment of modal logic in the setting of natural deduction systems--as opposed to axiomatic systems. The author’s apologize for the now obsolete terminology. For example, these papers speak of “a proof of a sentence from a set of premises” where today “a deduction of a sentence from a set of premises” would be preferable. 1. Corcoran, John. 1969. Three Logical Theories, Philosophy of Science 36, 153–77. J P R -/- 2. Corcoran, John and George Weaver. 1969. Logical Consequence in Modal Logic: Natural Deduction in S5 Notre Dame Journal of Formal Logic 10, 370–84. MR0249278 (40 #2524). 3. Weaver, George and John Corcoran. 1974. Logical Consequence in Modal Logic: Some Semantic Systems for S4, Notre Dame Journal of Formal Logic 15, 370–78. MR0351765 (50 #4253). (shrink)

JOHN CORCORAN AND WILIAM FRANK. Surprises in logic. Bulletin of Symbolic Logic. 19 253. Some people, not just beginning students, are at first surprised to learn that the proposition “If zero is odd, then zero is not odd” is not self-contradictory. Some people are surprised to find out that there are logically equivalent false universal propositions that have no counterexamples in common, i. e., that no counterexample for one is a counterexample for the other. Some people would be surprised to (...) find out that in normal first-order logic existential import is quite common: some universals “Everything that is S is P” —actually quite a few—imply their corresponding existentials “Something that is S is P”. Anyway, perhaps contrary to its title, this paper is not a cataloging of surprises in logic but rather about the mistakes that did or might have or might still lead people to think that there are no surprises in logic. The paper cataloging of surprises in logic is on our “to-do” list. -/- ► JOHN CORCORAN AND WILIAM FRANK, Surprises in logic. Philosophy, University at Buffalo, Buffalo, NY 14260-4150, USA E-mail: [email protected] There are many surprises in logic. Peirce gave us a few. Russell gave Frege one. Löwenheim gave Zermelo one. Gödel gave some to Hilbert. Tarski gave us several. When we get a surprise, we are often delighted, puzzled, or skeptical. Sometimes we feel or say “Nice!”, “Wow, I didn’t know that!”, “Is that so?”, or the like. Every surprise belongs to someone. There are no disembodied surprises. Saying there are surprises in logic means that logicians experience surprises doing logic—not that among logical propositions some are intrinsically or objectively “surprising”. The expression “That isn’t surprising” often denigrates logical results. Logicians often aim for surprises. In fact, [1] argues that logic’s potential for surprises helps motivate its study and, indeed, helps justify logic’s existence as a discipline. Besides big surprises that change logicians’ perspectives, the logician’s daily life brings little surprises, e.g. that Gödel’s induction axiom alone implies Robinson’s axiom. Sometimes wild guesses succeed. Sometimes promising ideas fail. Perhaps one of the least surprising things about logic is that it is full of surprises. Against the above is Wittgenstein’s surprising conclusion : “Hence there can never be surprises in logic”. This paper unearths basic mistakes in [2] that might help to explain how Wittgenstein arrived at his false conclusion and why he never caught it. The mistakes include: unawareness that surprise is personal, confusing logicians having certainty with propositions having logical necessity, confusing definitions with criteria, and thinking that facts demonstrate truths. People demonstrate truths using their deductive know-how and their knowledge of facts: facts per se are epistemically inert. [1] JOHN CORCORAN, Hidden consequence and hidden independence. This Bulletin, vol.16, p. 443. [2] LUDWIG WITTGENSTEIN, Tractatus Logico-Philosophicus, Kegan Paul, London, 1921. -/-. (shrink)

The tripartite account of propositional, fallibilist knowledge that p as justified true belief can become adequate only if it can solve the Gettier Problem. However, the latter can be solved only if the problem of a successful coordination of the resources (at least truth and justification) necessary and sufficient to deliver propositional, fallibilist knowledge that p can be solved. In this paper, the coordination problem is proved to be insolvable by showing that it is equivalent to the ''''coordinated attack'''' problem, (...) which is demonstrably insolvable in epistemic logic. It follows that the tripartite account is not merely inadequate as it stands, as proved by Gettier-type counterexamples, but demonstrably irreparable in principle, so that efforts to improve it can never succeed. (shrink)

Since the pioneering work of Birkhoff and von Neumann, quantum logic has been interpreted as the logic of (closed) subspaces of a Hilbert space. There is a progression from the usual Boolean logic of subsets to the "quantum logic" of subspaces of a general vector space--which is then specialized to the closed subspaces of a Hilbert space. But there is a "dual" progression. The notion of a partition (or quotient set or equivalence relation) is dual (in a category-theoretic sense) (...) to the notion of a subset. Hence the Boolean logic of subsets has a dual logic of partitions. Then the dual progression is from that logic of partitions to the quantum logic of direct-sum decompositions (i.e., the vector space version of a set partition) of a general vector space--which can then be specialized to the direct-sum decompositions of a Hilbert space. This allows the logic to express measurement by any self-adjoint operators rather than just the projection operators associated with subspaces. In this introductory paper, the focus is on the quantum logic of direct-sum decompositions of a finite-dimensional vector space (including such a Hilbert space). The primary special case examined is finite vector spaces over ℤ₂ where the pedagogical model of quantum mechanics over sets (QM/Sets) is formulated. In the Appendix, the combinatorics of direct-sum decompositions of finite vector spaces over GF(q) is analyzed with computations for the case of QM/Sets where q=2. (shrink)

Wittgenstein taught us that there could not be a logically private language— a language on the proper speaking of which it was logically impossible for there to be more than one expert. For then there would be no difference between this person thinking she was using the language correctly and her actually using it correctly. The distinction requires the logical possibility of someone other than her being expert enough to criticize or corroborate her usage, someone able to constitute or (...) hold her to a standard of proper use. I shall explore the possibility of something opposite- sounding about laws, namely, that there could in principle be laws whose existence, legitimacy, goodness, and efficacy depend upon their being private, in this sense: their existence is kept secret from those who legitimately benefit from the laws and yet who would misguidedly destroy them were they to come to know of them; and it is kept secret from those who would illegitimately benefit from being able to circumvent the laws, and who could circumvent them if they knew of them. The secrecy of the laws increases their efficacy against bad behavior, and since were the public to come to know of these laws the public would lose its nerve and demand that the laws be rescinded, it prevents the public from destroying laws that are in fact in the public interest. These laws are therefore in a way logically private: they cannot at the same time exist, have the foregoing virtues, and be public. After proposing conditions under which such laws ought to be enacted, I moot logical objections to the very idea that there could be such laws, practical objections to their workability, and moral objections to their permissibility. I conclude by suggesting that, while we normally think of secret laws as creatures of the executive branch, things functionally equivalent to secret laws could also be created by other branches of government and societal institutions, and that all of this would be compatible with the form of sovereignty that is democratically grounded in the will and interests of the people. (shrink)

The notion of logical construction was used by Bertrand Russell in the early 20th century, which originally comes from A. N. Whitehead. Russell said that matter as a mind-independent thing can only be known by description. He also argued that matter is a logical construction of sense-data. However, this leads to an incoherent view of the direct or indirect connection between a mind and the external world. The problem examining is whether a collapsing house is a logical (...) construction of the sense-data of rumbling sounds and collapsing shapes. Using Russell's writings between 1911 and 1918, I will analyze how Russell characterized logical constructions. Finally, I will show Russell’s view about the relation of logical constructions to matter and sense-data. A careful interpretation of Russell's thoughts shows that the contents of the statements of the physical world are not constructions being equivalent to the contents of the sense-datum statements. (shrink)

We approach the topic of solution equivalence of propositional problems from the perspective of non-constructive procedural theory of problems based on Transparent Intensional Logic (TIL). The answer we put forward is that two solutions are equivalent if and only if they have equivalent solution concepts. Solution concepts can be understood as a generalization of the notion of proof objects from the Curry-Howard isomorphism.

It is argued that the distinction between the mental and the nonmental is at bottom logical. The paper begins by sketching and defending a theory of intensional logic in which the notion of logically and metaphysically basic relations (called connections) can be defined. This notion is then employed in an analysis of intentionality: a connection is intentional iff it can contingently connect some individual to some proposition or concept independently of whether it connects the individual to some necessarily equivalent (...) proposition or concept. After potential counterexamples have been explained away, the paper then extends the analysis to a general analysis of mentality. Finally, a "transcendental" argument is given for the thesis that at least some mental relations must be logically and metaphysically basic. (shrink)

According to Cantor (Mathematische Annalen 21:545–586, 1883 ; Cantor’s letter to Dedekind, 1899 ) a set is any multitude which can be thought of as one (“jedes Viele, welches sich als Eines denken läßt”) without contradiction—a consistent multitude. Other multitudes are inconsistent or paradoxical. Set theoretical paradoxes have common root—lack of understanding why some multitudes are not sets. Why some multitudes of objects of thought cannot themselves be objects of thought? Moreover, it is a logical truth that such multitudes (...) do exist. However we do not understand this logical truth so well as we understand, for example, the logical truth $${\forall x \, x = x}$$ . In this paper we formulate a logical truth which we call the productivity principle. Rusell (Proc Lond Math Soc 4(2):29–53, 1906 ) was the first one to formulate this principle, but in a restricted form and with a different purpose. The principle explicates a logical mechanism that lies behind paradoxical multitudes, and is understandable as well as any simple logical truth. However, it does not explain the concept of set. It only sets logical bounds of the concept within the framework of the classical two valued $${\in}$$ -language. The principle behaves as a logical regulator of any theory we formulate to explain and describe sets. It provides tools to identify paradoxical classes inside the theory. We show how the known paradoxical classes follow from the productivity principle and how the principle gives us a uniform way to generate new paradoxical classes. In the case of ZFC set theory the productivity principle shows that the limitation of size principles are of a restrictive nature and that they do not explain which classes are sets. The productivity principle, as a logical regulator, can have a definite heuristic role in the development of a consistent set theory. We sketch such a theory—the cumulative cardinal theory of sets. The theory is based on the idea of cardinality of collecting objects into sets. Its development is guided by means of the productivity principle in such a way that its consistency seems plausible. Moreover, the theory inherits good properties from cardinal conception and from cumulative conception of sets. Because of the cardinality principle it can easily justify the replacement axiom, and because of the cumulative property it can easily justify the power set axiom and the union axiom. It would be possible to prove that the cumulative cardinal theory of sets is equivalent to the Morse–Kelley set theory. In this way we provide a natural and plausibly consistent axiomatization for the Morse–Kelley set theory. (shrink)

It is my intention in this article to present some consequences of Quine’s thesis on the dependence of ontology on ideology (Quine, 1980), seeking an argument for my own thesis on the dependence (theoretical) existence of entities on identity type or ontology dependence on logic and language.If Quine's thesis is correct, then we can expand the resolution of this conclusion and say that ontology depends on the identity or on identification of the "identity criteria for conceptual schemes" (Davidson, 2001) which (...) is constructed in the theory. Consequently I will speak about types of identity which adapts choice of ontology and of which depends ontology of a theory. Here I want to connect the different types of use of the term identity in Aristotle's writings and the different types of predications that are based on them with the concept of identity as the equivalence of symbols in modern logic. I want to reinterpret Quine's statement: "There is no entity without identity " in the form of imlication "What (kind of) identity such (kind of ) entity." . (shrink)

The main research goal of the work is to study the notion of co-topos, its correctness, properties and relations with toposes. In particular, the dualization process proposed by proponents of co-toposes has been analyzed, which transforms certain Heyting algebras of toposes into co-Heyting ones, by which a kind of paraconsistent logic may appear in place of intuitionistic logic. It has been shown that if certain two definitions of topos are to be equivalent, then in one of them, in the context (...) of a subobject classifier, there should be a neutral label for the generic subobject, or if the label "true" appears instead, it carries no additional properties or assumptions. It has been shown that a natural isomorphism occurring in one of the definitions of topos need not be an isomorphism of the corresponding algebraic structures on the sets, so that a co-Heyting algebraic structure can be defined on the set of characteristic morphisms, which moreover will also be natural. The analyzes suggest that the notion of co-topos may be considered correct. However, it should be strongly emphasized that although the possibility of defining the notion of co-topos has been shown, its further full consequences should be very carefully examined, which can severely limit its logical applications. (shrink)

It is shown that a complete axiomatization of classical non-tautologies can be obtained by taking F (falsehood) as the sole axiom along with the two inference rules: (i) if A is a substitution instance of B, then A |– B; and (ii) if A is obtained from B by replacement of equivalent sentences, then A |– B (counting as equivalent the pairs {T, ~F}, {F, F&F}, {F, F&T}, {F, T&F}, {T, T&T}). Since the set of tautologies is also specifiable by (...) purely syntactic means, the resulting picture gives an improved syntactic account of classical sentential logic. The picture can then be completed by considering related systems that prove adequate to specify the set of contradictions, the set of non-contradictions, and the set of contingencies respectively. (shrink)

The Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially, this means that an algorithm can only preserve information about an input, rather than generate new information. This uncertainty arises from characteristics such as arithmetic logical irreversibility, Landauer's principle, and memory erasure, which ultimately lead to a loss of information and an increase in entropy. To measure this uncertainty and (...) loss of information, the concept of arithmetic logical entropy can be used. The Turing machine and its equivalent, general recursive functions can be understood through the λ calculus and the Turing/Church thesis. However, there are certain recursive functions that cannot be fully understood or predicted by other algorithms due to the loss of information during logical-arithmetic operations. In other words, the behaviour of these functions cannot be completely determined at every stage of the computation due to a lack of information in their definition. While there are some cases where the behaviour of recursive functions is highly predictable, the lack of information in most cases makes it impossible for algorithms to determine if a program will halt or not. This inability to predict the outcome of the computation is the essence of the halting problem of the Turing machine. Even in cases where more information is available about the program, it is still difficult to determine with certainty if the program will halt or not. This also highlights the importance of the Turing oracle machine, which introduces information from outside the computation to compensate for the lack of information and ultimately decide the result of the computation. (shrink)

One can construct a mapping between Hilbert space and the class of all logic if the latter is defined as the set of all well-orderings of some relevant set (or class). That mapping can be further interpreted as a mapping of all states of all quantum systems, on the one hand, and all logic, on the other hand. The collection of all states of all quantum systems is equivalent to the world (the universe) as a whole. Thus that mapping establishes (...) a fundamentally philosophical correspondence between the physical world and universal logic by the meditation of a special and fundamental structure, that of Hilbert space, and therefore, between quantum mechanics and logic by mathematics. Furthermore, Hilbert space can be interpreted as the free variable of "quantum information" and any point in it, as a value of the same variable as "bound" already axiom of choice. (shrink)

Free logics aim at freeing logic from existence assumptions by making them explicit, e.g., by adding an existence premisse to the antecedence of the classical axiom-schema of Universal Instantiation. Their historical development was motivated by the problem of empty singular terms, and that one of simple statements containing at least one such singular term: what is the referential status of such singular terms and what truth-value, if any, do such statemants have? Free logics can be classified with regard to their (...) respective answers to these problems. Negative free logics assume that non-existent objects cannot have any properties at all; hence, in particular, they cannot be self-identical or rotate. Positive free logics believe that non-existents can be self-identical according to the Leibnizian concept of identity. Neutral free logics think that statements of self-identity are truth-valueless because of the Fregean principle of compositionality. Since only in negative free logic, but not in positive free logic, two statements of the forms "a = a" and "E!a" are logically equivalent, one also can define only for NFL, but not for PFL, existence by self-identity. (shrink)

Imperatives cannot be true, but they can be obeyed or binding: `Surrender!' is obeyed if you surrender and is binding if you have a reason to surrender. A pure declarative argument — whose premisses and conclusion are declaratives — is valid exactly if, necessarily, its conclusion is true if the conjunction of its premisses is true; similarly, I suggest, a pure imperative argument — whose premisses and conclusion are imperatives — is obedience-valid (alternatively: bindingness-valid) exactly if, necessarily, its conclusion is (...) obeyed (alternatively: binding) if the conjunction of its premisses is. I argue that there are two kinds of bindingness, and that a vacillation between two corresponding variants of bindingness-validity largely explains conflicting intuitions concerning the validity of some pure imperative arguments. I prove that for each of those two variants of bindingness-validity there is an equivalent variant of obedience-validity. Finally, I address alternative accounts of pure imperative inference. (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)

In the following the details of a state-of-affairs semantics for positive free logic are worked out, based on the models of common inner domain - outer domain semantics. Lambert's PFL system is proven to be weakly adequate (i.e., sound and complete) with respect to that semantics by demonstrating that the concept of logical truth definable therein coincides with that one of common truth-value semantics for PFL. Furthermore, this state-of-affairs semantics resists the challenges stemming from the slingshot argument since logically (...) equivalent statements do not always have the same extension according to it. Finally, it is argued that in such a semantics all statements of a certain language for PFL are state-of-affairs-related extensional as well as salva extensione extensional, even though their salva veritate extensionality fails. (shrink)

The Genuine Process Logic described here (abbreviation: GPL) places the object-bound process itself at the center of formalism. It should be suitable for everyday use, i.e. it is not primarily intended for the formalization of computer programs, but instead, as a counter-conception to the classical state logics. The new and central operator of the GPL is an action symbol replacing the classical state symbols, e.g. of equivalence or identity. The complete renunciation of object-language state expressions also results in a (...) completely new metalinguistic framework, both regarding the axioms and the expressive possibilities of this system. A mixture with state logical terms is readily possible. (shrink)

We present a new frame semantics for positive relevant and substructural propositional logics. This frame semantics is both a generalisation of Routley–Meyer ternary frames and a simplification of them. The key innovation of this semantics is the use of a single accessibility relation to relate collections of points to points. Different logics are modeled by varying the kinds of collections used: they can be sets, multisets, lists or trees. We show that collection frames on trees are sound and complete for (...) the basic positive distributive substructural logic $\mathsf {B}^+$, that collection frames on multisets are sound and complete for $\mathsf {RW}^+$ (the relevant logic $\mathsf {R}^+$, without contraction, or equivalently, positive multiplicative and additive linear logic with distribution for the additive connectives), and that collection frames on sets are sound for the positive relevant logic $\mathsf {R}^+$. The completeness of set frames for $\mathsf {R}^+$ is, currently, an open question. (shrink)