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)

This paper discusses Crawley completions of residuated lattices. While MacNeille completions have been studied recently in relation to logic, Crawley completions (i.e. complete ideal completions), which are another kind of regular completions, have not been discussed much in this relation while many important algebraic works on Crawley completions had been done until the end of the 70’s. In this paper, basic algebraic properties of ideal completions and Crawley completions of residuated lattices are studied first in their conncetion with the join (...) infinite distributivity and Heyting implication. Then some results on algebraic completeness and conservativity of Heyting implication in substructural predicate logics are obtained as their consequences. (shrink)

Metacompleteness is used to prove properties such as the disjunction property and the existence property in the area of relevant logics. On the other hand, the disjunction property of several basic propositional substructural logics over FL has been proved using the cut elimination theorem of sequent calculi and algebraic characterization. The present paper shows that Meyer’s metavaluational technique and Slaney’s metavaluational technique can be applied to basic predicate intuitionistic substructural logics and basic predicate (...) involutive substructural logics, respectively. As a corollary of metacompleteness, the disjunction property, the existence property, and the admissibility of certain rules in such logics can be proved. (shrink)

We pursue the idea that predicate logic is a “fibred algebra” while propositional logic is a single algebra; in the context of intuitionism, this algebraic understanding of predicate logic goes back to Lawvere, in particular his concept of hyperdoctrine. Here, we aim at demonstrating that the notion of monad-relativised hyperdoctrines, which are what we call fibred algebras, yields algebraisations of a wide variety of predicate logics. More specifically, we discuss a typed, first-order version of the non-commutative (...) Full Lambek calculus, which has extensively been studied in the past few decades, functioning as a unifying language for different sorts of logical systems (classical, intuitionistic, linear, fuzzy, relevant, etc.). Through the concept of Full Lambek hyperdoctrines, we establish both generic and set-theoretical completeness results for any extension of the base system; the latter arises from a dual adjunction, and is relevant to the tripos-to-topos construction and quantale-valued sets. Furthermore, we give a hyperdoctrinal account of Girard’s and Gödel’s translation. (shrink)

Many systems of quantified modal logic cannot be characterised by Kripke's well-known possible worlds semantic analysis. This book shows how they can be characterised by a more general 'admissible semantics', using models in which there is a restriction on which sets of worlds count as propositions. This requires a new interpretation of quantifiers that takes into account the admissibility of propositions. The author sheds new light on the celebrated Barcan Formula, whose role becomes that of legitimising the Kripkean interpretation of (...) quantification. The theory is worked out for systems with quantifiers ranging over actual objects, and over all possibilia, and for logics with existence and identity predicates and definite descriptions. The final chapter develops a new admissible 'cover semantics' for propositional and quantified relevant logic, adapting ideas from the Kripke-Joyal semantics for intuitionistic logic in topos theory. This book is for mathematical or philosophical logicians, computer scientists and linguists. (shrink)

We introduce a substructural propositional calculus of Sequential Dynamic Logic that subsumes a propositional part of dynamic predicate logic, and is shown to be expressively equivalent to propositional dynamic logic. Completeness of the calculus with respect to the intended relational semantics is established.

Adding a transparent truth predicate to a language completely governed by classical logic is not possible. The trouble, as is well-known, comes from paradoxes such as the Liar and Curry. Recently, Cobreros, Egré, Ripley and van Rooij have put forward an approach based on a non-transitive notion of consequence which is suitable to deal with semantic paradoxes while having a transparent truth predicate together with classical logic. Nevertheless, there are some interesting issues concerning the set of metainferences validated (...) by this logic. In this paper, we show that this logic, once it is adequately understood, is weaker than classical logic. Moreover, the logic is in a way similar to the paraconsistent logic LP. (shrink)

We will present a three-valued consequence relation for metainferences, called CM, defined through ST and TS, two well known substructural consequence relations for inferences. While ST recovers every classically valid inference, it invalidates some classically valid metainferences. While CM works as ST at the inferential level, it also recovers every classically valid metainference. Moreover, CM can be safely expanded with a transparent truth predicate. Nevertheless, CM cannot recapture every classically valid meta-metainference. We will afterwards develop a hierarchy of (...) consequence relations CMn for metainferences of level n. Each CMn recovers every metainference of level n or less, and can be nontrivially expanded with a transparent truth predicate, but cannot recapture every classically valid metainferences of higher levels. Finally, we will present a logic CMω, based on the hierarchy of logics CMn, that is fully classical, in the sense that every classically valid metainference of any level is valid in it. Moreover, CMω can be nontrivially expanded with a transparent truth predicate. (shrink)

Lawvere hyperdoctrines give categorical algebraic semantics for intuitionistic predicate logic. Here we extend the hyperdoctrinal semantics to a broad variety of substructural predicate logics over the Typed Full Lambek Calculus, verifying their completeness with respect to the extended hyperdoctrinal semantics. This yields uniform hyperdoctrinal completeness results for numerous logics such as different types of relevant predicate logics and beyond, which are new results on their own; i.e., we give uniform categorical semantics for a (...) broad variety of non-classical predicate logics. And we introduce an analogue of Lawvere–Tierney topology and cotopology in the hyperdoctrinal setting, which gives a unifying perspective on different logical translations, in particular allowing for a uniform treatment of Girard’s exponential translation between linear and intuitionistic logics and of Kolmogorov’s double negation translation between intuitionistic and classical logics. In the hyerdoctrinal conception, type theories are categories, logics over type theories are functors, and logical translations between them, then, are natural transformations, in particular Lawvere–Tierney topologies and cotopologies on hyperdoctrines. The view of logical translations as hyperdoctrinal Lawvere–Tierney topologies and cotopologies has not been elucidated before, and may be seen as a novel contribution of the present work. From a broader perspective, this work may be regarded as taking first steps towards interplay between algebraic and categorical logics; it is, technically, a combination of substructural algebraic logic and hyperdoctrinal categorical logic, as the hyperdoctrinal completeness theorem is shown via the integration of the Lindenbaum–Tarski algebra construction with the syntactic category construction. As such this work lays a foundation for further interactions between algebraic and categorical logics. (shrink)

Recently, it has been proposed to understand a logic as containing not only a validity canon for inferences but also a validity canon for metainferences of any finite level. Then, it has been shown that it is possible to construct infinite hierarchies of "increasingly classical" logics—that is, logics that are classical at the level of inferences and of increasingly higher metainferences—all of which admit a transparent truth predicate. In this paper, we extend this line of investigation by (...) taking a somehow different route. We explore logics that are different from classical logic at the level of inferences, but recover some important aspects of classical logic at every metainferential level. We dub such systems meta-classical non-classical logics. We argue that the systems presented deserve to be regarded as logics in their own right and, moreover, are potentially useful for the non-classical logician. (shrink)

The article introduces substructural epistemic logics of belief supported by evidence. The logics combine normal modal epistemic logics with distributive substructural logics. Pieces of evidence are represented by points in substructural models and availability of evidence is modelled by a function on the point set. The main technical result is a general completeness theorem. Axiomatisations are provided by means of two-sorted Hilbert-style calculi. It is also shown that the framework presents a natural solution (...) to the problem of logical omniscience. (shrink)

Formal systems of fuzzy logic are well-established logical systems and respected members of the broad family of the so-called substructural logics closely related to the famous logic BCK. The study of fragments of logical systems is an important issue of research in any class of non-classical logics. Here we study the fragments of nine prominent fuzzy logics to all sublanguages containing implication. However, the results achieved in the paper for those nine logics are usually corollaries (...) of theorems with much wider scope of applicability. In particular, we show how many of these fragments are really distinct and we find axiomatic systems for most of them. In fact, we construct strongly separable axiomatic systems for eight of our nine logics. We also fully answer the question for which of the studied fragments the corresponding class of algebras forms a variety. Finally, we solve the problem how to axiomatize predicate versions of logics without the lattice disjunction. (shrink)

Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0.1]. In this paper, we introduce Uninorm logic UL as Multiplicative additive intuitionistic linear logic MAILL extended with the prelinearity axiom ((A → B) ∧ t) ∨ ((B → A) ∧ t). Axiomatic extensions of UL include known fuzzy logics such as Monoidal t-norm logic MTL and Gödel logic G, and new weakening-free logics. (...) Algebraic semantics for these logics are provided by subvarieties of (representable) pointed bounded commutative residuated lattices. Gentzen systems admitting cut-elimination are given in the framework of hypersequents. Completeness with respect to algebras with lattice reduct [0, 1] is established for UL and several extensions using a two-part strategy. First, completeness is proved for the logic extended with Takeuti and Titani's density rule. A syntactic elimination of the rule is then given using a hypersequent calculus. As an algebraic corollary, it follows that certain varieties of residuated lattices are generated by their members with lattice reduct [0, 1]. (shrink)

This paper is devoted to the formulation and investigation of a dynamic semantic interpretation of the language of first-order predicate logic. The resulting system, which will be referred to as ‘dynamic predicate logic’, is intended as a first step towards a compositional, non-representational theory of discourse semantics. In the last decade, various theories of discourse semantics have emerged within the paradigm of model-theoretic semantics. A common feature of these theories is a tendency to do away with the principle (...) of compositionality, a principle which, implicitly or explicitly, has dominated semantics since the days of Frege. Therefore the question naturally arises whether non-compositionality is in any way a necessary feature of discourse semantics. Since we subscribe to the interpretation of compositionality as constituting primarily a methodological principle, we consider this to be a methodological rather than an empirical question. As a consequence, the emphasis in the present paper lies on developing an alternative compositional semantics of discourse, which is empirically equivalent to its non-compositional brethren, but which differs from them in a principled methodological way. Hence, no attempts are made to improve on existing theories empirically. Nevertheless, as we indicate in section 5, the development of a compositional alternative may in the end have empirical consequences, too. First of all, it can be argued that the dynamic view on interpretation developed in this paper suggests natural and relatively easy to formulate extensions which enable one to deal with a wider range of phenomena than can be dealt with in existing theories. Moreover, the various approaches to the model-theoretic semantics of discourse that have been developed during the last decade, have constituted a ‘fresh start’ in the sense that much of what had been accomplished before was ignored, at least for a start. Of course, this is a justified strategy if one feels one is trying to develop a radically different approach to recalcitrant problems. However, there comes a time when such new approaches have to be compared with the older one, and when an assessment of the pros and cons of each has to be made. One of the main problems in semantics today, we feel, is that a semantic theory such as Montague grammar, and an approach like Kamp’s discourse representation theory, are hard to compare, let alone that it is possible to unify their insights and results.. (shrink)

We introduce several restricted versions of the structural rules in the implicational fragment of Gentzen's sequent calculus LJ. For example, we permit the applications of a structural rule only if its principal formula is an implication. We investigate cut-eliminability and theorem-equivalence among various combinations of them. The results include new cut-elimination theorems for the implicational fragments of the following logics: relevant logic E, strict implication S4, and their neighbors (e.g., E-W and S4-W); BCI-logic, BCK-logic, relevant logic R, and the (...) intuitionistic logic. (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.

Fix a weakly minimal (i.e. superstable U-rank 1) structure M. Let M∗ be an expansion by constants for an elementary substructure, and let A be an arbitrary subset of the universe M. We show that all formulas in the expansion (M∗,A) are equivalent to bounded formulas, and so (M,A) is stable (or NIP) if and only if the M-induced structure AM on A is stable (or NIP). We then restrict to the case that M is a pure abelian group with (...) a weakly minimal theory, and AM is mutually algebraic (equivalently, weakly minimal with trivial forking). This setting encompasses most of the recent research on stable expansions of (Z,+). Using various characterizations of mutual algebraicity, we give new examples of stable structures of the form (M,A). Most notably, we show that if (G,+) is a weakly minimal additive subgroup of the algebraic numbers, A⊆G is enumerated by a homogeneous linear recurrence relation with algebraic coefficients, and no repeated root of the characteristic polynomial of A is a root of unity, then (G,+,B) is superstable for any B⊆A. (shrink)

We develop a predicate logical extension of a subintuitionistic propositional logic. Therefore a Hilbert type calculus and a Kripke type model are given. The propositional logic is formulated to axiomatize the idea of strategic weakening of Kripke''s semantic for intuitionistic logic: dropping the semantical condition of heredity or persistence leads to a nonmonotonic model. On the syntactic side this leads to a certain restriction imposed on the deduction theorem. By means of a Henkin argument strong completeness is proved making (...) use of predicate logical principles, which are only classically acceptable. (shrink)

This paper deals with various substructural propositional logics, in particular with substructural subsystems of Nelson's constructive propositional logics N– and N. Doen's groupoid semantics is extended to these constructive systems and is provided with an informational interpretation in terms of information pieces and operations on information pieces.

A logic-enriched type theory is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named and , which we claim correspond closely to the classical predicative systems of second order arithmetic and . We justify this claim by translating each second order system into the corresponding LTT, and proving that these translations are conservative. This is part of an ongoing research project to investigate how LTTs may be used to formalise different approaches (...) to the foundations of mathematics.The two LTTs we construct are subsystems of the logic-enriched type theory , which is intended to formalise the classical predicative foundation presented by Herman Weyl in his monograph Das Kontinuum. The system has also been claimed to correspond to Weyl’s foundation. By casting and as LTTs, we are able to compare them with . It is a consequence of the work in this paper that is strictly stronger than .The conservativity proof makes use of a novel technique for proving one LTT conservative over another, involving defining an interpretation of the stronger system out of the expressions of the weaker. This technique should be applicable in a wide variety of different cases outside the present work. (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)

Predicates are supposed to slice reality neatly in two halves, one for which the predicate holds, the other for which it fails. Yet far from being razors, predicates tend to be dull knives that mangle reality. If reality is a tomato and predicates are knives, then when these knives divide the tomato, plenty of mush remains unaccounted for. Of course some knives are sharper than others, just as some predicates are less vague than others. “x is water” is certainly (...) sharper than “x is beautiful.” But perfect sharpness, perfect boundaries, and perfect separation seem only to obtain in mathematics. The vagueness inherent in many predicates became particularly evident in the twentieth century. Quantum mechanics, the revival of certain ancient paradoxes, and the philosophy of science all contributed to a growing awareness that vagueness was ineliminable from many predicates. Quantum mechanical superposition seems to allow mutually exclusive simultaneous states. In searching for plausible interpretations of quantum mechanics, some researchers attempted to do away with classical bivalent logic. In its place they substituted multivalent quantum logics. Any logic with more than two values forces its predicates to slice reality into more than two parts. Ancient paradoxes involving heaps and baldness also pointed up the 1 Random Predicate Logic 2.. (shrink)

The paper provides a uniform Gentzen-style proof-theoretic framework for various subsystems of classical predicate logic. In particular, predicate logics obtained by adopting van Behthem''s modal perspective on first-order logic are considered. The Gentzen systems for these logics augment Belnap''s display logic by introduction rules for the existential and the universal quantifier. These rules for x and x are analogous to the display introduction rules for the modal operators and and do not themselves allow the Barcan formula (...) or its converse to be derived. En route from the minimal modal predicate logic to full first-order logic, axiomatic extensions are captured by purely structural sequent rules. (shrink)

• 1st try: Free variables in PL (Predicate Logic) (1) Jim1 came in. He1 sat down. (antecedent Jim1 … anaphoric he1) |=M, g cm ιx(x = z1  z1 = jim)  sit z1 iff g(z1) ∈ cm & g(z1) = jim & g(z1) ∈ sit.

In this paper, we show that the predicate logics of consistent extensions of Heyting's Arithmetic plus Church's Thesis with uniqueness condition are complete $\Pi _{2}^{0}$. Similarly, we show that the predicate logic of HA*, i.e. Heyting's Arithmetic plus the Completeness Principle (for HA*) is complete $\Pi _{2}^{0}$. These results extend the known results due to Valery Plisko. To prove the results we adapt Plisko's method to use Tennenbaum's Theorem to prove 'categoricity of interpretations' under certain assumptions.

For each ordinal $\alpha > 0, L(\alpha)$ is the intermediate predicate logic characterized by the class of all Kripke frames with the poset α and with constant domain. This paper will be devoted to a study of logics of the form L(α). It will be shown that for each uncountable ordinal of the form α + η with a finite or a countable $\eta (> 0)$ , there exists a countable ordinal of the form β + η such (...) that L(α + η) = L(β + η). On the other hand, such a reduction of ordinals to countable ones is impossible for a logic L(α) if α is an uncountable regular ordinal. Moreover, it will be proved that the mapping L is injective if it is restricted to ordinals less than ω ω , i.e. α ≠ β implies L(α) ≠ L(β) for each ordinal $\alpha,\beta. (shrink)

A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including donkey sentences and cross-sentential anaphora. A proof system in natural deduction format is provided, and the formalism is compared with other accounts of this type of anaphora, in particular Dynamic Predicate Logic.

The paper presents predicate logical extensions of some subintuitionistic logics. Subintuitionistic logics result if conditions of the accessibility relation in Kripke models for intuitionistic logic are dropped. The accessibility relation which interprets implication in models for the propositional base subintuitionistic logic considered here is neither persistent on atoms, nor reflexive, nor transitive. Strongly complete predicate logical extensions are modeled with a second accessibility relation, which is a partial order, for the interpretation of the universal quantifier.

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 logic.

Shehtman and Skvortsov introduced Kripke bundles as semantics of non-classical first-order predicate logics. We show the structural equivalence between Kripke bundles for intermediate predicate lógics and Kripke-type frames for intuitionistic modal propositional logics. This equivalence enables us to develop the semantical study of relations between intermediate predicate logics and intuitionistic modal propositional logics. New examples of modal counterparts of intermediate predicate logics are given.

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 paper we introduce a notion of context for Groenendijk & Stokhof's Dynamic Predicate Logic DPL. We use these contexts to give a characterization of the relations on assignments that can be generated by composition from tests and random resettings in the case that we are working over an infinite domain. These relations are precisely the ones expressible in DPL if we allow ourselves arbitrary tests as a starting point. We discuss some possible extensions of DPL and the (...) way these extensions interact with our notion of context. (shrink)

D2.1 (PL models and assignments) i. A PL model is a pair M = 〈DM, ·M〉 such that (a) DM is a non-empty set, and (b) ·M maps each A ∈ Con to AM ∈ DM, and each B ∈ Prdn to BM  (DM)n. ii. GM = {g| g: Var  DM} is the set of M-assignments. For any g ∈ GM, u ∈ Var, d ∈ DM, g[u/d] := (g\{u, g(u)})  {u, d} is the u-to-d alternative to (...) g. (shrink)

Monoidal t-norm based logic $\mathbf {MTL}$ is the weakest t-norm based residuated fuzzy logic, which is a $[0,1]$ -valued propositional logical system having a t-norm and its residuum as truth function for conjunction and implication. Monadic fuzzy predicate logic $\mathbf {mMTL\forall }$ that consists of the formulas with unary predicates and just one object variable, is the monadic fragment of fuzzy predicate logic $\mathbf {MTL\forall }$, which is indeed the predicate version of monoidal t-norm based logic $\mathbf (...) {MTL}$. The main aim of this paper is to give an algebraic proof of the completeness theorem for monadic fuzzy predicate logic $\mathbf {mMTL\forall }$ and some of its axiomatic extensions. Firstly, we survey the axiomatic system of monadic algebras for t-norm based residuated fuzzy logic and amend some of them, thus showing that the relationships for these monadic algebras completely inherit those for corresponding algebras. Subsequently, using the equivalence between monadic fuzzy predicate logic $\mathbf {mMTL\forall }$ and S5-like fuzzy modal logic $\mathbf {S5(MTL)}$, we prove that the variety of monadic MTL-algebras is actually the equivalent algebraic semantics of the logic $\mathbf {mMTL\forall }$, giving an algebraic proof of the completeness theorem for this logic via functional monadic MTL-algebras. Finally, we further obtain the completeness theorem of some axiomatic extensions for the logic $\mathbf {mMTL\forall }$, and thus give a major application, namely, proving the strong completeness theorem for monadic fuzzy predicate logic based on involutive monoidal t-norm logic $\mathbf {mIMTL\forall }$ via functional representation of finitely subdirectly irreducible monadic IMTL-algebras. (shrink)

In this work we extend results from [4], [3] and [2] about propositional calculi with graded modalities to the predicative level. Our semantic is based on Kripke models with a single domain of interpretation for all the worlds. Therefore the axiomatic system will need a suitable generalization of the Barcan formula. We haven't considered semantics with world-relative domains because they don't present any new difficulties with respect to classical case. Our language will have, as in [1], constant and function symbols, (...) but they will have a rigid interpretation. In this instance the terms will be considered rigid designators, that is, their interpretations will be the same in all possible worlds (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)

An intermediate predicate logicS + n (n>0) is introduced and investigated. First, a sequent calculusGS n is introduced, which is shown to be equivalent toS + n and for which the cut elimination theorem holds. In § 2, it will be shown thatS + n is characterized by the class of all linear Kripke frames of the heightn.

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)