Switch to: References

Add citations

You must login to add citations.
  1. Meaning and Interpretation. I.Urszula Wybraniec-Skardowska - 2007 - Studia Logica 85 (1):105-132.
    The paper is an attempt at a logical explication of some crucial notions of current general semantics and pragmatics. A general, axiomatic, formal-logical theory of meaning and interpretation is outlined in this paper.In the theory, accordingto the token-type distinction of Peirce, language is formalised on two levels: first as a language of token-objects (understood as material, empirical, enduring through time-and space objects) and then – as a language of type-objects (understood as abstract objects, as classes of tokens). The basic concepts (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Against ellipsis: arguments for the direct licensing of ‘noncanonical’ coordinations.Yusuke Kubota & Robert Levine - 2015 - Linguistics and Philosophy 38 (6):521-576.
    Categorial grammar is well-known for its elegant analysis of coordination enabled by the flexible notion of constituency it entertains. However, to date, no systematic study exists that examines whether this analysis has any obvious empirical advantage over alternative analyses of nonconstituent coordination available in phrase structure-based theories of syntax. This paper attempts precisely such a comparison. We compare the direct constituent coordination analysis of non-canonical coordinations in categorial grammar with an ellipsis-based analysis of the same phenomena in the recent HPSG (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Non-normal modalities in variants of linear logic.D. Porello & N. Troquard - 2015 - Journal of Applied Non-Classical Logics 25 (3):229-255.
    This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of linear logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have shown that the results scale up to logics with multiple non-minimal modalities. Here, we start with the language of propositional intuitionistic linear logic without the additive disjunction, to which we add a modality. We provide an interpretation of this language on a class of Kripke resource models (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On Language Adequacy.Urszula Wybraniec-Skardowska - 2015 - Studies in Logic, Grammar and Rhetoric 40 (1):257-292.
    The paper concentrates on the problem of adequate reflection of fragments of reality via expressions of language and inter-subjective knowledge about these fragments, called here, in brief, language adequacy. This problem is formulated in several aspects, the most being: the compatibility of language syntax with its bi-level semantics: intensional and extensional. In this paper, various aspects of language adequacy find their logical explication on the ground of the formal-logical theory T of any categorial language L generated by the so-called classical (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Trivalent logics arising from L-models for the Lambek calculus with constants.S. L. Kuznetsov - 2014 - Journal of Applied Non-Classical Logics 24 (1-2):132-137.
    We consider language models for the Lambek calculus that allow empty antecedents and enrich them with constants for the empty language and for the language containing only the empty word. No complete calculi are known with respect to these semantics, and in this paper we consider several trivalent systems that arise as fragments of these models? logics.
    Download  
     
    Export citation  
     
    Bookmark  
  • Dependency grammar.Geert-Jan M. Kruijff - 2005 - In Keith Brown (ed.), Encyclopedia of Language and Linguistics. Elsevier. pp. 444--450.
    Download  
     
    Export citation  
     
    Bookmark  
  • Agnostic hyperintensional semantics.Carl Pollard - 2015 - Synthese 192 (3):535-562.
    A hyperintensional semantics for natural language is proposed which is agnostic about the question of whether propositions are sets of worlds or worlds are sets of propositions. Montague’s theory of intensional senses is replaced by a weaker theory, written in standard classical higher-order logic, of fine-grained senses which are in a many-to-one correspondence with intensions; Montague’s theory can then be recovered from the proposed theory by identifying the type of propositions with the type of sets of worlds and adding an (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Paycheck Pronouns, Bach-Peters Sentences, and Variable-Free Semantics.Pauline Jacobson - 2000 - Natural Language Semantics 8 (2):77-155.
    This paper argues for the hypothesis of direct compositionality (as in, e.g., Montague 1974), according to which the combinatory syntactic rules specify a set of well-formed expressions while the semantic combinatory rules work in tandem to directly supply a model-theoretic interpretation to each expression as it is "built" in the syntax. (This thus obviates the need for any level like LF and, concomitantly, for any rules mapping surface structures to such a level.) I focus here on one related group of (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • The Displacement Calculus.Glyn Morrill, Oriol Valentín & Mario Fadda - 2011 - Journal of Logic, Language and Information 20 (1):1-48.
    If all dependent expressions were adjacent some variety of immediate constituent analysis would suffice for grammar, but syntactic and semantic mismatches are characteristic of natural language; indeed this is a, or the, central problem in grammar. Logical categorial grammar reduces grammar to logic: an expression is well-formed if and only if an associated sequent is a theorem of a categorial logic. The paradigmatic categorial logic is the Lambek calculus, but being a logic of concatenation the Lambek calculus can only capture (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • On contextual domain restriction in categorial grammar.Erich H. Rast - 2013 - Synthese 190 (12):2085-2115.
    Abstract -/- Quantifier domain restriction (QDR) and two versions of nominal restriction (NR) are implemented as restrictions that depend on a previously introduced interpreter and interpretation time in a two-dimensional semantic framework on the basis of simple type theory and categorial grammar. Against Stanley (2002) it is argued that a suitable version of QDR can deal with superlatives like tallest. However, it is shown that NR is needed to account for utterances when the speaker intends to convey different restrictions for (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Semantic Vector Models and Functional Models for Pregroup Grammars.Anne Preller & Mehrnoosh Sadrzadeh - 2011 - Journal of Logic, Language and Information 20 (4):419-443.
    We show that vector space semantics and functional semantics in two-sorted first order logic are equivalent for pregroup grammars. We present an algorithm that translates functional expressions to vector expressions and vice-versa. The semantics is compositional, variable free and invariant under change of order or multiplicity. It includes the semantic vector models of Information Retrieval Systems and has an interior logic admitting a comprehension schema. A sentence is true in the interior logic if and only if the ‘usual’ first order (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Bound variables in syntax (Are there any?).Anna Szabolcsi - 1987 - In J. Groenendijk, F. Veltman & M. Stokhof (eds.), Sixth Amsterdam Colloquium Proceedings. Univ of Amserdam.
    Current theories of grammar handle both extraction and anaphorization by introducing variables into syntactic representations. Combinatory categorial grammar eliminates variables corresponding to gaps. Using the combinator W, the paper extends this approach to anaphors, which appear to act as overt bound variables. [Slightly extended version in Bartsch et al 1989.].
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • New directions in type-theoretic grammars.Reinhard Muskens - 2010 - Journal of Logic, Language and Information 19 (2):129-136.
    This paper argues for the idea that in describing language we should follow Haskell Curry in distinguishing between the structure of an expression and its appearance or manifestation . It is explained how making this distinction obviates the need for directed types in type-theoretic grammars and a simple grammatical formalism is sketched in which representations at all levels are lambda terms. The lambda term representing the abstract structure of an expression is homomorphically translated to a lambda term representing its manifestation, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Categorial Grammar and Lexical-Functional Grammar.Reinhard Muskens - 2001 - In Miriam Butt & Tracey Holloway King (eds.), Proceedings of the LFG01 Conference, University of Hong Kong. CSLI Publications. pp. 259-279.
    This paper introduces λ-grammar, a form of categorial grammar that has much in common with LFG. Like other forms of categorial grammar, λ-grammars are multi-dimensional and their components are combined in a strictly parallel fashion. Grammatical representations are combined with the help of linear combinators, closed pure λ-terms in which each abstractor binds exactly one variable. Mathematically this is equivalent to employing linear logic, in use in LFG for semantic composition, but the method seems more practicable.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Construction by Description in Discourse Representation.Noor van Leusen & Reinhard Muskens - 2003 - In Jaroslav Peregrin (ed.), Meaning: the dynamic turn. Oxford, UK: Elsevier Science. pp. 33-65.
    This paper uses classical logic for a simultaneous description of the syntax and semantics of a fragment of English and it is argued that such an approach to natural language allows procedural aspects of linguistic theory to get a purely declarative formulation. In particular, it will be shown how certain construction rules in Discourse Representation Theory, such as the rule that indefinites create new discourse referents and definites pick up an existing referent, can be formulated declaratively if logic is used (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Optionality, scope, and licensing: An application of partially ordered categories.Raffaella Bernardi & Anna Szabolcsi - 2008 - Journal of Logic, Language and Information 17 (3):237-283.
    This paper uses a partially ordered set of syntactic categories to accommodate optionality and licensing in natural language syntax. A complex but well-studied data set pertaining to the syntax of quantifier scope and negative polarity licensing in Hungarian is used to illustrate the proposal. The presentation is geared towards both linguists and logicians. The paper highlights that the main ideas can be implemented in different grammar formalisms, and discusses in detail an implementation where the partial ordering on categories is given (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Separating syntax and combinatorics in categorial grammar.Reinhard Muskens - 2007 - Research on Language and Computation 5 (3):267-285.
    The ‘syntax’ and ‘combinatorics’ of my title are what Curry (1961) referred to as phenogrammatics and tectogrammatics respectively. Tectogrammatics is concerned with the abstract combinatorial structure of the grammar and directly informs semantics, while phenogrammatics deals with concrete operations on syntactic data structures such as trees or strings. In a series of previous papers (Muskens, 2001a; Muskens, 2001b; Muskens, 2003) I have argued for an architecture of the grammar in which finite sequences of lambda terms are the basic data structures, (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Modal translations in substructural logics.Kosta Došen - 1992 - 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Efficiency of pregroups and the French noun phrase.Sylvain Degeilh & Anne Preller - 2005 - Journal of Logic, Language and Information 14 (4):423-444.
    We study mathematical and algorithmic properties of Lambek's pregroups and illustrate them by the French noun phrase. An algorithm of complexity n3 to solve the reduction problem in an arbitrary free pregroup as well as recognition by a pregroup grammar is presented. This algorithm is then specified to run in linear time. A sufficient condition for a language fragment that makes the linear algorithm complete is given.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Quantifiers, anaphora, and intensionality.Mary Dalrymple, John Lamping, Fernando Pereira & Vijay Saraswat - 1997 - Journal of Logic, Language and Information 6 (3):219-273.
    The relationship between Lexical-Functional Grammar (LFG) functional structures (f-structures) for sentences and their semanticinterpretations can be formalized in linear logic in a way thatcorrectly explains the observed interactions between quantifier scopeambiguity, bound anaphora and intensionality.Our linear-logic formalization of the compositional properties ofquantifying expressions in natural language obviates the need forspecial mechanisms, such as Cooper storage, in representing thescoping possibilities of quantifying expressions. Instead, thesemantic contribution of a quantifier is recorded as a linear-logicformula whose use in a proof will establish the (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Types as graphs: Continuations in type logical grammar. [REVIEW]Chris Barker & Chung-Chieh Shan - 2006 - Journal of Logic, Language and Information 15 (4):331-370.
    Using the programming-language concept of continuations, we propose a new, multimodal analysis of quantification in Type Logical Grammar. Our approach provides a geometric view of in-situ quantification in terms of graphs, and motivates the limited use of empty antecedents in derivations. Just as continuations are the tool of choice for reasoning about evaluation order and side effects in programming languages, our system provides a principled, type-logical way to model evaluation order and side effects in natural language. We illustrate with an (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Parasitic scope.Chris Barker - 2007 - Linguistics and Philosophy 30 (4):407-444.
    I propose the first strictly compositional semantic account of same. New data, including especially NP-internal uses such as two men with the same name, suggests that same in its basic use is a quantificational element taking scope over nominals. Given type-lifting as a generally available mechanism, I show that this follows naturally from the fact that same is an adjective. Independently-motivated assumptions extend the analysis to standard examples such as Anna and Bill read the same book via a mechanism I (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • The competence-performance distinction in mental philosophy.Raymond J. Nelson - 1978 - Synthese 39 (November):337-382.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Mereological Basis of Truthmaker Semantics.Daniele Porello & Giovanni Gonella - forthcoming - Topoi:1-18.
    This articles explores the mereological foundation of truthmaker semantics. Building upon Kit Fine’s abstract theory of part in [16], we engage in an exploration of the mereological assumptions that determine the construction of truthmaker semantics. Our approach yields semantics for a diverse range of logics, including substructural logics such as the associative Lambek calculus, as well as the logics of analytic containment. Furthermore, we elucidate the philosophical implications that arise from this pioneering approach.
    Download  
     
    Export citation  
     
    Bookmark  
  • Peter Schroeder-Heister on Proof-Theoretic Semantics.Thomas Piecha & Kai F. Wehmeier (eds.) - 2024 - Springer.
    This open access book is a superb collection of some fifteen chapters inspired by Schroeder-Heister's groundbreaking work, written by leading experts in the field, plus an extensive autobiography and comments on the various contributions by Schroeder-Heister himself. For several decades, Peter Schroeder-Heister has been a central figure in proof-theoretic semantics, a field of study situated at the interface of logic, theoretical computer science, natural-language semantics, and the philosophy of language. -/- The chapters of which this book is composed discuss the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Collection Frames for Distributive Substructural Logics.Greg Restall & Shawn Standefer - 2023 - Review of Symbolic Logic 16 (4):1120-1157.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Substructural approaches to paradox: an introduction to the special issue.Elia Zardini - 2021 - Synthese 199 (3):493-525.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Logical Form and the Limits of Thought.Manish Oza - 2020 - Dissertation, University of Toronto
    What is the relation of logic to thinking? My dissertation offers a new argument for the claim that logic is constitutive of thinking in the following sense: representational activity counts as thinking only if it manifests sensitivity to logical rules. In short, thinking has to be minimally logical. An account of thinking has to allow for our freedom to question or revise our commitments – even seemingly obvious conceptual connections – without loss of understanding. This freedom, I argue, requires that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • AI-Completeness: Using Deep Learning to Eliminate the Human Factor.Kristina Šekrst - 2020 - In Sandro Skansi (ed.), Guide to Deep Learning Basics. Springer. pp. 117-130.
    Computational complexity is a discipline of computer science and mathematics which classifies computational problems depending on their inherent difficulty, i.e. categorizes algorithms according to their performance, and relates these classes to each other. P problems are a class of computational problems that can be solved in polynomial time using a deterministic Turing machine while solutions to NP problems can be verified in polynomial time, but we still do not know whether they can be solved in polynomial time as well. A (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • From Hilbert proofs to consecutions and back.Tore Fjetland Øgaard - 2021 - Australasian Journal of Logic 18 (2):51-72.
    Restall set forth a "consecution" calculus in his "An Introduction to Substructural Logics." This is a natural deduction type sequent calculus where the structural rules play an important role. This paper looks at different ways of extending Restall's calculus. It is shown that Restall's weak soundness and completeness result with regards to a Hilbert calculus can be extended to a strong one so as to encompass what Restall calls proofs from assumptions. It is also shown how to extend the calculus (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On Metaknowledge and Truth.Wybraniec-Skardowska Urszula - 2009 - In Jacek Malinowski David Makinson & Wansing Heinrich (eds.), Towards Mathematical Philosophy. Springer. pp. 319-243.
    The paper deals with the problem of logical adequacy of language knowledge with cognition of reality. A logical explication of the concept of language knowledge conceived of as a kind of codified knowledge is taken into account in the paper. Formal considerations regarding the notions of meta-knowledge (logical knowledge about language knowledge) and truth are developed in the spirit of some ideas presented in the author’s earlier papers (1991, 1998, 2001a,b, 2007a,b,c) treating about the notions of meaning, denotation and truthfulness (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Case for Comparability.Cian Dorr, Jacob M. Nebel & Jake Zuehl - 2023 - Noûs 57 (2):414-453.
    We argue that all comparative expressions in natural language obey a principle that we call Comparability: if x and y are at least as F as themselves, then either x is at least as F as y or y is at least as F as x. This principle has been widely rejected among philosophers, especially by ethicists, and its falsity has been claimed to have important normative implications. We argue that Comparability is needed to explain the goodness of several patterns (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Infinity and the foundations of linguistics.Ryan M. Nefdt - 2019 - Synthese 196 (5):1671-1711.
    The concept of linguistic infinity has had a central role to play in foundational debates within theoretical linguistics since its more formal inception in the mid-twentieth century. The conceptualist tradition, marshalled in by Chomsky and others, holds that infinity is a core explanandum and a link to the formal sciences. Realism/Platonism takes this further to argue that linguistics is in fact a formal science with an abstract ontology. In this paper, I argue that a central misconstrual of formal apparatus of (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Logical Conceptualization of Knowledge on the Notion of Language Communication.Urszula Wybraniec-Skardowska - 2017 - Studies in Logic, Grammar and Rhetoric 52 (1):247-269.
    The main objective of the paper is to provide a conceptual apparatus of a general logical theory of language communication. The aim of the paper is to outline a formal-logical theory of language in which the concepts of the phenomenon of language communication and language communication in general are defined and some conditions for their adequacy are formulated. The theory explicates the key notions of contemporary syntax, semantics, and pragmatics. The theory is formalized on two levels: token-level and type-level. As (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Logic and Sense.Urszula Wybraniec-Skardowska - 2016 - Philosophy Study 6 (9).
    In the paper, original formal-logical conception of syntactic and semantic: intensional and extensional senses of expressions of any language L is outlined. Syntax and bi-level intensional and extensional semantics of language L are characterized categorically: in the spirit of some Husserl’s ideas of pure grammar, Leśniewski-Ajukiewicz’s theory syntactic/semantic categories and in accordance with Frege’s ontological canons, Bocheński’s famous motto—syntax mirrors ontology and some ideas of Suszko: language should be a linguistic scheme of ontological reality and simultaneously a tool of its (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Husserl's Logical Grammar.Ansten Klev - 2018 - History and Philosophy of Logic 39 (3):232-269.
    Lecture notes from Husserl's logic lectures published during the last 20 years offer a much better insight into his doctrine of the forms of meaning than does the fourth Logical Investigation or any other work published during Husserl's lifetime. This paper provides a detailed reconstruction, based on all the sources now available, of Husserl's system of logical grammar. After having explained the notion of meaning that Husserl assumes in his later logic lectures as well as the notion of form of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • O expressivismo lógico de Aristóteles segundo Lucas Angioni: um breve e introdutório quadro teórico.Aislan Fernandes Pereira - 2017 - Books of Abstracts (3rd FILOMENA Workshop).
    Download  
     
    Export citation  
     
    Bookmark  
  • Judgement aggregation in non-classical logics.Daniele Porello - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):106-139.
    This work contributes to the theory of judgement aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgement aggregation to cope with non-classical logics, we discuss in particular results for the case of Intuitionistic Logic, the Lambek calculus, Linear Logic and Relevant Logics. The motivation for studying judgement aggregation in non-classical logics is that they offer a number of modelling choices to represent agents’ reasoning in aggregation problems. By studying judgement aggregation in logics that (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Shifting Priorities: Simple Representations for Twenty-seven Iterated Theory Change Operators.Hans Rott - 2009 - In Jacek Malinowski David Makinson & Wansing Heinrich (eds.), Towards Mathematical Philosophy. Springer. pp. 269–296.
    Prioritized bases, i.e., weakly ordered sets of sentences, have been used for specifying an agent’s ‘basic’ or ‘explicit’ beliefs, or alternatively for compactly encoding an agent’s belief state without the claim that the elements of a base are in any sense basic. This paper focuses on the second interpretation and shows how a shifting of priorities in prioritized bases can be used for a simple, constructive and intuitive way of representing a large variety of methods for the change of belief (...)
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • Meaning and Interpretation. II.Urszula Wybraniec-Skardowska - 2007 - Studia Logica 85 (2):261-274.
    The paper enriches the conceptual apparatus of the theory of meaning and denotation that was presented in Part I (Section 3). This part concentrates on the notion of interpretation, which is defined as an equivalence class of the relation possessing the same manner of interpreting types. In this part, some relations between meaning and interpretation, as well as one between denotation an interpretational denotation are established. In the theory of meaning and interpretation, the notion of language communication has been formally (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Decision problems for propositional linear logic.Patrick Lincoln, John Mitchell, Andre Scedrov & Natarajan Shankar - 1992 - Annals of Pure and Applied Logic 56 (1-3):239-311.
    Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic accounting of resources. This accounting is made possible by removing the ‘structural’ rules of contraction and weakening, adding a modal operator and adding finer versions of the propositional connectives. Linear logic has fundamental logical interest and applications to computer science, particularly to Petri nets, concurrency, storage allocation, garbage collection and the control structure of logic programs. In addition, there is a direct correspondence between polynomial-time computation (...)
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • (1 other version)Cut-rule axiomatization of the syntactic calculus NL.Wojciech Zielonka - 2000 - Journal of Logic, Language and Information 9 (3):339-352.
    An axiomatics of the product-free syntactic calculus L ofLambek has been presented whose only rule is the cut rule. It was alsoproved that there is no finite axiomatics of that kind. The proofs weresubsequently simplified. Analogous results for the nonassociativevariant NL of L were obtained by Kandulski. InLambek's original version of the calculus, sequent antecedents arerequired to be nonempty. By removing this restriction, we obtain theextensions L 0 and NL 0 ofL and NL, respectively. Later, the finiteaxiomatization problem for L (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Geach’s Categorial Grammar.Lloyd Humberstone - 2004 - Linguistics and Philosophy 28 (3):281 - 317.
    Geach’s rich paper ‘A Program for Syntax’ introduced many ideas into the arena of categorial grammar, not all of which have been given the attention they warrant in the thirty years since its first publication. Rather surprisingly, one of our findings (Section 3 below) is that the paper not only does not contain a statement of what has widely come to be known as “Geach’s Rule”, but in fact presents considerations which are inimical to the adoption of the rule in (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Categorial Grammar and Type Theory.Johan Van Benthem - 1990 - Journal of Philosophical Logic 19 (2):115-168.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • A Labelled Deductive System for Relational Semantics of the Lambek Calculus.Miroslawa Kolowska-Gawiejnowicz - 1999 - Mathematical Logic Quarterly 45 (1):51-58.
    We present a labelled version of Lambek Calculus without unit, and we use it to prove a completeness theorem for Lambek Calculus with respect to some relational semantics.
    Download  
     
    Export citation  
     
    Bookmark  
  • Epistemic closure and commutative, nonassociative residuated structures.Sebastian Sequoiah-Grayson - 2013 - Synthese 190 (1):113-128.
    K-axiom-based epistemic closure for explicit knowledge is rejected for even the most trivial cases of deductive inferential reasoning on account of the fact that the closure axiom does not extend beyond a raw consequence relation. The recognition that deductive inference concerns interaction as much as it concerns consequence allows for perspectives from logics of multi-agent information flow to be refocused onto mono-agent deductive reasoning. Instead of modeling the information flow between different agents in a communicative or announcement setting, we model (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Monoidal logics: completeness and classical systems.Clayton Peterson - 2019 - Journal of Applied Non-Classical Logics 29 (2):121-151.
    ABSTRACTMonoidal logics were introduced as a foundational framework to analyze the proof theory of logical systems. Inspired by Lambek's seminal work in categorical logic, the objective is to defin...
    Download  
     
    Export citation  
     
    Bookmark  
  • Discontinuity in categorial grammar.Glyn Morrill - 1995 - Linguistics and Philosophy 18 (2):175 - 219.
    Discontinuity refers to the character of many natural language constructions wherein signs differ markedly in their prosodic and semantic forms. As such it presents interesting demands on monostratal computational formalisms which aspire to descriptive adequacy. Pied piping, in particular, is argued by Pollard (1988) to motivate phrase structure-style feature percolation. In the context of categorial grammar, Bach (1981, 1984), Moortgat (1988, 1990, 1991) and others have sought to provide categorial operators suited to discontinuity. These attempts encounter certain difficulties with respect (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities.Max Kanovich, Stepan Kuznetsov & Andre Scedrov - 2021 - Journal of Logic, Language and Information 30 (1):31-88.
    We give a proof-theoretic and algorithmic complexity analysis for systems introduced by Morrill to serve as the core of the CatLog categorial grammar parser. We consider two recent versions of Morrill’s calculi, and focus on their fragments including multiplicative (Lambek) connectives, additive conjunction and disjunction, brackets and bracket modalities, and the! subexponential modality. For both systems, we resolve issues connected with the cut rule and provide necessary modifications, after which we prove admissibility of cut (cut elimination theorem). We also prove (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A comparison between monoidal and substructural logics.Clayton Peterson - 2016 - Journal of Applied Non-Classical Logics 26 (2):126-159.
    Monoidal logics were introduced as a foundational framework to analyse the proof theory of deontic logic. Building on Lambek’s work in categorical logic, logical systems are defined as deductive systems, that is, as collections of equivalence classes of proofs satisfying specific rules and axiom schemata. This approach enables the classification of deductive systems with respect to their categorical structure. When looking at their proof theory, however, one can see that there are similarities between monoidal and substructural logics. The purpose of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations