Results for 'Connectives'

531 found
Order:
  1.  52
    The Connectives.Lloyd Humberstone - 2011 - MIT Press.
    It will be an essential resource for philosophers, mathematicians, computer scientists, linguists, or any scholar who finds connectives, and the conceptual issues surrounding them, to be a source of interest.This landmark work offers both ...
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   13 citations  
  2. Connectives Without Truth Tables.Nathan Klinedinst & Daniel Rothschild - 2012 - Natural Language Semantics 20 (2):137-175.
    There are certain uses of and and or that cannot be explained by their normal meanings as truth-functional connectives, even with sophisticated pragmatic resources. These include examples such as The cops show up, and a fight will break out (‘If the cops show up, a fight will break out’), and I have no friends, or I would throw a party (‘I have no friends. If I did have friends, I would throw a party.’). We argue that these uses are (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   12 citations  
  3. A Non-Uniform Semantic Analysis of the Italian Temporal Connectives Prima and Dopo.Del Prete Fabio - 2008 - Natural Language Semantics 16 (2):157-203.
    In this paper, I argue that the temporal connective prima (‘before’) is a comparative adverb. The argument is based on a number of grammatical facts from Italian, showing that there is an asymmetry between prima and dopo (‘after’). On the ground of their divergent behaviour, I suggest that dopo has a different grammatical status from prima. I propose a semantic treatment for prima that is based on an independently motivated analysis of comparatives which can be traced back to Seuren (in: (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  4. Approximating the Limit: The Interaction Between Quasi 'Almost' and Some Temporal Connectives in Italian.Amaral Patrícia & Del Prete Fabio - 2010 - Linguistics and Philosophy 33 (2):51 - 115.
    This paper focuses on the interpretation of the Italian approximative adverb quasi 'almost' by primarily looking at cases in which it modifies temporal connectives, a domain which, to our knowledge, has been largely unexplored thus far. Consideration of this domain supports the need for a scalar account of the semantics of quasi (close in spirit to Hitzeman's semantic analysis of almost, in: Canakis et al. (eds) Papers from the 28th regional meeting of the Chicago Linguistic Society, 1992). When paired (...)
    Direct download (9 more)  
     
    Export citation  
     
    My bibliography  
  5.  38
    Connectives Stranger Than Tonk.Heinrich Wansing - 2006 - Journal of Philosophical Logic 35 (6):653 - 660.
    Many logical systems are such that the addition of Prior's binary connective tonk to them leads to triviality, see [1, 8]. Since tonk is given by some introduction and elimination rules in natural deduction or sequent rules in Gentzen's sequent calculus, the unwanted effects of adding tonk show that some kind of restriction has to be imposed on the acceptable operational inferences rules, in particular if these rules are regarded as definitions of the operations concerned. In this paper, a number (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  6.  6
    Craig Interpolation in the Presence of Unreliable Connectives.João Rasga, Cristina Sernadas & Amlcar Sernadas - 2014 - Logica Universalis 8 (3-4):423-446.
    Arrow and turnstile interpolations are investigated in UCL [introduced by Sernadas et al. ], a logic that is a complete extension of classical propositional logic for reasoning about connectives that only behave as expected with a given probability. Arrow interpolation is shown to hold in general and turnstile interpolation is established under some provisos.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  7.  29
    Partially Ordered Connectives.Gabriel Sandu & Jouko Väänänen - 1992 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):361-372.
    We show that a coherent theory of partially ordered connectives can be developed along the same line as partially ordered quantification. We estimate the expressive power of various partially ordered connectives and use methods like Ehrenfeucht games and infinitary logic to get various undefinability results.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  8.  8
    On Univocal Connectives.Rodolfo Ertola - 2009 - Logic and Logical Philosophy 18 (1):5-13.
    We pay attention to the concept of univocal connective. Considering the corresponding definition in the context of the sequent calculus a problem arises in a paper by Belnap. We provide an explanation by Belnap and finally give some examples and non-examples of univocal connectives.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  9.  13
    Pragmatic Connectives, Argumentative Coherence and Relevance.Jacques Moeschler - 1989 - Argumentation 3 (3):321-339.
    This article is concerned with pragmatic connectives and their uses in discursive argumentation. Three approaches to pragmatic connectives will be presented: (1) argumentation theory, which implies a conception of pragmatics integrated within semantics, and a specific type of argumentative rules, called ‘topoi’; (2) discourse structure theory, which associates a function in the structuring of discourse sequences to pragmatic connectives; (3) relevance theory, which constitutes a cognitive pragmatic theory, in which no specific principle is associated to linguistic items. (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  10. A New Theory of Quantifiers and Term Connectives.Ken Akiba - 2009 - Journal of Logic, Language and Information 18 (3):403-431.
    This paper sets forth a new theory of quantifiers and term connectives, called shadow theory , which should help simplify various semantic theories of natural language by greatly reducing the need of Montagovian proper names, type-shifting, and λ-conversion. According to shadow theory, conjunctive, disjunctive, and negative noun phrases such as John and Mary , John or Mary , and not both John and Mary , as well as determiner phrases such as every man , some woman , and the (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  11.  15
    On the Meaning of Connectives (Apropos of a Non-Necessitarianist Challenge).Luis Estrada-González - 2011 - Logica Universalis 5 (1):115-126.
    According to logical non-necessitarianism, every inference may fail in some situation. In his defense of logical monism, Graham Priest has put forward an argument against non-necessitarianism based on the meaning of connectives. According to him, as long as the meanings of connectives are fixed, some inferences have to hold in all situations. Hence, in order to accept the non-necessitarianist thesis one would have to dispose arbitrarily of those meanings. I want to show here that non-necessitarianism can stand, without (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  12.  11
    Simple Characterization of Functionally Complete One‐Element Sets of Propositional Connectives.Petar Maksimović & Predrag Janičić - 2006 - Mathematical Logic Quarterly 52 (5):498-504.
    A set of propositional connectives is said to be functionally complete if all propositional formulae can be expressed using only connectives from that set. In this paper we give sufficient and necessary conditions for a one-element set of propositional connectives to be functionally complete. These conditions provide a simple and elegant characterization of functionally complete one-element sets of propositional connectives.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  13.  22
    Partially Ordered Connectives and Monadic Monotone Strict Np.Lauri Hella, Merlijn Sevenster & Tero Tulenheimo - 2008 - Journal of Logic, Language and Information 17 (3):323-344.
    Motivated by constraint satisfaction problems, Feder and Vardi (SIAM Journal of Computing, 28, 57–104, 1998) set out to search for fragments of satisfying the dichotomy property: every problem definable in is either in P or else NP-complete. Feder and Vardi considered in this connection two logics, strict NP (or SNP) and monadic, monotone, strict NP without inequalities (or MMSNP). The former consists of formulas of the form , where is a quantifier-free formula in a relational vocabulary; and the latter is (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  14.  8
    On Combined Connectives.A. Sernadas, C. Sernadas & J. Rasga - 2011 - Logica Universalis 5 (2):205-224.
    Combined connectives arise in combined logics. In fibrings, such combined connectives are known as shared connectives and inherit the logical properties of each component. A new way of combining connectives (and other language constructors of propositional nature) is proposed by inheriting only the common logical properties of the components. A sound and complete calculus is provided for reasoning about the latter. The calculus is shown to be a conservative extension of the original calculus. Examples are provided (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  15. New Foundations for Imperative Logic I: Logical Connectives, Consistency, and Quantifiers.Peter B. M. Vranas - 2008 - Noûs 42 (4):529-572.
    Imperatives cannot be true or false, so they are shunned by logicians. And yet imperatives can be combined by logical connectives: "kiss me and hug me" is the conjunction of "kiss me" with "hug me". This example may suggest that declarative and imperative logic are isomorphic: just as the conjunction of two declaratives is true exactly if both conjuncts are true, the conjunction of two imperatives is satisfied exactly if both conjuncts are satisfied—what more is there to say? Much (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   11 citations  
  16.  50
    Verbal Disputes in Logic: Against Minimalism for Logical Connectives.Ole Hjortland - 2014 - Logique Et Analyse 57 (227):463-486.
  17.  27
    Speech Acts, Categoricity, and the Meanings of Logical Connectives.Ole Thomassen Hjortland - 2014 - Notre Dame Journal of Formal Logic 55 (4):445-467.
    In bilateral systems for classical logic, assertion and denial occur as primitive signs on formulas. Such systems lend themselves to an inferentialist story about how truth-conditional content of connectives can be determined by inference rules. In particular, for classical logic there is a bilateral proof system which has a property that Carnap in 1943 called categoricity. We show that categorical systems can be given for any finite many-valued logic using $n$-sided sequent calculus. These systems are understood as a further (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  18.  36
    An Algebraic Approach to Intuitionistic Connectives.Xavier Caicedo & Roberto Cignoli - 2001 - Journal of Symbolic Logic 66 (4):1620-1636.
    It is shown that axiomatic extensions of intuitionistic propositional calculus defining univocally new connectives, including those proposed by Gabbay, are strongly complete with respect to valuations in Heyting algebras with additional operations. In all cases, the double negation of such a connective is equivalent to a formula of intuitionistic calculus. Thus, under the excluded third law it collapses to a classical formula, showing that this condition in Gabbay's definition is redundant. Moreover, such connectives can not be interpreted in (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  19.  10
    Singulary Extensional Connectives: A Closer Look. [REVIEW]I. L. Humberstone - 1997 - Journal of Philosophical Logic 26 (3):341-356.
    The totality of extensional 1-ary connectives distinguishable in a logical framework allowing sequents with multiple or empty (alongside singleton) succedents form a lattice under a natural partial ordering relating one connective to another if all the inferential properties of the former are possessed by the latter. Here we give a complete description of that lattice; its Hasse diagram appears as Figure 1 in §2. Simple syntactic descriptions of the lattice elements are provided in §3; §§4 and 5 give some (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  20.  28
    Implicit Connectives of Algebraizable Logics.Xavier Caicedo - 2004 - Studia Logica 78 (1-2):155 - 170.
    An extensions by new axioms and rules of an algebraizable logic in the sense of Blok and Pigozzi is not necessarily algebraizable if it involves new connective symbols, or it may be algebraizable in an essentially different way than the original logic. However, extension whose axioms and rules define implicitly the new connectives are algebraizable, via the same equivalence formulas and defining equations of the original logic, by enriched algebras of its equivalente quasivariety semantics. For certain strongly algebraizable logics, (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  21. “Identifying Phrasal Connectives in Italian Using Quantitative Methods”.Edoardo Zamuner, Fabio Tamburini & Cristiana de Sanctis - 2002 - In Stefania Nuccorini (ed.), Phrases and Phraseology – Data and Descriptions. Peter Lang Verlag.
    In recent decades, the analysis of phraseology has made use of the exploration of large corpora as a source of quantitative information about language. This paper intends to present the main lines of work in progress based on this empirical approach to linguistic analysis. In particular, we focus our attention on some problems relating to the morpho-syntactic annotation of corpora. The CORIS/CODIS corpus of contemporary written Italian, developed at CILTA – University of Bologna (Rossini Favretti 2000; Rossini Favretti, Tamburini, De (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    My bibliography  
  22.  2
    Implicit Connectives of Algebraizable Logics.Xavier Caicedo - 2004 - Studia Logica 78 (1):155-170.
    An extensions by new axioms and rules of an algebraizable logic in the sense of Blok and Pigozzi is not necessarily algebraizable if it involves new connective symbols, or it may be algebraizable in an essentially different way than the original logic. However, extension whose axioms and rules define implicitly the new connectives are algebraizable, via the same equivalence formulas and defining equations of the original logic, by enriched algebras of its equivalente quasivariety semantics. For certain strongly algebraizable logics, (...)
    Direct download  
     
    Export citation  
     
    My bibliography   4 citations  
  23.  46
    Knot and Tonk: Nasty Connectives on Many-Valued Truth-Tables for Classical Sentential Logic.Tim Button - 2016 - Analysis 76 (1):7-19.
    Prior’s Tonk is a famously horrible connective. It is defined by its inference rules. My aim in this article is to compare Tonk with some hitherto unnoticed nasty connectives, which are defined in semantic terms. I first use many-valued truth-tables for classical sentential logic to define a nasty connective, Knot. I then argue that we should refuse to add Knot to our language. And I show that this reverses the standard dialectic surrounding Tonk, and yields a novel solution to (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  24.  41
    Tūsī on Avicenna's Logical Connectives∗.Tony Street - 1995 - History and Philosophy of Logic 16 (2):257-268.
    T?s?, a thirteenth century logician writing in Arabic, uses two logical connectives to build up molecular propositions: ?if-then?, and ?either-or?. By referring to a dichotomous Tree, T?s? shows how to choose the proper disjunction relative to the terms in the disjuncts. He also discusses the disjunctive propositions which follow from a conditional proposition.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  25.  6
    Hierarchies of Partially Ordered Connectives and Quantifiers.Michał Krynicki - 1993 - Mathematical Logic Quarterly 39 (1):287-294.
    Connections between partially ordered connectives and Henkin quantifiers are considered. It is proved that the logic with all partially ordered connectives and the logic with all Henkin quantifiers coincide. This implies that the hierarchy of partially ordered connectives is strongly hierarchical and gives several nondefinability results between some of them. It is also deduced that each Henkin quantifier can be defined by a quantifier of the form equation imagewhat is a strengthening of the Walkoe result. MSC: 03C80.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  26.  28
    Computing Discourse Semantics: The Predicate-Argument Semantics of Discourse Connectives in D-LTAG.K. Forbes-Riley - 2005 - Journal of Semantics 23 (1):55-106.
    D-LTAG is a discourse-level extension of lexicalized tree-adjoining grammar (LTAG), in which discourse syntax is projected by different types of discourse connectives and discourse interpretation is a product of compositional rules, anaphora resolution, and inference. In this paper, we present a D-LTAG extension of ongoing work on an LTAG syntax-semantic interface. First, we show how predicate-argument semantics are computed for standard, ‘structural’ discourse connectives. These are connectives that retrieve their semantic arguments from their D-LTAG syntactic tree. Then (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  27.  31
    Cn-Definitions of Propositional Connectives.Witold A. Pogorzelski & Piotr Wojtylak - 2001 - Studia Logica 67 (1):1-26.
    We attempt to define the classical propositional logic by use of appropriate derivability conditions called Cn-definitions. The conditions characterize basic properties of propositional connectives.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  28.  42
    Expressive Power and Semantic Completeness: Boolean Connectives in Modal Logic.I. L. Humberstone - 1990 - Studia Logica 49 (2):197 - 214.
    We illustrate, with three examples, the interaction between boolean and modal connectives by looking at the role of truth-functional reasoning in the provision of completeness proofs for normal modal logics. The first example (§ 1) is of a logic (more accurately: range of logics) which is incomplete in the sense of being determined by no class of Kripke frames, where the incompleteness is entirely due to the lack of boolean negation amongst the underlying non-modal connectives. The second example (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  29.  27
    Insertion of Connectives by 9- to 11-Year-Old Children in an Argumentative Text.Sylvie Akiguet & Annie Piolat - 1996 - Argumentation 10 (2):253-270.
    The objective of the present study was to show that the use of adversative and conclusive connectives to mark off the prototypical schema of argumentative text begins to set in at approximately the age of 10 or 11. Based on Adam's (1992) proposals, we constituted an argumentative text with two blocks of arguments separated by an adversative instruction (the connective but or an equivalent) and followed by a conclusion introduced by a conclusive instruction (the connective thus or an equivalent). (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  30.  7
    A New Algebraic Semantic Approach and Some Adequate Connectives for Computation with Temporal Logic Over Discrete Time.Alfredo Burrieza & Inma P. De Guzmán - 1992 - Journal of Applied Non-Classical Logics 2 (2):181-200.
    ABSTRACT In this paper we present a new semantic approach for propositional linear temporal logic with discrete time, strongly based in the well-order of IN (the set of natural numbers). We consider temporal connectives which express precedence, posteriority and simultaneity, and they provide a family of expressively complete temporal logics. The selection of the new semantics and connectives used in this work was principally to obtain a suitable executable temporal logic, which can be used for the specification and (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  31.  16
    T-Norms and Φ-Operators as Truth Functions of Many Valued Connectives.Siegfried Gottwald - 1984 - Bulletin of the Section of Logic 13 (2):55-58.
    The choice of connectives for many valued propositional logics suitable for theoretical and applicational interests in most cases is an open problem up to now. We will not offer a general solution here, but support the point of view of some recent developments in fuzzy set theory that the triangular norms – t-norms for short – of Schweizer/Sklar [3] and the ϕ-operators of Pedrycz [2] represent quite general classes of connectives at least for many valued logics with truth (...)
    Direct download  
     
    Export citation  
     
    My bibliography  
  32.  9
    Proof-Functional Connectives and Realizability.Franco Barbanera & Simone Martini - 1994 - Archive for Mathematical Logic 33 (3):189-211.
    The meaning of a formula built out of proof-functional connectives depends in an essential way upon the intensional aspect of the proofs of the component subformulas. We study three such connectives, strong equivalence (where the two directions of the equivalence are established by mutually inverse maps), strong conjunction (where the two components of the conjunction are established by the same proof) and relevant implication (where the implication is established by an identity map). For each of these connectives (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  33.  15
    Logical Connectives on Lattice Effect Algebras.D. J. Foulis & S. Pulmannová - 2012 - Studia Logica 100 (6):1291-1315.
    An effect algebra is a partial algebraic structure, originally formulated as an algebraic base for unsharp quantum measurements. In this article we present an approach to the study of lattice effect algebras (LEAs) that emphasizes their structure as algebraic models for the semantics of (possibly) non-standard symbolic logics. This is accomplished by focusing on the interplay among conjunction, implication, and negation connectives on LEAs, where the conjunction and implication connectives are related by a residuation law. Special cases of (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  34. On Applications of Truth-Value Connectives for Testing Arguments with Natural Connectives.Andrzej Pietruszczak - 2006 - Poznan Studies in the Philosophy of the Sciences and the Humanities 91 (1):143-156.
    In introductory logic courses the authors often limit their considerations to the truth-value operators. Then they write that conditionals and biconditionals of natural language ("if" and "if and only if") may be represented as material implications and equivalences ("⊃" and "≡"), respectively. Yet material implications are not suitable for conditionals. Lewis' strict implications are much better for this purpose. Similarly, strict equivalences are better for representing biconditionals (than material equivalences). In this paper we prove that the methods from standard first (...)
     
    Export citation  
     
    My bibliography  
  35.  7
    Connectives and Frame Theory: The Case of Hypotextual Antinomial "And".Eliza Kitis - 2000 - Pragmatics and Cognition 8 (2):357-410.
    In this study I examine some uses of connectives, and in particular co-ordinate conjunction, from a critical discourse perspective; these uses, in my view, cannot find a satisfactory explanation within current frameworks. It is suggested that we need to identify a conceptual level at which connectives function as hypo-textual signals, activating systematic law-like conditional statements (IF-THEN), which form default specifications of consistent structured knowledge frames. I argue that an account of connectives at the conceptual level of their (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  36.  7
    Intelim Rules for Classical Connectives.David C. Makinson - unknown
    We investigate introduction and elimination rules for truth-functional connectives, focusing on the general questions of the existence, for a given connective, of at least one such rule that it satisfies, and the uniqueness of a connective with respect to the set of all of them. The answers are straightforward in the context of rules using general set/set sequents of formulae, but rather complex and asymmetric in the restricted (but more often used) context of set/formula sequents, as also in the (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  37.  5
    Sentential Connectives and Translation.Sascia Pavan - 2010 - Erkenntnis 73 (2):145 - 163.
    In the first exposition of the doctrine of indeterminacy of translation, Quine asserted that the individuation and translation of truth-functional sentential connectives like 'and', 'or', 'not' are not indeterminate. He changed his mind later on, conjecturing that some sentential connectives might be interpreted in different non-equivalent ways. This issue has not been debated much by Quine, or in the subsequent literature, it is, as it were, an unsolved problem, not well understood. For the sake of the argument, I (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  38.  7
    MaGIC: Matrix Generator for Implication Connectives.Branden Fitelson - manuscript
    The program MaGIC (Matrix Generator for Implication Connectives) is intended as a tool for logical research. It computes small algebras (normally with up to 14 elements) suitable for modelling certain non-classical logics. Along the way, it eliminates from the output any algebra isomorphic to one already generated, thus returning only one from each isomorphism class. Optionally, the user may specify a formula which is to be..
    Direct download  
     
    Export citation  
     
    My bibliography  
  39.  2
    Connectives and Frame Theory: The Case of Hypotextual Antinomial ‘And’.Eliza Kitis - 2000 - Pragmatics and Cognitionpragmatics and Cognition 8 (2):357-409.
    In this study I examine some uses of connectives, and in particular co-ordinate conjunction, from a critical discourse perspective; these uses, in my view, cannot find a satisfactory explanation within current frameworks. It is suggested that we need to identify a conceptual level at which connectives function as hypo-textual signals, activating systematic law-like conditional statements , which form default specifications of consistent structured knowledge frames. I argue that an account of connectives at the conceptual level of their (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  40. An Algebraic Approach to Intuitionistic Connectives.Xavier Caicedo & Roberto Cignoli - 2001 - Journal of Symbolic Logic 66 (4):1620-1636.
    It is shown that axiomatic extensions of intuitionistic propositional calculus defining univocally new connectives, including those proposed by Gabbay, are strongly complete with respect to valuations in Heyting algebras with additional operations. In all cases, the double negation of such a connective is equivalent to a formula of intuitionistic calculus. Thus, under the excluded third law it collapses to a classical formula, showing that this condition in Gabbay's definition is redundant. Moreover, such connectives can not be interpreted in (...)
    Direct download  
     
    Export citation  
     
    My bibliography  
  41.  33
    Commuting Conversions Vs. The Standard Conversions of the “Good” Connectives.Fernando Ferreira & Gilda Ferreira - 2009 - Studia Logica 92 (1):63-84.
    Commuting conversions were introduced in the natural deduction calculus as ad hoc devices for the purpose of guaranteeing the subformula property in normal proofs. In a well known book, Jean-Yves Girard commented harshly on these conversions, saying that ‘one tends to think that natural deduction should be modified to correct such atrocities.’ We present an embedding of the intuitionistic predicate calculus into a second-order predicative system for which there is no need for commuting conversions. Furthermore, we show that the redex (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  42.  57
    Logical Connectives for Constructive Modal Logic.Heinrich Wansing - 2006 - Synthese 150 (3):459-482.
    Model-theoretic proofs of functional completenes along the lines of [McCullough 1971, Journal of Symbolic Logic 36, 15–20] are given for various constructive modal propositional logics with strong negation.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  43.  6
    Implicational Logics II: Additional Connectives and Characterizations of Semilinearity.Petr Cintula & Carles Noguera - 2016 - Archive for Mathematical Logic 55 (3-4):353-372.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  44.  22
    The Lambek Calculus Enriched with Additional Connectives.Makoto Kanazawa - 1992 - Journal of Logic, Language and Information 1 (2):141-171.
    Some formal properties of enriched systems of Lambek calculus with analogues of conjunction and disjunction are investigated. In particular, it is proved that the class of languages recognizable by the Lambek calculus with added intersective conjunction properly includes the class of finite intersections of context-free languages.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  45.  35
    The Independence of Connectives.Timothy Smiley - 1962 - Journal of Symbolic Logic 27 (4):426-436.
  46.  10
    Sentence Connectives in Formal Logic.Lloyd Humberstone - forthcoming - Stanford Encyclopedia of Philosophy.
  47.  19
    An Intriguing Logic with Two Implicational Connectives.Lloyd Humberstone - 2000 - Notre Dame Journal of Formal Logic 41 (1):1-40.
    Matthew Spinks [35] introduces implicative BCSK-algebras, expanding implicative BCK-algebras with an additional binary operation. Subdirectly irreducible implicative BCSK-algebras can be viewed as flat posets with two operations coinciding only in the 1- and 2-element cases, each, in the latter case, giving the two-valued implication truth-function. We introduce the resulting logic (for the general case) in terms of matrix methodology in §1, showing how to reformulate the matrix semantics as a Kripke-style possible worlds semantics, thereby displaying the distinction between the two (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  48.  58
    The Truth Predicate Vs the Truth Connective. On Taking Connectives Seriously.Kevin Mulligan - 2010 - Dialectica 64 (4):565-584.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  49.  24
    Zero-Place Operations and Functional Completeness, and the Definition of New Connectives.I. L. Humberstone - 1993 - History and Philosophy of Logic 14 (1):39-66.
    Tarski 1968 makes a move in the course of providing an account of ?definitionally equivalent? classes of algebras with a businesslike lack of fanfare and commentary, the significance of which may accordingly be lost on the casual reader. In ?1 we present this move as a response to a certain difficulty in the received account of what it is to define a function symbol (or ?operation symbol?). This difficulty, which presents itself as a minor technicality needing to be got around (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  50. Two Puzzles Concerning Measures of Uncertainty and the Positive Boolean Connectives.Gregory Wheeler - 2007 - In Progress in Artificial Intelligence (EPIA 2007). Springer.
     
    Export citation  
     
    My bibliography   2 citations  
1 — 50 / 531