This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
About this topic
Summary Any connective defined in any logic which does not correspond to a conjunction, disjunction, conditionals, or negation which is under discussion in the work belongs here.  However, I wish to distinguish between "Logical Connectives, Misc" and "Connectives, Misc" in two ways.  (1) The latter is more appropriate when the connective is not one of the above but nonetheless has a clear linguistic equivalent.  The former is more appropriate in the absence of such an equivalent.  (2) Even in the presence of such an equivalent, if the discussion concerns the purely formal properties of the connective, it fits in both categories.
Key works For logical connectives in group (1) in the summary, there is rarely a key work; for those in group (2) in the summary, there may well be, but this will vary with the connective of which there are far too many to enumerate.
Introductions For logical connectives in group (1) in the summary, there is almost never an introductory work; for those in group (2) in the summary, there may well be, but this will vary with the connective of which there are far too many to enumerate.
Related categories
Siblings:See also:

179 found
Order:
1 — 50 / 179
  1. added 2018-10-28
    Normality Operators and Classical Recapture in Extensions of Kleene Logics.Ciuni Roberto & Massimiliano Carrara - forthcoming - Logic Journal of the IGPL.
    In this paper, we approach the problem of classical recapture for LP and K3 by using normality operators. These generalize the consistency and determinedness operators from Logics of Formal Inconsistency and Underterminedness, by expressing, in any many-valued logic, that a given formula has a classical truth value (0 or 1). In particular, in the rst part of the paper we introduce the logics LPe and Ke3 , which extends LP and K3 with normality operators, and we establish a classical recapture (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  2. added 2018-09-06
    Modal Predicates.Andrea Iacona - 2004 - Australasian Journal of Logic 2:44-69.
    Despite the wide acceptance of standard modal logic, there has always been a temptation to think that ordinary modal discourse may be correctly analyzed and adequately represented in terms of predicates rather than in terms of operators. The aim of the formal model outlined in this paper is to capture what I take to be the only plausible sense in which ‘possible’ and ‘necessary’ can be treated as predicates. The model is built by enriching the language of standard modal logic (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3. added 2018-07-24
    How May the Propositional Calculus Represent?Tristan Haze - forthcoming - South American Journal of Logic 3.
    This paper is a conceptual study in the philosophy of logic. The question considered is 'How may formulae of the propositional calculus be brought into a representational relation to the world?'. Four approaches are distinguished: (1) the denotational approach, (2) the abbreviational approach, (3) the truth-conditional approach, and (4) the modelling approach. (2) and (3) are very familiar, so I do not discuss them. (1), which is now largely obsolete, led to some interesting twists and turns in early analytic philosophy (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  4. added 2018-03-08
    Singular Terms, Predicates and the Spurious ‘Is’ of Identity.Danny Frederick - 2013 - Dialectica 67 (3):325-343.
    Contemporary orthodoxy affirms that singular terms cannot be predicates and that, therefore, ‘is’ is ambiguous as between predication and identity. Recent attempts to treat names as predicates do not challenge this orthodoxy. The orthodoxy was built into the structure of modern formal logic by Frege. It is defended by arguments which I show to be unsound. I provide a semantical account of atomic sentences which draws upon Mill's account of predication, connotation and denotation. I show that singular terms may be (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  5. added 2018-02-17
    Intutionistic Propositional Logic with the Converse Ackerman Poperty.Gemma Robles - 2003 - Teorema: International Journal of Philosophy 22 (1-2):46-54.
  6. added 2018-02-17
    Implementation of Belief Change Operators Using BDDs.Nikos Gorogiannis & Mark D. Ryan - 2002 - Studia Logica 70 (1):131-156.
    While the theory of belief change has attracted a lot of interest from researchers, work on implementing belief change and actually putting it to use in real-world problems is still scarce. In this paper, we present an implementation of propositional belief change using Binary Decision Diagrams. Upper complexity bounds for the algorithm are presented and discussed. The approach is presented both in the general case, as well as on specific belief change operators from the literature. In an effort to gain (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  7. added 2018-02-17
    Epistemic Operators.Fred I. Dretske - 1970 - Journal of Philosophy 67 (24):1007-1023.
  8. added 2017-10-27
    Some Preliminaries on Assertion and Denial.Massimiliano Carrara, Daniele Chiffi & Ciro De Florio - 2017 - Logique Et Analyse 239:203-207.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9. added 2017-04-04
    P. F. Strawson on Predication.Danny Frederick - 2011 - Polish Journal of Philosophy 5 (1):39-57.
    Strawson offers three accounts of singular predication: a grammatical, a category and a mediating account. I argue that the grammatical and mediating accounts are refuted by a host of counter-examples and that the latter is worse than useless. In later works Strawson defends only the category account. This account entails that singular terms cannot be predicates; it excludes non-denoting singular terms from being logical subjects, except by means of an ad hoc analogy; it depends upon a notion of identification that (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  10. added 2017-02-14
    LD BEKLEMISHEV Proof-Theoretic Analysis by Iterated Reflection 515 EJ GRIFFITHS Limit Lemmas and Jump Inversion in the Enumeration Degrees 553.M. Kim, D. Cenzer, Pg Hinman & L. Newelski - 2003 - Archive for Mathematical Logic 42 (6):614.
  11. added 2017-02-13
    Representation of J-Algebras and Segerberg's Logics.S. P. Odintsov - 1999 - Logique Et Analyse 42 (166):81-106.
  12. added 2017-02-13
    On Finite and Infinite Fork Algebras and Their Relational Reducts.Paulo As Veloso - 1996 - Logique Et Analyse 39 (154):35-50.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  13. added 2017-02-01
    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 ...
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  14. added 2017-01-21
    Propositional Logic in the Sixteenth and Early Seventeenth Centuries.E. J. Ashworth - 1968 - Notre Dame Journal of Formal Logic 9 (2):179-192.
  15. added 2017-01-21
    Propositional Connectives, Supposition, and Consequence in Paul of Pergola.Ivan Boh - 1966 - Notre Dame Journal of Formal Logic 7 (1):109-128.
  16. added 2017-01-19
    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.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17. added 2017-01-16
    Concepts as Operators.Joe Adams - 1953 - Psychological Review 60 (4):241-251.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18. added 2017-01-06
    Deontic ‘Cocktail’ According to E. Mally’s Receipt.Lisanyuk Elena - 2013 - Logical Investigations 19:5-27.
    In 1926, Ernst Mally, an Austrian logician, has introduced a system of deontic logic in which he has proposed three fundamental distinctions which proved to be important in the context of the further development of the logic of norms. It is argued that in his philosophical considerations Mally has introduced a number of important distinctions concerning the very concept of norm, but by getting them confused in introducing the subsequent formalisms he failed to formally preserve them. In some of his (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  19. added 2016-12-08
    Schönfinkel-Type Operators for Classical Logic.Katalin Bimbó - 2010 - Studia Logica 95 (3):355-378.
    We briefly overview some of the historical landmarks on the path leading to the reduction of the number of logical connectives in classical logic. Relying on the duality inherent in Boolean algebras, we introduce a new operator ( Nallor ) that is the dual of Schönfinkel’s operator. We outline the proof that this operator by itself is sufficient to define all the connectives and operators of classical first-order logic ( Fol ). Having scrutinized the proof, we pinpoint the theorems of (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20. added 2016-12-08
    Specified Meet Contraction.Sven Ove Hansson - 2008 - Erkenntnis 69 (1):31-54.
    Specified meet contraction is the operation defined by the identity where ∼ is full meet contraction and f is a sentential selector, a function from sentences to sentences. With suitable conditions on the sentential selector, specified meet contraction coincides with the partial meet contractions that yield a finite-based contraction outcome if the original belief set is finite-based. In terms of cognitive realism, specified meet contraction has an advantage over partial meet contraction in that the selection mechanism operates on sentences rather (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  21. added 2016-12-08
    Modality, Quantification, and Many Vlach-Operators.Fabrice Correia - 2007 - Journal of Philosophical Logic 36 (4):473-488.
    Consider two standard quantified modal languages A and P whose vocabularies comprise the identity predicate and the existence predicate, each endowed with a standard S5 Kripke semantics where the models have a distinguished actual world, which differ only in that the quantifiers of A are actualist while those of P are possibilist. Is it possible to enrich these languages in the same manner, in a non-trivial way, so that the two resulting languages are equally expressive-i.e., so that for each sentence (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  22. added 2016-12-08
    Span Operators.B. Brogaard - 2007 - Analysis 67 (1):72-79.
    I. Tensed Plural Quantifiers Presentists typically assent to a range of tensed statements, for instance, that there were dinosaurs, that there was a president named Lincoln, and that my future grandchildren will be on their way to school.1 Past- and future-tensed claims are dealt with by introducing primitive, intensional tense operators, for instance, it has been 12 years ago that, it was the case when I was born that, and it will be the case that (Prior 1968). For example, ‘there (...)
    Remove from this list   Direct download (12 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  23. added 2016-12-08
    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.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  24. added 2016-12-08
    A Proof System for Classical Logic.Witold A. Pogorzelski & Piotr Wojtylak - 2005 - Studia Logica 80 (1):95-104.
    An operation on inferential rules, called H-operation, is used to minimize the axiom basis for classical logic.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  25. added 2016-12-08
    Number of Extensions of Non-Fregean Logics.Joanna Golińska-Pilarek & Taneli Huuskonen - 2004 - Journal of Philosophical Logic 34 (2):193-206.
    We show that there are continuum many different extensions of SCI (the basic theory of non-Fregean propositional logic) that lie below WF (the Fregean extension) and are closed under substitution. Moreover, continuum many of them are independent from WB (the Boolean extension), continuum many lie above WB and are independent from WH (the Boolean extension with only two values for the equality relation), and only countably many lie between WH and WF.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  26. added 2016-12-08
    Consequence Operations Based on Hypergraph Satisfiability.Kolany Adam - 1997 - Studia Logica 58 (2):261-272.
    Four consequence operators based on hypergraph satisfiability are defined. Their properties are explored and interconnections are displayed. Finally their relation to the case of the Classical Propositional Calculus is shown.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  27. added 2016-11-04
    A Carnapian Approach to Counterexamples to Modus Ponens.Constantin C. Brîncuș & Iulian D. Toader - 2013 - Romanian Journal of Analytic Philosophy 7:78-85.
  28. added 2016-10-06
    The Collapse of Logical Pluralism has Been Greatly Exaggerated.Colin R. Caret - 2017 - Erkenntnis 82 (4):739-760.
    According to the logical pluralism of Beall and Restall, there are several distinct relations of logical consequence. Some critics argue that logical pluralism suffers from what I call the collapse problem: that despite its intention to articulate a radically pluralistic doctrine about logic, the view unintentionally collapses into logical monism. In this paper, I propose a contextualist resolution of the collapse problem. This clarifies the mechanism responsible for a plurality of logics and handles the motivating data better than the original (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  29. added 2016-08-09
    Weak Disharmony: Some Lessons for Proof-Theoretic Semantics.Bogdan Dicher - 2016 - Review of Symbolic Logic (3):1-20.
    A logical constant is weakly disharmonious if its elimination rules are weaker than its introduction rules. Substructural weak disharmony is the weak disharmony generated by structural restrictions on the eliminations. I argue that substructural weak disharmony is not a defect of the constants which exhibit it. To the extent that it is problematic, it calls into question the structural properties of the derivability relation. This prompts us to rethink the issue of controlling the structural properties of a logic by means (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  30. added 2016-07-05
    Change of Logic, Change of Meaning.Jared Warren - 2018 - Philosophy and Phenomenological Research 96 (2):421-442.
    Some philosophers have argued that putative logical disagreements aren't really disagreements at all since when you change your logic you thereby change the meanings of your logical constants. According to this picture classical logicians and intuitionists don't really disagree, they just mean different things by terms like “not” and “or”. Quine gave an infamous “translation argument” for this view. Here I clarify the change of logic, change of meaning (CLCM) thesis, examine and find fault with Quine's translation argument for the (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  31. added 2016-07-05
    On Logical Relativity.Achille C. Varzi - 2002 - Philosophical Issues 12 (1):197-219.
    One logic or many? I say—many. Or rather, I say there is one logic for each way of specifying the class of all possible circumstances, or models, i.e., all ways of interpreting a given language. But because there is no unique way of doing this, I say there is no unique logic except in a relative sense. Indeed, given any two competing logical theories T1 and T2 (in the same language) one could always consider their common core, T, and settle (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  32. added 2016-05-03
    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 the (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  33. added 2015-12-04
    Conversely: Extrapropositional and Prosentential.John Corcoran & Sriram Nambiar - 2014 - Bulletin of Symbolic Logic 20 (3):404-5.
    This self-contained lecture examines uses and misuses of the adverb conversely with special attention to logic and logic-related fields. Sometimes adding conversely after a conjunction such as and signals redundantly that a converse of what preceded will follow. -/- (1) Tarski read Church and, conversely, Church read Tarski. -/- In such cases, conversely serves as an extrapropositional constituent of the sentence in which it occurs: deleting conversely doesn’t change the proposition expressed. Nevertheless it does introduce new implicatures: a speaker would (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34. added 2015-08-25
    The Size of a Formula as a Measure of Complexity.Jouko Väänänen & Lauri Hella - 2015 - In Andrés Villaveces, Roman Kossak, Juha Kontinen & Åsa Hirvonen (eds.), Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics. De Gruyter. pp. 193-214.
  35. added 2015-07-29
    Determination, Uniformity, and Relevance: Normative Criteria for Generalization and Reasoning by Analogy.Todd R. Davies - 1988 - In David H. Helman (ed.), Analogical Reasoning. Kluwer Academic Publishers. pp. 227-250.
    This paper defines the form of prior knowledge that is required for sound inferences by analogy and single-instance generalizations, in both logical and probabilistic reasoning. In the logical case, the first order determination rule defined in Davies (1985) is shown to solve both the justification and non-redundancy problems for analogical inference. The statistical analogue of determination that is put forward is termed 'uniformity'. Based on the semantics of determination and uniformity, a third notion of "relevance" is defined, both logically and (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36. added 2015-04-05
    Co-Operation for Existence.L. Richmond Wheeler - 1941 - Hibbert Journal 40:331.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  37. added 2015-03-23
    Truthlike and Truthful Operators.Arnold Koslow - 2000 - In Gila Sher & Richard L. Tieszen (eds.), Between Logic and Intuition: Essays in Honor of Charles Parsons. Cambridge University Press. pp. 27.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  38. added 2015-03-23
    On Imbedding Operators.G. E. Mints & V. P. Orevkov - 1969 - In A. O. Slisenko (ed.), Studies in Constructive Mathematics and Mathematical Logic. New York: Consultants Bureau. pp. 64--66.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  39. added 2015-03-22
    Operators in Nature.M. Burgin & J. E. Brenner - forthcoming - Mind and Society.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  40. added 2015-03-17
    Harmony, Normality and Stability.Nils Kurbis - manuscript
    The paper begins with a conceptual discussion of Michael Dummett's proof-theoretic justification of deduction or proof-theoretic semantics, which is based on what we might call Gentzen's thesis: 'the introductions constitute, so to speak, the "definitions" of the symbols concerned, and the eliminations are in the end only consequences thereof, which could be expressed thus: In the elimination of a symbol, the formula in question, whose outer symbol it concerns, may only "be used as that which it means on the basis (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  41. added 2015-02-25
    Liar Sentences and Soames's Rejection of Bivalence.Teresa Marques - 2003 - In Henrique Jales Ribeiro (ed.), 1º Encontro Nacional de Filosofia Analítica.
    Scott Soames proposes in his book Understanding Truth (1999) a motivation to reject bivalence. It is his claim that if bivalence is assumed to apply to liar sentences, contradictions will follow. However, contradictions will equally follow if bivalence is denied of liar sentences (in fact, of any truth-bearers). Soames avoids contradictions by treating truth as a partially defined predicate: for certain sentences, truth is not defined to apply or not to apply. Liar sentences are some of such cases. However, there (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  42. added 2015-01-29
    Truth and The Ambiguity of Negation.Teresa Marques - 2010 - In Erich Rast & Luiz Carlos Baptista (eds.), Meaning and Context. Peter Lang. pp. 2--235.
    This article has one aim, to reject the claim that negation is semantically ambiguous. The first section presents the putative incompatibility between truth-value gaps and the truth-schema; the second section presents the motivation for the ambiguity thesis; the third section summarizes arguments against the claim that natural language negation is semantically ambiguous; and the fourth section indicates the problems of an introduction of two distinct negation operators in natural language.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  43. added 2015-01-10
    Proof-Theoretic Semantics, Paradoxes and the Distinction Between Sense and Denotation.Luca Tranchini - forthcoming - Journal of Logic and Computation 2014.
    In this paper we show how Dummett-Prawitz-style proof-theoretic semantics has to be modified in order to cope with paradoxical phenomena. It will turn out that one of its basic tenets has to be given up, namely the definition of the correctness of an inference as validity preservation. As a result, the notions of an argument being valid and of an argument being constituted by correct inference rules will no more coincide. The gap between the two notions is accounted for by (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  44. added 2014-11-20
    Variable-Binders as Functors.Achille C. Varzi - 1995 - Poznan Studies in the Philosophy of the Sciences and the Humanities 40:303-19.
    This work gives an extended presentation of the treatment of variable-binding operators adumbrated in [3:1993d]. Illustrative examples include elementary languages with quantifiers and lambda-equipped categorial languages. Some remarks are also offered to illustrate the philosophical import of the resulting picture. Particularly, a certain conception of logic emerges from the account: the view that logics are true theories in the model-theoretic sense, i.e. the result of selecting a certain class of models as the only “admissible” interpretation structures (for a given language).
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45. added 2014-11-14
    Verbal Disputes in Logic: Against Minimalism for Logical Connectives.Ole Hjortland - 2014 - Logique Et Analyse 57 (227):463-486.
    Logic, Logical connectives, Verbal disputes, Proof theory, Non-classical logic.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  46. added 2014-11-06
    Anything Goes.David Ripley - 2015 - Topoi 34 (1):25-36.
    This paper consider Prior's connective Tonk from a particular bilateralist perspective. I show that there is a natural perspective from which we can see Tonk and its ilk as perfectly well-defined pieces of vocabulary; there is no need for restrictions to bar things like Tonk.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  47. added 2014-10-11
    Sulla relatività logica.Achille C. Varzi - 2004 - In Massimiliano Carrara & Pierdaniele Giaretta (eds.), Filosofia e logica. Rubbettino Editore. pp. 135–173.
    Italian translation of "On Logical Relativity" (2002), by Luca Morena.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  48. added 2014-10-09
    The Geometry of Negation.Massimo Warglien & Achille C. Varzi - 2003 - Journal of Applied Non-Classical Logics 13 (1):9-19.
    There are two natural ways of thinking about negation: (i) as a form of complementation and (ii) as an operation of reversal, or inversion (to deny that p is to say that things are “the other way around”). A variety of techniques exist to model conception (i), from Euler and Venn diagrams to Boolean algebras. Conception (ii), by contrast, has not been given comparable attention. In this note we outline a twofold geometric proposal, where the inversion metaphor is understoood as (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  49. added 2014-07-23
    Dynamic Models in Imperative Logic (Imperatives in Action: Changing Minds and Norms).Berislav Žarnić - 2011 - In Anna Brozek, Jacek Jadacki & Berislav Žarnić (eds.), Theory of Imperatives from Different Points of View (2). Wydawnictwo Naukowe Semper.
    The theory of imperatives is philosophically relevant since in building it — some of the long standing problems need to be addressed, and presumably some new ones are waiting to be discovered. The relevance of the theory of imperatives for philosophical research is remarkable, but usually recognized only within the field of practical philosophy. Nevertheless, the emphasis can be put on problems of theoretical philosophy. Proper understanding of imperatives is likely to raise doubts about some of our deeply entrenched and (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  50. added 2014-07-23
    The Display Problem Revisited.Tyke Nunez - 2010 - In Michal Peliš Vit Punčochàr (ed.), Logica Handbook 2010. College Publications. pp. 143-156.
    In this essay I give a complete join semi-lattice of possible display-equivalence schemes for Display Logic, using the standard connectives, and leaving fixed only the schemes governing the star. In addition to proving the completeness of this list, I offer a discussion of the basic properties of these schemes.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 179