This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories
Siblings:
32 found
Search inside:
(import / add options)   Sort by:
  1. Natasha Alechina & Michiel van Lambalgen (1996). Generalized Quantification as Substructural Logic. Journal of Symbolic Logic 61 (3):1006-1044.
    We show how sequent calculi for some generalized quantifiers can be obtained by generalizing the Herbrand approach to ordinary first order proof theory. Typical of the Herbrand approach, as compared to plain sequent calculus, is increased control over relations of dependence between variables. In the case of generalized quantifiers, explicit attention to relations of dependence becomes indispensible for setting up proof systems. It is shown that this can be done by turning variables into structured objects, governed by various types of (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  2. Andrew Bacon (2013). A New Conditional for Naive Truth Theory. Notre Dame Journal of Formal Logic 54 (1):87-104.
    In this paper a logic for reasoning disquotationally about truth is presented and shown to have a standard model. This work improves on Hartry Field's recent results establishing consistency and omega-consistency of truth-theories with strong conditional logics. A novel method utilising the Banach fixed point theorem for contracting functions on complete metric spaces is invoked, and the resulting logic is shown to validate a number of principles which existing revision theoretic methods have heretofore failed to provide.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. Andrew Bacon (2013). Curry's Paradox and Omega Inconsistency. Studia Logica 101 (1):1-9.
    In recent years there has been a revitalised interest in non-classical solutions to the semantic paradoxes. In this paper I show that a number of logics are susceptible to a strengthened version of Curry's paradox. This can be adapted to provide a proof theoretic analysis of the omega-inconsistency in Lukasiewicz's continuum valued logic, allowing us to better evaluate which logics are suitable for a naïve truth theory. On this basis I identify two natural subsystems of Lukasiewicz logic which individually, but (...)
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  4. Andrew Bacon (2013). Paradoxes of Logical Equivalence and Identity. Topoi:1-10.
    In this paper a principle of substitutivity of logical equivalents salve veritate and a version of Leibniz’s law are formulated and each is shown to cause problems when combined with naive truth theories.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  5. Kosta Došen (1992). Modal Translations in Substructural Logics. Journal of Philosophical Logic 21 (3):283 - 336.
    Substructural logics are logics obtained from a sequent formulation of intuitionistic or classical logic by rejecting some structural rules. The substructural logics considered here are linear logic, relevant logic and BCK logic. It is proved that first-order variants of these logics with an intuitionistic negation can be embedded by modal translations into S4-type extensions of these logics with a classical, involutive, negation. Related embeddings via translations like the double-negation translation are also considered. Embeddings into analogues of S4 are obtained with (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  6. J. Michael Dunn, Mai Gehrke & Alessandra Palmigiano (2005). Canonical Extensions and Relational Completeness of Some Substructural Logics. Journal of Symbolic Logic 70 (3):713 - 740.
    In this paper we introduce canonical extensions of partially ordered sets and monotone maps and a corresponding discrete duality. We then use these to give a uniform treatment of completeness of relational semantics for various substructural logics with implication as the residual(s) of fusion.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  7. Ken-etsu Fujita (1998). On Proof Terms and Embeddings of Classical Substructural Logics. Studia Logica 61 (2):199-221.
    There is an intimate connection between proofs of the natural deduction systems and typed lambda calculus. It is well-known that in simply typed lambda calculus, the notion of formulae-as-types makes it possible to find fine structure of the implicational fragment of intuitionistic logic, i.e., relevant logic, BCK-logic and linear logic. In this paper, we investigate three classical substructural logics (GL, GLc, GLw) of Gentzen's sequent calculus consisting of implication and negation, which contain some of the right structural rules. In terms (...)
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  8. Nikolaos Galatos, Peter Jipsen, Tomasz Kowalski & Hiroakira Ono (2007). Residuated Lattices: An Algebraic Glimpse at Substructural Logics. Elsevier.
    This is also where we begin investigating lattices of logics and varieties, rather than particular examples.
    Remove from this list |
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  9. Nikolaos Galatos & Hiroakira Ono (2006). Glivenko Theorems for Substructural Logics Over FL. Journal of Symbolic Logic 71 (4):1353 - 1384.
    It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provable in the former iff its double negation is provable in the latter. We extend Glivenko's theorem and show that for every involutive substructural logic there exists a minimum substructural logic that contains the first via a double negation interpretation. Our presentation is algebraic and is formulated in the context of residuated lattices. In the last part (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. Nikolaos Galatos & Hiroakira Ono (2006). Algebraization, Parametrized Local Deduction Theorem and Interpolation for Substructural Logics Over FL. Studia Logica 83 (1-3):279 - 308.
    Substructural logics have received a lot of attention in recent years from the communities of both logic and algebra. We discuss the algebraization of substructural logics over the full Lambek calculus and their connections to residuated lattices, and establish a weak form of the deduction theorem that is known as parametrized local deduction theorem. Finally, we study certain interpolation properties and explain how they imply the amalgamation property for certain varieties of residuated lattices.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  11. Lou Goble (2007). Combinatory Logic and the Semantics of Substructural Logics. Studia Logica 85 (2):171 - 197.
    The results of this paper extend some of the intimate relations that are known to obtain between combinatory logic and certain substructural logics to establish a general characterization theorem that applies to a very broad family of such logics. In particular, I demonstrate that, for every combinator X, if LX is the logic that results by adding the set of types assigned to X (in an appropriate type assignment system, TAS) as axioms to the basic positive relevant logic B∘T, then (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  12. Lloyd Humberstone (2007). Investigations Into a Left-Structural Right-Substructural Sequent Calculus. Journal of Logic, Language and Information 16 (2):141-171.
    We study a multiple-succedent sequent calculus with both of the structural rules Left Weakening and Left Contraction but neither of their counterparts on the right, for possible application to the treatment of multiplicative disjunction (fission, ‘cotensor’, par) against the background of intuitionistic logic. We find that, as Hirokawa dramatically showed in a 1996 paper with respect to the rules for implication, the rules for this connective render derivable some new structural rules, even though, unlike the rules for implication, these rules (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  13. R. Jones (2013). Robert Goldblatt. Quantifiers, Propositions and Identity: Admissible Semantics for Quantified Modal and Substructural Logics. Lecture Notes in Logic; 38. Cambridge: Cambridge University Press, 2011. Isbn 978-1-107-01052-9. Pp. XIII + 282. [REVIEW] Philosophia Mathematica 21 (1):123-127.
    Remove from this list | Direct download (12 more)  
     
    My bibliography  
     
    Export citation  
  14. Norihiro Kamide (2003). Normal Modal Substructural Logics with Strong Negation. Journal of Philosophical Logic 32 (6):589-612.
    We introduce modal propositional substructural logics with strong negation, and prove the completeness theorems (with respect to Kripke models) for these logics.
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  15. Norihiro Kamide (2002). Substructural Logics with Mingle. Journal of Logic, Language and Information 11 (2):227-249.
    We introduce structural rules mingle, and investigatetheorem-equivalence, cut- eliminability, decidability, interpolabilityand variable sharing property for sequent calculi having the mingle.These results include new cut-elimination results for the extendedlogics: FLm (full Lambek logic with the mingle), GLm(Girard's linear logic with the mingle) and Lm (Lambek calculuswith restricted mingle).
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  16. Norihiro Kamide (2002). Kripke Semantics for Modal Substructural Logics. Journal of Logic, Language and Information 11 (4):453-470.
    We introduce Kripke semantics for modal substructural logics, and provethe completeness theorems with respect to the semantics. Thecompleteness theorems are proved using an extended Ishihara's method ofcanonical model construction (Ishihara, 2000). The framework presentedcan deal with a broad range of modal substructural logics, including afragment of modal intuitionistic linear logic, and modal versions ofCorsi's logics, Visser's logic, Méndez's logics and relevant logics.
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  17. Sato Kentaro (2008). Proper Semantics for Substructural Logics, From a Stalker Theoretic Point of View. Studia Logica 88 (2):295 - 324.
    We study filters in residuated structures that are associated with congruence relations (which we call -filters), and develop a semantical theory for general substructural logics based on the notion of primeness for those filters. We first generalize Stone’s sheaf representation theorem to general substructural logics and then define the primeness of -filters as being “points” (or stalkers) of the space, the spectrum, on which the representing sheaf is defined. Prime FL-filters will turn out to coincide with truth sets under various (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  18. Nils Kürbis (2008). Stable Harmony. In Peliš Michal (ed.), Logica Yearbook 2007.
    In this paper, I'll present a general way of "reading off" introduction/elimination rules from elimination/introduction rules, and define notions of harmony and stability on the basis of it.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  19. Motohiko Mouri & Norihiro Kamide (2008). Strong Normalizability of Typed Lambda-Calculi for Substructural Logics. Logica Universalis 2 (2):189-207.
    The strong normalization theorem is uniformly proved for typed λ-calculi for a wide range of substructural logics with or without strong negation.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  20. H. Naruse, Bayu Surarso & H. Ono (1998). A Syntactic Approach to Maksimova's Principle of Variable Separation for Some Substructural Logics. Notre Dame Journal of Formal Logic 39 (1):94-113.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  21. Francesco Paoli (2005). The Ambiguity of Quantifiers. Philosophical Studies 124 (3):313 - 330.
    In the tradition of substructural logics, it has been claimed for a long time that conjunction and inclusive disjunction are ambiguous:we should, in fact, distinguish between ‘lattice’ connectives (also called additive or extensional) and ‘group’ connectives (also called multiplicative or intensional). We argue that an analogous ambiguity affects the quantifiers. Moreover, we show how such a perspective could yield solutions for two well-known logical puzzles: McGee’s counterexample to modus ponens and the lottery paradox.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  22. Greg Restall, Relevant and Substructural Logics.
    This essay is structured around the bifurcation between proofs and models: The first section discusses Proof Theory of relevant and substructural logics, and the second covers the Model Theory of these logics. This order is a natural one for a history of relevant and substructural logics, because much of the initial work — especially in the Anderson–Belnap tradition of relevant logics — started by developing proof theory. The model theory of relevant logic came some time later. As we will see, (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  23. Greg Restall (forthcoming). Substructural Logics. Stanford Encyclopedia of Philosophy.
    summary of work in relevant in the Anderson– tradition.]; Mares Troestra, Anne, 1992, Lectures on , CSLI Publications [A quick, easy-to.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. Greg Restall (2000). An Introduction to Substructural Logics. Routledge.
    This is the first book to systematically survey new areas of substructural logics. This book is geared to introduce the topic to advanced students. An Introduction to Substructural Logics covers the area of logic that is crucial to developments in computing, philosophy and linguistics.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  25. Greg Restall (1998). Displaying and Deciding Substructural Logics 1: Logics with Contraposition. [REVIEW] Journal of Philosophical Logic 27 (2):179-216.
    Many logics in the relevant family can be given a proof theory in the style of Belnap's display logic (Belnap, 1982). However, as originally given, the proof theory is essentially more expressive than the logics they seek to model. In this paper, we consider a modified proof theory which more closely models relevant logics. In addition, we use this proof theory to show decidability for a large range of substructural logics.
    Remove from this list | Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  26. Gerhard Schurz & Paul D. Thorn (2012). REWARD VERSUS RISK IN UNCERTAIN INFERENCE: THEOREMS AND SIMULATIONS. Review of Symbolic Logic 5 (4):574-612.
    Systems of logico-probabilistic (LP) reasoning characterize inference from conditional assertions that express high conditional probabilities. In this paper we investigate four prominent LP systems, the systems O, P, Z, and QC. These systems differ in the number of inferences they licence (O ⊂ P ⊂ Z ⊂ QC). LP systems that license more inferences enjoy the possible reward of deriving more true and informative conclusions, but with this possible reward comes the risk of drawing more false or uninformative conclusions. In (...)
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  27. Lionel Shapiro (forthcoming). Naive Structure, Contraction, and Paradox. Topoi:1-13.
    Rejecting structural contraction has been pro- posed as a strategy for escaping semantic paradoxes. The challenge for its advocates has been to make intuitive sense of how contraction might fail. I offer a way of doing so, based on a ‘‘naive’’ interpretation of the relation between structure and logical vocabulary in a sequent proof system. The naive interpretation of structure motivates the most common way of blaming Curry-style paradoxes on illicit contraction. By contrast, the naive interpretation will not as easily (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  28. Lionel Shapiro (2011). Deflating Logical Consequence. Philosophical Quarterly 61 (243):320-342.
    Deflationists about truth seek to undermine debates about the nature of truth by arguing that the truth predicate is merely a device that allows us to express a certain kind of generality. I argue that a parallel approach is available in the case of logical consequence. Just as deflationism about truth offers an alternative to accounts of truth's nature in terms of correspondence or justification, deflationism about consequence promises an alternative to model-theoretic or proof-theoretic accounts of consequence's nature. I then (...)
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  29. Daisuke Souma (2007). An Algebraic Approach to the Disjunction Property of Substructural Logics. Notre Dame Journal of Formal Logic 48 (4):489-495.
    Some of the basic substructural logics are shown by Ono to have the disjunction property (DP) by using cut elimination of sequent calculi for these logics. On the other hand, this syntactic method works only for a limited number of substructural logics. Here we show that Maksimova's criterion on the DP of superintuitionistic logics can be naturally extended to one on the DP of substructural logics over FL. By using this, we show the DP for some of the substructural logics (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  30. Paul D. Thorn & Gerhard Schurz (forthcoming). A Utility Based Evaluation of Logico-Probabilistic Systems. Studia Logica:1-24.
    Systems of logico-probabilistic (LP) reasoning characterize inference from conditional assertions interpreted as expressing high conditional probabilities. In the present article, we investigate four prominent LP systems (namely, systems O, P, Z, and QC) by means of computer simulations. The results reported here extend our previous work in this area, and evaluate the four systems in terms of the expected utility of the dispositions to act that derive from the conclusions that the systems license. In addition to conforming to the dominant (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  31. Yde Venema (1995). Meeting Strength in Substructural Logics. Studia Logica 54 (1):3 - 32.
    This paper contributes to the theory of hybrid substructural logics, i.e. weak logics given by a Gentzen-style proof theory in which there is only alimited possibility to use structural rules. Following the literture, we use an operator to mark formulas to which the extra structural rules may be applied. New in our approach is that we do not see this as a modality, but rather as themeet of the marked formula with a special typeQ. In this way we can make (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  32. Heinrich Wansing (1996). Substructural Logics. Erkenntnis 45 (1):115-118.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation