Lindström’s theorem obviously fails as a characterization of first-order logic without identity ( $\mathcal {L}_{\omega \omega }^{-} $ ). In this note, we provide a fix: we show that $\mathcal {L}_{\omega \omega }^{-} $ is a maximal abstract logic satisfying a weak form of the isomorphism property (suitable for identity-free languages and studied in [11]), the Löwenheim–Skolem property, and compactness. Furthermore, we show that compactness can be replaced by being recursively enumerable for validity under certain (...) conditions. In the proofs, we use a form of strong upwards Löwenheim–Skolem theorem not available in the framework with identity. (shrink)

The aim of this short book is to discuss the traditional topics of philosophical logic without the “formalistic fetishism and scholasticism” that McGinn associates with recent work in the field. The writing is indeed crisp, engaging, and free of formalisms. The book consists of five separate essays—one each on identity, existence, predication, necessity, and truth—loosely united by the general theme that these “logical properties” are real and irreducible. “These concepts,” McGinn says, “form a conceptual bedrock; they stand, (...) as it were, underneath all our other concepts. They have no analysis”. (shrink)

Fluted logic is the restriction of pure predicate logic to formulas in which variables play no essential role. Although fluted logic is significantly weaker than pure predicate logic, it is of interest because it seems closely to parallel natural logic, the logic that is conducted in natural language. It has been known since 1969 that if conjunction in fluted formulas is restricted to subformulas of equal arity, satisfiability is decidable. However, the decidability (...) of sublogics lying between this restricted (homogeneous) fluted logic and full predicate logic remained unknown. In 1994 it was shown that the satisfiability of fluted formulas without restriction is decidable, thus reducing the unknown region significantly. This paper further reduces the unknown region. It shows that fluted logic with the logical identity is decidable. Since the reflection functor can be defined in fluted logic with identity, it follows that fluted logic with the reflection functor also lies within the region of decidability. Relevance to natural logic is increased since the identity permits definition of singular predicates, which can represent anaphoric pronouns. (shrink)

In this book the author develops his own systems of and semantics for presupposition free logic. He calls his systems logics without existence assumptions, by which he means logical systems which are sound and complete with respect to a semantic theory in which a universe of discourse can be empty but any term which denotes must denote something in the universe, all predicates including identity represent relations holding among members of the universe and the quantifiers range over (...) just all the members of the universe. In a brief introductory chapter the author reviews the motivations for constructing non-standard logics of this kind and briefly discusses what he takes to be the limitations of previous work done in the field. Persons interested in the philosophical problems and uses of such logics are likely to find this chapter interesting though disappointingly brief. Four of the eight chapters are devoted to the development of a natural deduction system N which is a logic without existence assumptions in the author's sense. The system N is shown to be sound and complete with respect to the author's semantics. An axiomatic system L is later developed and shown to be equivalent to N. The final chapter is devoted to discussing the relation of his work to many-valued logics, modal logics, intuitionistic logic and the theory of classes among other topics. The author believes that logics without existence assumptions "will in the long run displace the less natural and more narrow standard logics."--R. H. K. (shrink)

The present article deals with the power of the axiom of choice within the second-order predicate logic. We investigate the relationship between several variants of AC and some other statements, known as equivalent to AC within the set theory of Zermelo and Fraenkel with atoms, in Henkin models of the one-sorted second-order predicate logic with identity without operation variables. The construction of models follows the ideas of Fraenkel and Mostowski. It is e. g. shown (...) that the well-ordering theorem for unary predicates is independent from AC for binary predicates and from the trichotomy law for unary predicates. Moreover, we show that the AC for binary predicates follows neither from the trichotomy law for unary predicates nor from Zorn's lemma for unary predicates nor from the formalization of the axiom of choice for disjoint families of sets for binary predicates, and that the trichotomy law for unary predicates does not follow from AC for binary predicates. (shrink)

In our previous paper [5], we have studied Kripke-type semantics for propositional logics without the contraction rule. In this paper, we will extend our argument to predicate logics without the structure rules. Similarly to the propositional case, we can not carry out Henkin's construction in the predicate case. Besides, there exists a difficulty that the rules of inference () and () are not always valid in our semantics. So, we have to introduce a notion of normal (...) models. (shrink)

In this paper, a semantics for predicate logics without the contraction rule will be investigated and the completeness theorem will be proved. Moreover, it will be found out that our semantics has a close connection with Beth-type semantics.

Identity, existence, predication, necessity, and truth are fundamental philosophical concerns. Colin McGinn treats them both philosophically and logically, aiming for maximum clarity and minimum pointless formalism. He contends that there are real logical properties that challenge naturalistic metaphysical outlooks. These concepts are not definable, though we can say a good deal about how they work. The aim of Logical Properties is to bring philosophy back to philosophical logic.

The identity "relation" is misconceived since the syntax of "=" is misconceived as a relative term. Actually, "=" is syncategorematic; it forms (true) sentences with a nonpredicative syntax from pairs of (coreferring) flanking names, much as "&" forms (true) conjunctive sentences from pairs of (true) flanking sentences. In the conaming structure, nothing is predicated of the subject, other than, implicitly, its being so conamed. An identity sentence has both an objectual reading as a necessity about what is named, (...) and also a metalinguistic reading as a contingency about the names. Either way the claim about the subject referent has no extralinguistic content. The necessity of alteridentity (non-self-identity) statements is "lexical", due to contingencies of the names' reference, much like the necessity of analytic statements, due to contingencies of the predicates' sense, and unlike the necessity of logical truths (e.g., self-identities) whose truth is secured by syntax alone. Both alter-identity and analytic sentences are readable as objectual necessities and metalinguistic contingencies. Epistemically, alter-identity statements are not essentially unlike analyticities. "Greece is Hellas"/"g=h" and "Greeks are Hellenes"/"(x)(Gx<=>Hx)" are equally (un)informative; so too for "Azure is cobalt"/"a=c" and "Everything azure is cobalt"/"(x)(Ax<=>Cx)". The real epistemic contrast is between proper names (terms without predicative sense) and terms with a predicative sense (names and predicates of properties). Proper names refer to concrete objects, property names refer to abstract objects. That contrast is metaphysical and thus epistemic. (shrink)

'There is much food for thought in McGinn's discussions and each chapter is rich with a series of considerations for thinking that the currently received views on the various topics have some serious difficulties that need confronting... For those interested in metaphysics and the philosophy of logic, this book will stimulate much further thought' -Mind 'The sweep of the book is broad and the pace is brisk... There is much material here to provide the basis for many a deep (...) philosophical discussion' -Mind 'Lucid and provocative little book... clear, direct and well argued' -Times Higher Education SupplementIdentity, existence, predication, necessity, and truth are fundamental philosophical concerns. Colin McGinn treats them both philosophically and logically, aiming for maximum clarity and minimum pointless formalism. He contends that there are real logical properties that challenge naturalistic metaphysical outlooks. These concepts are not definable, though we can say a good deal about how they work. The aim of Logical Properties is to bring philosophy back to philosophical logic. (shrink)

In this article we investigate the family of independence-friendly (IF) logics in the equality-free setting, concentrating on questions related to expressive power. Various natural equality-free fragments of logics in this family translate into existential second-order logic with prenex quantification of function symbols only and with the first-order parts of formulae equality-free. We study this fragment of existential second-order logic. Our principal technical result is that over finite models with a vocabulary consisting of unary relation symbols only, this fragment (...) of second-order logic is weaker in expressive power than first-order logic (with equality). Results about the fragment could turn out useful for example in the study of independence-friendly modal logics. In addition to proving results of a technical nature, we address issues related to a perspective from which IF logic is regarded as a specification framework for games, and also discuss the general significance of understanding fragments of second-order logic in investigations related to non-classical logics. (shrink)

Identity, existence, predication, necessity, and truth are fundamental philosophical concerns. Colin McGinn treats them both philosophically and logically, aiming for maximum clarity and minimum pointless formalism. He contends that there are real logical properties that challenge naturalistic metaphysical outlooks. These concepts are not definable, though we can say a good deal about how they work. The aim of Logical Properties is to bring philosophy back to philosophical logic.

In this article I present some characteristics of logics and semantics of an uncertain world. I confront two-valued and fuzzy logic. I use Kafka’s novel Process as an example, which is designed as an uncertain context with words which are rigid designators without rigid meaning. That produces an uncertain world of logical and semantical relations. In presentation of problems I introduce basic concepts of Frege’s, Wittgenstein’s, Tarsky’s, Searle’s, Quine’s and Davidson’s philosophy of language. I differ the logical and (...) semantical identification of identity. I differ reference and inference, or representation and identification as two components which are fundamental for the identification of identity. I found this difference on the role of logical unification and granulation of predicates in the structure of thought and semantical unification and granulation of attributes in the structure of statements and their relation to ontology of context. Through the confrontation of the logical and semantical unification and granulation I find that the limits of logic are not also the limits of language. The semantical unification goes over the highest genre and below the lowest species. That enables the extra-logical, non-scientifical, con-fessional, pro-phetical, artistic, and ordinary use of language. (shrink)

This long-awaited book replaces Hughes and Cresswell's two classic studies of modal logic: _An Introduction to Modal Logic_ and _A Companion to Modal Logic_. _A New Introduction to Modal Logic_ is an entirely new work, completely re-written by the authors. They have incorporated all the new developments that have taken place since 1968 in both modal propositional logic and modal predicate logic, without sacrificing tha clarity of exposition and approachability that were essential features of their (...) earlier works. The book takes readers from the most basic systems of modal propositional logic right up to systems of modal predicate with identity. It covers both technical developments such as completeness and incompleteness, and finite and infinite models, and their philosophical applications, especially in the area of modal predicate logic. (shrink)

Wittgensteinian predicate logic (W-logic) is characterized by the requirement that the objects mentioned within the scope of a quantifier be excluded from the range of the associated bound variable. I present a sound and complete tableaux calculus for this logic and discuss issues of translatability between Wittgensteinian and standard predicate logic in languages with and without individual constants. A metalinguistic co-denotation predicate, akin to Frege’s triple bar of the Begriffsschrift, is introduced and (...) used to bestow the full expressive power of first-order logic with identity on W-logic in the presence of constants. (shrink)

Each of the topics mentioned in the title has its own chapter. The unifying theme is McGinn’s conception of naive common sense views of identity, existence, predication, necessity, and truth, which are argued for as being correct. McGinn thinks they should replace entrenched rival treatments of these subjects. However, some of the views McGinn takes as naive seem far from naive or in common use to this reader. This is a technical work in philosophical logic, not in the (...) sense that it is strewn with technical symbols of formal logic. It takes up and discusses topics in a sophisticated way suitable for those working in the area and is not intended primarily for novices in the subject. Having said that, it is well written and clear so that there is much that would be rewarding to nonspecialists who wish to come to the subject. There is much in the way of close and interesting argumentation. (shrink)

We present $\in_I$-Logic (Epsilon-I-Logic), a non-Fregean intuitionistic logic with a truth predicate and a falsity predicate as intuitionistic negation. $\in_I$ is an extension and intuitionistic generalization of the classical logic $\in_T$ (without quantifiers) designed by Sträter as a theory of truth with propositional self-reference. The intensional semantics of $\in_T$ offers a new solution to semantic paradoxes. In the present paper we introduce an intuitionistic semantics and study some semantic notions in this broader context. (...) Also we enrich the quantifier-free language by the new connective < that expresses reference between statements and yields a finer characterization of intensional models. Our results in the intuitionistic setting lead to a clear distinction between the notion of denotation of a sentence and the here-proposed notion of extension of a sentence (both concepts are equivalent in the classical context). We generalize the Fregean Axiom to an intuitionistic version not valid in $\in_I$. A main result of the paper is the development of several model constructions. We construct intensional models and present a method for the construction of standard models which contain specific (self-)referential propositions. (shrink)

The possibility of formal representation of Aristotle’s discussion about singular predication in Categories 10, 13b27-35 is investigated through three symbolic idioms: the first-order language with identity, with and without definitive description, and through the languages of free logics. I show that such representations are not fully adequate. According to the first option, we are committing Aristotle with some (meta)logical implications he is not willing to accept. According to the second option, we are burdening Aristotle with Russell’s theory of (...) names. Finally, the third option leaves us with the assumption that ‘exist(s)’ could be represented with a predicate. This assumption, however, Aristotle emphatically rejects. (shrink)

We investigate a rst-order predicate logic based on Wittgenstein's suggestion to express identity of object by identity of sign, and difference of objects by difference of signs. Hintikka has shown that predicate logic can indeed be set up in such a way; we show that it can be done nicely. More specically, we provide a perspicuous cut-free sequent calculus, as well as a Hilbert-type calculus, for Wittgensteinian predicate logic and prove soundness and (...) completeness theorems. (shrink)

I explain why model theory is unsatisfactory as a semantic theory and has drawbacks as a tool for proofs on logic systems. I then motivate and develop an alternative, the truth-valuational substitutional approach (TVS), and prove with it the soundness and completeness of the first order Predicate Calculus with identity and of Modal Propositional Calculus. Modal logic is developed without recourse to possible worlds. Along the way I answer a variety of difficulties that have been (...) raised against TVS and show that, as applied to several central questions, model-theoretic semantics can be considered TVS in disguise. The conclusion is that the truth-valuational substitutional approach is an adequate tool for many of our logic inquiries, conceptually preferable over model-theoretic semantics. Another conclusion is that formal logic is independent of semantics, apart from its use of the notion of truth, but that even with respect to it its assumptions are minimal. (shrink)

I conclude that it is more accurate to say that, rather than trying to make logic metaphysical, Leibniz tries, in the context of a theistic system, to make metaphysics logical. ;I begin with a study of the principle of identity of indiscernibles, and show how it is best thought of as a principle which follows from a metaphysical interpretation of the principle of sufficient reason. It has been traditional to interpret the principle of identity of indiscernibles as (...) primarily a merely logical principle, and thus as either trivially true, if Leibniz succeeds in proving it, or else false or contingently true. I argue that it is instead necessarily true in a non-trivial or metaphysical sense, because the principles on which it is based are themselves of this metaphysical character, contrary to what is often assumed. ;In the second chapter, I show how God's activity and a metaphysical interpretation of the principle of sufficient reason underlie Leibniz's account of space and time. ;In the third chapter, I discuss the principle of sufficient reason in detail, showing that it actually consists of three separate principles: the principle of grounds, that every true proposition has a proof a priori; the principle of reason, that God does nothing without a sufficient reason; and the principle of causation, that every event has a cause. That each of these is considered a principle of sufficient reason is explained by Leibniz's equivocal use of the term 'reason.' I show that, of the various versions of the principle of sufficient reason, only the principle of reasons provides an adequate foundation for Leibniz's principle of identity of indiscernibles and theory of space and time. Furthermore, since chapters one and two show how the activity of God is presupposed by Leibniz's metaphysics, for Leibniz to derive his metaphysics from his logic, as some would have us suppose, he would have to provide a satisfactory a priori demonstration of God's existence. But this, I argue, he cannot do. Thus God's existence and rationality, rather than subject-predicate logic, are the foundations of Leibniz's metaphysics. ;It is commonplace, when writing about Leibniz, to give primacy to his logic over his metaphysics, and indeed to try to assimilate the latter to the former. In this essay, however, I give priority to Leibniz's metaphysical pronouncements, apart, as much as possible, from logical and linguistic considerations. (shrink)

An ontology's theory of ontic predication has implications for the concomitant predicate logic. Remarkable in its analytic power for both ontology and logic is the here developed Particularized Predicate Logic (PPL), the logic inherent in the realist version of the doctrine of unit or individuated predicates. PPL, as axiomatized and proven consistent below, is a three-sorted impredicative intensional logic with identity, having variables ranging over individuals x, intensions R, and instances of intensions (...) $R_{i}$ . The power of PPL is illustrated by its clarification of the self-referential nature of impredicative definitions and its distinguishing between legitimate and illegitimate forms. With a wellmotivated refinement on the axiom of comprehension, PPL is, in effect, a higher-order logic without a forced stratification of predicates into types or the use of other ad hoc restrictions. The Russell-Priest characterization of the classic self-referential paradoxes is used to show how PPL diagnosis and solves these antimonies. A direct application of PPL is made to Grelling's Paradox. Also shown is how PPL can distinguish between identity and indiscernibility. (shrink)

Table of Contents Volume I Preface to Volumes I and II: A Guide to the Primer Chapter 1, Basic Ideas and Tools Chapter 2, Transcription between English and Sentence Logic Chapter 3, Logical Equivalence, Logical Truths, and Contradictions Chapter 4, Validity and Conditionals Chapter 5, Natural Deduction for Sentence Logic: Fundamentals Chapter 6, Natural Deduction for Sentence Logic: Strategies Chapter 7, Natural Deduction for Sentence Logic: Derived Rules and Derivations without Premises Chapter 8, Truth Tree (...) for Sentence Logic: Fundamentals Chapter 9, Truth Trees for Sentence Logic: Applications Index for Volume 1 Solutions Manual for Volume 1 Table of Contents to Volume II Introduction to Predicate Logic Notes Chapter 1, Predicate Logic: Syntax Chapter 2, Predicate Logic: Semantics and Validity Chapter 3, More about Quantifiers Chapter 4, Transcription Chapter 5, Natural Deduction for Predicate Logic: Fundamentals Chapter 6, More on Natural Deduction for Predicate Logic Chapter 7, Truth Tress for Predicate Logic: Fundamentals Chapter 8, More on Truth Tress for Predicate Logic Chapter 9, Identity, Functions, and Definite Descriptions Chapter 10, Metatheory: The Basic Concepts Chapter 11, Mathematical Induction Chapter 12, Soundness and Completeness for Sentence Logic Trees Chapter 13, Soundness and Completeness for Sentence Logic Derivations Chapter 14, Koenig’s Lemma, Compactness, and Generalization to Infinite Sets of Premises Chapter 15, Interpretations, Soundness, and Completeness for Predicate Logic Index for Volume II Solutions Manual for Volume II Diagrammatic Summary of Rules Corrections to the Text. (shrink)

Semantic justifications of the classical rules of logical inference typically make use of a notion of bivalent truth, understood as a property guaranteed to attach to a sentence or its negation regardless of the prospects for speakers to determine it as so doing. For want of a convincing alternative account of classical logic, some philosophers suspicious of such recognition-transcending bivalence have seen no choice but to declare classical deduction unwarranted and settle for a weaker system; intuitionistic logic in (...) particular, buttressed by assertion-conditional semantics, is often considered to enjoy a degree of meaning-theoretical respectability unattainable by classical logic.The decision to forgo the classical inference rules is not always made lightly. Thus, Dummett: " In the resolution of the conflict between [the view that generally accepted classical modes of inference ought to be theoretically accommodated, and the demand that any such accommodation be achieved without recourse to bivalence] lies, as I see it, one of the most fundamental and intractable problems in the theory of meaning; indeed, in all philosophy. "The present article ventures to suggest that the conflict need not be irresoluble. Helping ourselves only to such conceptual resources as are standardly invoked by proponents of intuitionistic logic, we shall formulate a rudimentary meaning theory for a selection of logical constants, define a relation of valid inferability, and prove that the latter includes all of classical first-order logic. The result is essentially that reported in Sandqvist as Theorem 2.20.2. TheoryWe will be considering a standard-syntax first-order language with ⊃, ⊥ and ∀ as its only primitive logical constants. We assume countable supplies of individual constants, individual functors , and predicates , as well as a denumerably infinite set of individual variables. By a basic 1 formula we will mean one that …[Full Text of this Article]. (shrink)

It has been suggested that puzzles in the interpretation of quantum mechanics motivate consideration of entities that are numerically distinct but do not stand in a relation of identity with themselves or non-identity with others. Quite apart from metaphysical concerns, I argue that talk about such entities is either meaningless or not about such entities. It is meaningless insofar as we attempt to take the foregoing characterization literally. It is meaningful, however, if talk about entities without (...) class='Hi'>identity is taken as elliptical for either nominal or predicative use of a special class of mass terms. (shrink)

In this paper the language of first-order modal logic is enriched with an operator @ ('actually') such that, in any model, the evaluation of a formula @A at a possible world depends on the evaluation of A at the actual world. The models have world-variable domains. All the logics that are discussed extend the classical predicate calculus, with or without identity, and conform to the philosophical principle known as serious actualism. The basic logic relies on (...) the system K, whereas others correspond to various properties that the actual world may have. All the logics are axiomatized. (shrink)

I explain what haecceities are and the role they play in our thought and talk about specific individual things, whether those things are concrete or abstract. Everything that can be referred to by using a singular term has a haecceity. I distinguish between singular terms and general terms, on the one hand, and subject terms and predicate terms, on the other. I distinguish three types of sentence: singular predications; general predications; and singular quantifications. I show how singular predications can (...) be eliminated without loss of content, provided we have singular quantifications as well as general predications. This should not be confused with Quine’s “elimination of singular terms.” I say a few words about propositions. (shrink)

This clearly written book makes logic interesting and easier to learn without sacrificing content or rigor. It covers symbolization, proofs, counterexamples, and truth trees. These topics are presented in graded steps, beginning with the symbolization of categorical propositions and concluding with the properties of relations. Logic is applied to materials with which readers will be familiar; both examples and exercises are drawn from newspapers, television, and other popular sources. For individuals intrigued by the formal study of (...) class='Hi'>logic. (shrink)

After a summary of earlier work it is shown that elementary or Kalmar arithmetic can be interpreted within the system of Russell's Principia Mathematica with the axiom of infinity but without the axiom of reducibility.

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

The article deals with the interpretation of propositional attitudes in the framework of modal predicate logic. The first part discusses the classical puzzles arising from the interplay between propositional attitudes, quantifiers and the notion of identity. After comparing different reactions to these puzzles it argues in favor of an analysis in which evaluations of de re attitudes may vary relative to the ways of identifying objects used in the context of use. The second part of the article (...) gives this analysis a precise formalization from a model-and proof-theoretic perspective. (shrink)

This paper establishes model-theoretic properties of \, a variation of monadic first-order logic that features the generalised quantifier \. We will also prove analogous versions of these results in the simpler setting of monadic first-order logic with and without equality and \, respectively). For each logic \ we will show the following. We provide syntactically defined fragments of \ characterising four different semantic properties of \-sentences: being monotone and continuous in a given set of monadic predicates; (...) having truth preserved under taking submodels or being truth invariant under taking quotients. In each case, we produce an effectively defined map that translates an arbitrary sentence \ to a sentence \ belonging to the corresponding syntactic fragment, with the property that \ is equivalent to \ precisely when it has the associated semantic property. As a corollary of our developments, we obtain that the four semantic properties above are decidable for \-sentences. (shrink)

Identity, we're told, is the binary relation that every object bears to itself, and to itself only. But how can a relation be binary if it never relates two objects? This puzzled Russell and led Wittgenstein to declare that identity is not a relation between objects. The now standard view is that Wittgenstein's position is untenable, and that worries regarding the relational status of identity are the result of confusion. I argue that the rejection of identity (...) as a binary relation is perfectly tenable. To this end, I outline and defend a logical framework that is not committed to an objectual identity relation but is nevertheless expressively equivalent to first-order logic with identity. After it has thus been shown that there is no indispensability argument for objectual identity, I argue that we have good reasons for doubting the existence of such a relation, and rebut a number of attempts at discrediting these reasons. (shrink)

Along the same line as that in Ono (Ann Pure Appl Logic 161:246–250, 2009), a proof-theoretic approach to Glivenko theorems is developed here for substructural predicate logics relative not only to classical predicate logic but also to arbitrary involutive substructural predicate logics over intuitionistic linear predicate logic without exponentials QFLe. It is shown that there exists the weakest logic over QFLe among substructural predicate logics for which the Glivenko theorem holds. (...) Negative translations of substructural predicate logics are studied by using the same approach. First, a negative translation, called extended Kuroda translation is introduced. Then a translation result of an arbitrary involutive substructural predicate logics over QFLe is shown, and the existence of the weakest logic is proved among such logics for which the extended Kuroda translation works. They are obtained by a slight modification of the proof of the Glivenko theorem. Relations of our extended Kuroda translation with other standard negative translations will be discussed. Lastly, algebraic aspects of these results will be mentioned briefly. In this way, a clear and comprehensive understanding of Glivenko theorems and negative translations will be obtained from a substructural viewpoint. (shrink)