This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories
Subcategories:
206 found
Search inside:
(import / add options)   Sort by:
1 — 100 / 206
Material to categorize
  1. E. M. Barth (1974). The Logic of the Articles in Traditional Philosophy: A Contribution to the Study of Conceptual Structures. D. Reidel Pub. Co..
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  2. R. Batchelor (2011). Topic-Neutrality. Mind 120 (477):1-9.
    The paper suggests a definition of the idea of topic-neutrality, and indicates some of the consequences of identifying logicality with topic-neutrality so defined.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
Logical Constants
  1. István Aranyosi, Derivational Contextualism: A Theory of Individuation.
    One of the oldest topics in foundational metaphysics is the issue how particulars are to be individuated. To individuate a particular, x, means to find criteria that are necessary and sufficient to ensure the assertibility of x ≠ y, for all and only y that are distinct from x. One can distinguish two separate issues that are run under the heading of individuation. One is the question: what is it about a particular that makes it distinct from all other particulars? (...)
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  2. István Aranyosi (2011). The Solo Numero Paradox. American Philosophical Quarterly 48 (4):347-360.
    Leibniz notoriously insisted that no two individuals differ solo numero, that is, by being primitively distinct, without differing in some property. The details of Leibniz’s own way of understanding and defending the principle –known as the principle of identity of indiscernibles (henceforth ‘the Principle’)—is a matter of much debate. However, in contemporary metaphysics an equally notorious and discussed issue relates to a case put forward by Max Black (1952) as a counter-example to any necessary and non-trivial version of the principle. (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. Arvid Båve (2011). How To Precisify Quantifiers. Journal of Philosophical Logic 40 (1):103-111.
    I here argue that Ted Sider's indeterminacy argument against vagueness in quantifiers fails. Sider claims that vagueness entails precisifications, but holds that precisifications of quantifiers cannot be coherently described: they will either deliver the wrong logical form to quantified sentences, or involve a presupposition that contradicts the claim that the quantifier is vague. Assuming (as does Sider) that the “connectedness” of objects can be precisely defined, I present a counter-example to Sider's contention, consisting of a partial, implicit definition of the (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  4. Francesco Berto (2006). Characterizing Negation to Face Dialetheism. Logique et Analyse 49 (195):241-263.
  5. Francesco Berto & Graham Priest (2008). Dialetheism. The Stanford Encyclopedia of Philosophy (2008).
    A dialetheia is a sentence, A, such that both it and its negation, ¬A, are true (we shall talk of sentences throughout this entry; but one could run the definition in terms of propositions, statements, or whatever one takes as her favourite truth-bearer: this would make little difference in the context). Assuming the fairly uncontroversial view that falsity just is the truth of negation, it can equally be claimed that a dialetheia is a sentence which is both true and false.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  6. Corine Besson, Understanding the Logical Constants and Dispositions. The Baltic International Yearbook of Cognition, Logic and Communication (2010).
    Many philosophers claim that understanding a logical constant (e.g. ‘if, then’) fundamentally consists in having dispositions to infer according to the logical rules (e.g. Modus Ponens) that fix its meaning. This paper argues that such dispositionalist accounts give us the wrong picture of what understanding a logical constant consists in. The objection here is that they give an account of understanding a logical constant which is inconsistent with what seem to be adequate manifestations of such understanding. I then outline an (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  7. Corine Besson (2009). Logical Knowledge and Gettier Cases. Philosophical Quarterly 59 (234):1-19.
    Knowledge of the basic rules of logic is often thought to be distinctive, for it seems to be a case of non-inferential a priori knowledge. Many philosophers take its source to be different from those of other types of knowledge, such as knowledge of empirical facts. The most prominent account of knowledge of the basic rules of logic takes this source to be the understanding of logical expressions or concepts. On this account, what explains why such knowledge is distinctive is (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  8. Denis Bonnay (2006). Logicality and Invariance. Bulletin of Symbolic Logic 14 (1):29-68.
    What is a logical constant? The question is addressed in the tradition of Tarski's definition of logical operations as operations which are invariant under permutation. The paper introduces a general setting in which invariance criteria for logical operations can be compared and argues for invariance under potential isomorphism as the most natural characterization of logical operations.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  9. Otávio Bueno & Scott A. Shalkowski (2013). Logical Constants: A Modalist Approach 1. Noûs 47 (1):1-24.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  10. Michael Byrd (1989). Russell, Logicism, and the Choice of Logical Constants. Notre Dame Journal of Formal Logic 30 (3):343-361.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  11. Paolo Casalegno† (2004). Logical Concepts and Logical Inferences. Dialectica 58 (3):395–411.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  12. J. A. Chadwick (1927). Logical Constants. Mind 36 (141):1-11.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  13. Sean Coyle (1999). The Meanings of the Logical Constants in Deontic Logic. Ratio Juris 12 (1):39-58.
  14. Charles B. Daniels (1987). A First-Order Logic with No Logical Constants. Notre Dame Journal of Formal Logic 28 (3):408-413.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  15. Gustavo Fernández Díez (2000). Five Observations Concerning the Intended Meaning of the Intuitionistic Logical Constants. Journal of Philosophical Logic 29 (4):409-424.
    This paper contains five observations concerning the intended meaning of the intuitionistic logical constants: (1) if the explanations of this meaning are to be based on a non-decidable concept, that concept should not be that of `proof"; (2) Kreisel"s explanations using extra clauses can be significantly simplified; (3) the impredicativity of the definition of can be easily and safely ameliorated; (4) the definition of in terms of `proofs from premises" results in a loss of the inductive character of the definitions (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  16. Kosta Došen (1989). Logical Constants as Punctuation Marks. Notre Dame Journal of Formal Logic 30 (3):362-381.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  17. Catarina Dutilh Novaes (2012). Reassessing Logical Hylomorphism and the Demarcation of Logical Constants. Synthese 185 (3):387-410.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  18. Catarina Dutilh Novaes (2012). Reassessing Logical Hylomorphism and the Demarcation of Logical Constants. Synthese 185 (3):387-410.
    The paper investigates the propriety of applying the form versus matter distinction to arguments and to logic in general. Its main point is that many of the currently pervasive views on form and matter with respect to logic rest on several substantive and even contentious assumptions which are nevertheless uncritically accepted. Indeed, many of the issues raised by the application of this distinction to arguments seem to be related to a questionable combination of different presuppositions and expectations; this holds in (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  19. Dorothy Edgington (2006). The Pragmatics of the Logical Constants. In Ernest Lepore & Barry Smith (eds.), The Oxford Handbook of Philosophy of Language. Oxford University Press.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  20. Jim Edwards (2002). Theories of Meaning and Logical Constants: Davidson Versus Evans. Mind 111 (442):249-280.
    Donald Dvaidson has claimed that a theory of meaning identifies the logical constants of the object language by treating them in the phrasal axioms of the theory, and that the theory entails a relation of logical consequence among the sentences of the object language. Section 1 offers a preliminary investigation of these claims. In Section 2 the claims are rebutted by appealing to Evans's paradigm of a theory of meaning. Evans's theory is deliberately blind to any relation of logical consequence (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  21. Simon J. Evnine (1999). Believing Conjunctions. Synthese 118 (2):201-227.
    I shall argue in this paper that it should. To begin with, I shall defend (CP) against several criticisms that have been launched against it. These criticisms are of two kinds, which I shall call internal and external respectively. Internal objections are that a theory that includes (CP) fails to give an account of what it is rational to believe that is satisfactory by its own standards. In particular, since almost everyone agrees that belief in a contradiction is not rational, (...)
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  22. Mario Gomez-Torrente (2002). The Problem of Logical Constants. Bulletin of Symbolic Logic 8 (1):1-37.
    There have been several different and even opposed conceptions of the problem of logical constants, i.e. of the requirements that a good theory of logical constants ought to satisfy. This paper is in the first place a survey of these conceptions and a critique of the theories they have given rise to. A second aim of the paper is to sketch some ideas about what a good theory would look like. A third aim is to draw from these ideas and (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  23. Ole T. Hjortland (2009). The Structure of Logical Consequence : Proof-Theoretic Conceptions. Dissertation, University of St Andrews
    The model-theoretic analysis of the concept of logical consequence has come under heavy criticism in the last couple of decades. The present work looks at an alternative approach to logical consequence where the notion of inference takes center stage. Formally, the model-theoretic framework is exchanged for a proof-theoretic framework. It is argued that contrary to the traditional view, proof-theoretic semantics is not revisionary, and should rather be seen as a formal semantics that can supplement model-theory. Specifically, there are formal resources (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  24. Philip Hugly & Charles Sayward (1998). Kripke on Necessity and Identity. Philosophical Papers 27 (3):151-159.
    It may be that all that matters for the modalities, possibility and necessity, is the object named by the proper name, not which proper name names it. An influential defender of this view is Saul Kripke. Kripke’s defense is criticized in the paper.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  25. L. Incurvati & P. Smith (2012). Is 'No' a Force-Indicator? Sometimes, Possibly. Analysis 72 (2):225-231.
    Some bilateralists have suggested that some of our negative answers to yes-or-no questions are cases of rejection. Mark Textor (2011. Is ‘no’ a force-indicator? No! Analysis 71: 448–56) has recently argued that this suggestion falls prey to a version of the Frege-Geach problem. This note reviews Textor's objection and shows why it fails. We conclude with some brief remarks concerning where we think that future attacks on bilateralism should be directed.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  26. Luca Incurvati & Peter Smith (2010). Rejection and Valuations. Analysis 70 (1):3-10.
    Timothy Smiley's wonderful paper 'Rejection' (Analysis 1996) is still perhaps not as well known or well understood as it should be. This note first gives a quick presentation of themes from that paper, though done in our own way, and then considers a putative line of objection - recently advanced by Julien Murzi and Ole Hjortland (Analysis 2009) - to one of Smiley's key claims. Along the way, we consider the prospects for an intuitionistic approach to some of the issues (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  27. Nils Kürbis, Negation: A Problem for the Proof-Theoretic Justification of Deduction.
    I present an argument that negation is a problem for proof-theoretic semantics: it's meaning cannot be defined by rules of inference, and that's particularly problematic for Dummett's and Prawitz' Justification of Deduction. I won the Jacobsen Essay Price of the University of London for this essay a few years ago.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  28. Nils Kürbis, What is Wrong with Classical Negation?
    The focus of this paper are the meaning-theoretical arguments against classical logic that Dummett bases on consideration about the meanings of negation. Using Dummettian principles, I shall outline three such arguments, of increasing strength, and show that they are unsuccessful by giving responses to each argument on behalf of the classical logician. What is crucial is that in responding to these arguments a classicist need not challenge any of the basic assumptions of Dummett's outlook on the theory of meaning. In (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  29. Nils Kürbis (2008). Stable Harmony. In Peliš Michal (ed.), Logica Yearbook 2007.
    In this paper, I'll present a general way of "reading off" introduction/elimination rules from elimination/introduction rules, and define notions of harmony and stability on the basis of it.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  30. William G. Lycan (1989). Logical Constants and the Glory of Truth-Conditional Semantics. Notre Dame Journal of Formal Logic 30 (3):390-400.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  31. John MacFarlane (2008). Brandom's Demarcation of Logic. Philosophical Topics 36 (2):55-62.
    This is a lightly edited version of my comments on Brandom’s Lecture 2, as delivered in Prague at the “Prague Locke Lectures” in April, 2007. I try to say why Brandom’s proposed demarcation is significant, by placing it in a broader context of demarcation proposals from Kant to the twentieth century. I then raise some questions about the basic ingredients of Brandom’s demarcation—the notions of PP-sufficiency and VP-sufficiency—and question whether the vocabulary of conditionals, Brandom’s paradigm for logical vocabulary, can be (...)
    No categories
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  32. John MacFarlane, Logical Constants. Stanford Encyclopedia of Philosophy.
    Logic is usually thought to concern itself only with features that sentences and arguments possess in virtue of their logical structures or forms. The logical form of a sentence or argument is determined by its syntactic or semantic structure and by the placement of certain expressions called “logical constants.”[1] Thus, for example, the sentences Every boy loves some girl. and Some boy loves every girl. are thought to differ in logical form, even though they share a common syntactic and semantic (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  33. Timothy McCarthy (1987). Modality, Invariance, and Logical Truth. Journal of Philosophical Logic 16 (4):423 - 443.
  34. Timothy McCarthy (1981). The Idea of a Logical Constant. Journal of Philosophy 78 (9):499-523.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  35. Peter Milne (1994). Classical Harmony: Rules of Inference and the Meaning of the Logical Constants. Synthese 100 (1):49 - 94.
    The thesis that, in a system of natural deduction, the meaning of a logical constant is given by some or all of its introduction and elimination rules has been developed recently in the work of Dummett, Prawitz, Tennant, and others, by the addition of harmony constraints. Introduction and elimination rules for a logical constant must be in harmony. By deploying harmony constraints, these authors have arrived at logics no stronger than intuitionist propositional logic. Classical logic, they maintain, cannot be justified (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  36. Charles G. Morgan (1973). Sentential Calculus for Logical Falsehoods. Notre Dame Journal of Formal Logic 14 (3):347-353.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  37. Julien Murzi & Ole Thomassen Hjortland (2009). Inferentialism and the Categoricity Problem: Reply to Raatikainen. Analysis 69 (3):480-488.
    It is sometimes held that rules of inference determine the meaning of the logical constants: the meaning of, say, conjunction is fully determined by either its introduction or its elimination rules, or both; similarly for the other connectives. In a recent paper, Panu Raatikainen (2008) argues that this view - call it logical inferentialism - is undermined by some "very little known" considerations by Carnap (1943) to the effect that "in a definite sense, it is not true that the standard (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  38. Francesco Paoli (2007). Implicational Paradoxes and the Meaning of Logical Constants. Australasian Journal of Philosophy 85 (4):553 – 579.
    I discuss paradoxes of implication in the setting of a proof-conditional theory of meaning for logical constants. I argue that a proper logic of implication should be not only relevant, but also constructive and nonmonotonic. This leads me to select as a plausible candidate LL, a fragment of linear logic that differs from R in that it rejects both contraction and distribution.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  39. Gilbert Plumer (2001). Phenomenological Argumentative Structure. Argumentation 15 (2):173-189.
    The nontechnical ability to identify or match argumentative structure seems to be an important reasoning skill. Instruments that have questions designed to measure this skill include major standardized tests for graduate school admission, for example, the United States-Canadian Law School Admission Test (LSAT), the Graduate Record Examinations (GRE), and the Graduate Management Admission Test (GMAT). Writers and reviewers of such tests need an appropriate foundation for developing such questions--they need a proper representation of phenomenological argumentative structure--for legitimacy, and because these (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  40. Panu Raatikainen (2008). On Rules of Inference and the Meanings of Logical Constants. Analysis 68 (300):282-287.
    In the theory of meaning, it is common to contrast truth-conditional theories of meaning with theories which identify the meaning of an expression with its use. One rather exact version of the somewhat vague use-theoretic picture is the view that the standard rules of inference determine the meanings of logical constants. Often this idea also functions as a paradigm for more general use-theoretic approaches to meaning. In particular, the idea plays a key role in the anti-realist program of Dummett and (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  41. Stephen Read (2010). General-Elimination Harmony and the Meaning of the Logical Constants. Journal of Philosophical Logic 39:557-76.
    Inferentialism claims that expressions are meaningful by virtue of rules governing their use. In particular, logical expressions are autonomous if given meaning by their introduction-rules, rules specifying the grounds for assertion of propositions containing them. If the elimination-rules do no more, and no less, than is justified by the introduction-rules, the rules satisfy what Prawitz, following Lorenzen, called an inversion principle. This connection between rules leads to a general form of elimination-rule, and when the rules have this form, they may (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  42. Alan Rose (1953). Conditioned Disjunction as a Primitive Connective for the Erweiterter Aussagenkalkül. Journal of Symbolic Logic 18 (1):63-65.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  43. Gila Sher (2003). A Characterization of Logical Constants is Possible. Theoria 18 (2):189-198.
    The paper argues that a philosophically informative and mathematically precise characterization is possible by (i) describing a particular proposal for such a characterization, (ii) showing that certain criticisms of this proposal are incorrect, and (iii) discussing the general issue of what a characterization of logical constants aims at achieving.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  44. F. Steinberger (2011). Harmony in a Sequent Setting: A Reply to Tennant. Analysis 71 (2):273-280.
  45. Florian Steinberger (2011). Why Conclusions Should Remain Single. Journal of Philosophical Logic 40 (3):333-355.
    This paper argues that logical inferentialists should reject multiple-conclusion logics. Logical inferentialism is the position that the meanings of the logical constants are determined by the rules of inference they obey. As such, logical inferentialism requires a proof-theoretic framework within which to operate. However, in order to fulfil its semantic duties, a deductive system has to be suitably connected to our inferential practices. I argue that, contrary to an established tradition, multiple-conclusion systems are ill-suited for this purpose because they fail (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  46. Florian Steinberger (2011). What Harmony Could and Could Not Be. Australasian Journal of Philosophy 89 (4):617 - 639.
    The notion of harmony has played a pivotal role in a number of debates in the philosophy of logic. Yet there is little agreement as to how the requirement of harmony should be spelled out in detail or even what purpose it is to serve. Most, if not all, conceptions of harmony can already be found in Michael Dummett's seminal discussion of the matter in The Logical Basis of Metaphysics. Hence, if we wish to gain a better understanding of the (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  47. Florian Steinberger (2009). Not so Stable. Analysis 69 (4):655-661.
  48. Göran Sundholm (1983). Constructions, Proofs and the Meaning of Logical Constants. Journal of Philosophical Logic 12 (2):151 - 172.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  49. Alfred Tarski (1986). What Are Logical Notions? History and Philosophy of Logic 7 (2):143-154.
    In this manuscript, published here for the first time, Tarski explores the concept of logical notion. He draws on Klein's Erlanger Programm to locate the logical notions of ordinary geometry as those invariant under all transformations of space. Generalizing, he explicates the concept of logical notion of an arbitrary discipline.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  50. Majda Trobok, Nenad Miščević & Berislav Žarnić (eds.) (2012). Between Logic and Reality: Modeling Inference, Action and Understanding. Springer.
    This volume provides analyses of the logic-reality relationship from different approaches and perspectives. The point of convergence lies in the exploration of the connections between reality – social, natural or ideal – and logical structures employed in describing or discovering it. Moreover, the book connects logical theory with more concrete issues of rationality, normativity and understanding, thus pointing to a wide range of potential applications. -/- -/- The papers collected in this volume address cutting-edge topics in contemporary discussions amongst specialists. (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  51. Andrew Ushenko (1942). Dr. Quine's Theory of Truth-Functions. Journal of Philosophy 39 (3):64-67.
    This comment piece examines the distinction between negation of a statement and denial of its truth (assertion of its falsity), in the context of an early examination of Quine's related views. Where P is "Jones is ill," the author maintains, in contrast to Quine, that the negation of P is "Jones is ill" is false.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  52. Johan van Benthem (1989). Logical Constants Across Varying Types. Notre Dame Journal of Formal Logic 30 (3):315-342.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  53. Frank Veltman, Proof Systems for Dynamic Predicate Logic.
    The core language can be extended by defining additional logical constants. E.g., we can add ‘→’ (implication), ‘∨’ (disjunction), and ‘∀x’ (universal quantifiers). The choice of logical primitives is not as optional in DPL as it is in standard predicate logic.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  54. Heinrich Wansing (2012). A Non-Inferentialist, Anti-Realistic Conception of Logical Truth and Falsity. Topoi 31 (1):93-100.
    Anti-realistic conceptions of truth and falsity are usually epistemic or inferentialist. Truth is regarded as knowability, or provability, or warranted assertability, and the falsity of a statement or formula is identified with the truth of its negation. In this paper, a non-inferentialist but nevertheless anti-realistic conception of logical truth and falsity is developed. According to this conception, a formula (or a declarative sentence) A is logically true if and only if no matter what is told about what is told about (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  55. K. Warmbrod (1999). Logical Constants. Mind 108 (431):503-538.
    There is as yet no settled consensus as to what makes a term a logical constant or even as to which terms should be recognized as having this status. This essay sets out and defends a rationale for identifying logical constants. I argue for a two-tiered approach to logical theory. First, a secure, core logical theory recognizes only a minimal set of constants needed for deductively systematizing scientific theories. Second, there are extended logical theories whose objectives are to systematize various (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  56. Ken Warmbrōd (1999). Logical Constants. Mind 108 (431):503 - 538.
    There is as yet no settled consensus as to what makes a term a logical constant or even as to which terms should be recognized as having this status. This essay sets out and defends a rationale for identifying logical constants. I argue for a two-tiered approach to logical theory. First, a secure, core logical theory recognizes only a minimal set of constants needed for deductively systematizing scientific theories. Second, there are extended logical theories whose objectives are to systematize various (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  57. Roger Wertheimer (1998). Identity: Logic, Ontology, Epistemology. Philosophy 73 (2):179-193.
    Greece is Hellas and Greeks are Hellenes. Azure is cobalt and everything (coloured) azure is (coloured) cobalt. Pre-Fregeans would call all these statements of identity. <span class='Hi'>Frege</span> taught us to distinguish between Conaming [Name] [Name]. Ngh: Greece is Hellas g=h. Nac: Azure is cobalt a=c Copredicating [Predicate] [Predicate]. PGH: Greeks are Hellenes (x)(Gx[identical with]Hx). PAC: Everything azure is cobalt (x)(Ax[identical with]Cx) Singular Predication [Name] [Predicate]. PcA: Como is azure Ac. PaC: Azure is a colour Ca. PaL: Azure is like indigo (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  58. Dag Westerståhl (1985). Logical Constants in Quantifier Languages. Linguistics and Philosophy 8 (4):387 - 413.
  59. Olgierd Adrian Wojtasiewicz (1978). The Predicate Calculus with Extra-Logical Constants as an Instrument of Semantic Description. Studia Logica 37 (1):103 - 114.
  60. Alexander Yashin (1999). New Intuitionistic Logical Constants and Novikov Completeness. Studia Logica 63 (2):151-180.
    Extending the language of the intuitionistic propositional logic Int with additional logical constants, we construct a wide family of extensions of Int with the following properties: (a) every member of this family is a maximal conservative extension of Int; (b) additional constants are independent in each of them.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  61. Berislav Žarnić (2012). Is Unsaying Polite? In Majda Trobok Nenad Miščević & Berislav Žarnić (eds.), Between Logic and Reality. Springer.
    This paper is divided in five sections. Section 11.1 sketches the history of the distinction between speech act with negative content and negated speech act, and gives a general dynamic interpretation for negated speech act. “Downdate semantics” for AGM contraction is introduced in Section 11.2. Relying on semantically interpreted contraction, Section 11.3 develops the dynamic semantics for constative and directive speech acts, and their external negations. The expressive completeness for the formal variants of natural language utterances, none of which is (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  62. A. A. Zinov'ev (1963). Two-Valued and Many-Valued Logic. Russian Studies in Philosophy 2 (1):69-84.
Logical Connectives
  1. Joanna Golińska-Pilarek & Taneli Huuskonen (2012). Logic. Of Descriptions. A New Approach to the Foundations of Mathematics and Science. Studies in Logic, Grammar and Rhetoric 27:63-94.
    We study a new formal logic LD introduced by Prof. Grzegorczyk. The logic is based on so-called descriptive equivalence, corresponding to the idea of shared meaning rather than shared truth value. We construct a semantics for LD based on a new type of algebras and prove its soundness and complete- ness. We further show several examples of classical laws that hold for LD as well as laws that fail. Finally, we list a number of open problems.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
Logical Connectives, Misc
  1. Ken Akiba (2009). A New Theory of Quantifiers and Term Connectives. 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 boys (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  2. Carlos E. Alchourrón & David Makinson (1986). Maps Between Some Different Kinds of Contraction Function: The Finite Case. Studia Logica 45 (2):187 - 198.
    In some recent papers, the authors and Peter Gärdenfors have defined and studied two different kinds of formal operation, conceived as possible representations of the intuitive process of contracting a theory to eliminate a proposition. These are partial meet contraction (including as limiting cases full meet contraction and maxichoice contraction) and safe contraction. It is known, via the representation theorem for the former, that every safe contraction operation over a theory is a partial meet contraction over that theory. The purpose (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  3. Rafael-Andrés Alemañ-Berenguer (2011). Epistemologic Controversy on Quantum Operators. Principia 14 (2):241-253.
    Since the very begining of quantum theory there started a debate on the proper role of space and time in it. Some authors assumed that space and time have their own algebraic operators. On that basis they supposed that quantum particles had “coordinates of position”, even though those coordinates were not possible to determine with infinite precision. Furthermore, time in quantum physics was taken to be on an equal foot, by means of a so-called “Heisenberg’s fourth relation of indeterminacy” concerning (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  4. Sergei Artëmov & Franco Montagna (1994). On First-Order Theories with Provability Operator. Journal of Symbolic Logic 59 (4):1139-1153.
    In this paper the modal operator "x is provable in Peano Arithmetic" is incorporated into first-order theories. A provability extension of a theory is defined. Presburger Arithmetic of addition, Skolem Arithmetic of multiplication, and some first order theories of partial consistency statements are shown to remain decidable after natural provability extensions. It is also shown that natural provability extensions of a decidable theory may be undecidable.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  5. Axel Arturo Barceló Aspeitia (2008). Patrones Inferenciales (Inferential Patterns). Crítica 40 (120):3 - 35.
    El objetivo de este artículo es proponer un método de traducción de tablas de verdad a reglas de inferencia, para la lógica proposicional, que sea tan directo como el tradicional método inverso (de reglas a tablas). Este método, además, permitirá resolver de manera elegante el viejo problema, formulado originalmente por Prior en 1960, de determinar qué reglas de inferencia definen un conectivo. /// This article aims at setting forth a method to translate truth tables into inference rules, in propositional logic, (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  6. A. Avron (1998). Multiplicative Conjunction and an Algebraic Meaning of Contraction and Weakening. Journal of Symbolic Logic 63 (3):831-859.
    We show that the elimination rule for the multiplicative (or intensional) conjunction $\wedge$ is admissible in many important multiplicative substructural logics. These include LL m (the multiplicative fragment of Linear Logic) and RMI m (the system obtained from LL m by adding the contraction axiom and its converse, the mingle axiom.) An exception is R m (the intensional fragment of the relevance logic R, which is LL m together with the contraction axiom). Let SLL m and SR m be, respectively, (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  7. Arnon Avron (1986). On an Implication Connective of ${\Rm RM}$. Notre Dame Journal of Formal Logic 27 (2):201-209.
  8. Colin G. Bailey (2013). Some Jump-Like Operations in $\Mathbf \Beta $-Recursion Theory. Journal of Symbolic Logic 78 (1):57-71.
  9. Howard Becker (1988). A Characterization of Jump Operators. Journal of Symbolic Logic 53 (3):708-728.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. J. L. Bell (1993). Hilbert's Ɛ-Operator and Classical Logic. Journal of Philosophical Logic 22 (1):1 - 18.
  11. Ermanno Bencivenga & Peter W. Woodruff (1981). A New Modal Language with the Λ Operator. Studia Logica 40 (4):383 - 389.
    A system of modal logic with the operator is proposed, and proved complete. In contrast with a previous one by Stalnaker and Thomason, this system does not require two categories of singular terms.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  12. Alexander Berenstein (2004). Dividing in the Algebra of Compact Operators. Journal of Symbolic Logic 69 (3):817-829.
    We interpret the algebra of finite rank operators as imaginaries inside a Hilbert space. We prove that the Hilbert space enlarged with these imaginaries has built-in canonical bases.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  13. Katalin Bimbó (2010). Schönfinkel-Type Operators for Classical Logic. 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  
     
    My bibliography  
     
    Export citation  
  14. Patrick Blackburn & Maarten Marx (2002). Remarks on Gregory's “Actually” Operator. Journal of Philosophical Logic 31 (3):281-288.
    In this note we show that the classical modal technology of Sahlqvist formulas gives quick proofs of the completeness theorems in [8] (D. Gregory, Completeness and decidability results for some propositional modal logics containing actually operators, Journal of Philosophical Logic 30(1): 57–78, 2001) and vastly generalizes them. Moreover, as a corollary, interpolation theorems for the logics considered in [8] are obtained. We then compare Gregory's modal language enriched with an actually operator with the work of Arthur Prior now known under (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  15. Robert B. Brandom (1979). A Binary Sheffer Operator Which Does the Work of Quantifiers and Sentential Connectives. Notre Dame Journal of Formal Logic 20 (2):262-264.
  16. Douglas S. Bridges (1995). Constructive Mathematics and Unbounded Operators — a Reply to Hellman. Journal of Philosophical Logic 24 (5):549 - 561.
    It is argued that Hellman's arguments purporting to demonstrate that constructive mathematics cannot cope with unbounded operators on a Hilbert space are seriously flawed, and that there is no evidence that his thesis is correct.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  17. Berit Brogaard (2007). Span Operators. 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 (7 more)  
     
    My bibliography  
     
    Export citation  
  18. Eric M. Brown, Logic II: The Theory of Propositions.
    This is part two of a complete exposition of Logic, in which there is a radically new synthesis of Aristotelian-Scholastic Logic with modern Logic. Part II is the presentation of the theory of propositions. Simple, composite, atomic, compound, modal, and tensed propositions are all examined. Valid consequences and propositional logical identities are rigorously proven. Modal logic is rigorously defined and proven. This is the first work of Logic known to unite Aristotelian logic and modern logic using scholastic logic as the (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  19. M. W. Bunder (1979). Variable Binding Term Operators in $\Lambda $-Calculus. Notre Dame Journal of Formal Logic 20 (4):876-878.
  20. Xavier Caicedo & Roberto Cignoli (2001). An Algebraic Approach to Intuitionistic Connectives. 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 all Heyting (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  21. Carlos Caleiro, Luca Viganò & Marco Volpe (2013). On the Mosaic Method for Many-Dimensional Modal Logics: A Case Study Combining Tense and Modal Operators. Logica Universalis 7 (1):33-69.
    We present an extension of the mosaic method aimed at capturing many-dimensional modal logics. As a proof-of-concept, we define the method for logics arising from the combination of linear tense operators with an “orthogonal” S5-like modality. We show that the existence of a model for a given set of formulas is equivalent to the existence of a suitable set of partial models, called mosaics, and apply the technique not only in obtaining a proof of decidability and a proof of completeness (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  22. Enrique Casanovas (2007). Logical Operations and Invariance. Journal of Philosophical Logic 36 (1):33 - 60.
    I present a notion of invariance under arbitrary surjective mappings for operators on a relational finite type hierarchy generalizing the so-called Tarski–Sher criterion for logicality and I characterize the invariant operators as definable in a fragment of the first-order language. These results are compared with those obtained by Feferman and it is argued that further clarification of the notion of invariance is needed if one wants to use it to characterize logicality.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  23. Sergio A. Celani & Hernán J. San Martín (2012). Frontal Operators in Weak Heyting Algebras. Studia Logica 100 (1-2):91-114.
    In this paper we shall introduce the variety FWHA of frontal weak Heyting algebras as a generalization of the frontal Heyting algebras introduced by Leo Esakia in [ 10 ]. A frontal operator in a weak Heyting algebra A is an expansive operator τ preserving finite meets which also satisfies the equation $${\tau(a) \leq b \vee (b \rightarrow a)}$$, for all $${a, b \in A}$$. These operators were studied from an algebraic, logical and topological point of view by Leo Esakia (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  24. William J. Collins & Paul Young (1983). Discontinuities of Provably Correct Operators on the Provably Recursive Real Numbers. Journal of Symbolic Logic 48 (4):913-920.
    In this paper we continue, from [2], the development of provably recursive analysis, that is, the study of real numbers defined by programs which can be proven to be correct in some fixed axiom system S. In particular we develop the provable analogue of an effective operator on the set C of recursive real numbers, namely, a provably correct operator on the set P of provably recursive real numbers. In Theorems 1 and 2 we exhibit a provably correct operator on (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  25. Roger M. Cooke & Michiel Lambalgen (1983). The Representation of Takeuti's *20c ||_ -Operator. Studia Logica 42 (4):407 - 415.
    Gaisi Takeuti has recently proposed a new operation on orthomodular lattices L, ⫫: $\scr{P}(L)\rightarrow L$ . The properties of ⫫ suggest that the value of ⫫ $(A)(A\subseteq L)$ corresponds to the degree in which the elements of A behave classically. To make this idea precise, we investigate the connection between structural properties of orthomodular lattices L and the existence of two-valued homomorphisms on L.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  26. S. B. Cooper (1973). Minimal Degrees and the Jump Operator. Journal of Symbolic Logic 38 (2):249-271.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  27. Fabrice Correia (2007). Modality, Quantification, and Many Vlach-Operators. Journal of Philosophical Logic 36 (4):473 - 488.
    Consider two standard quantified modal languages and 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 are actualist while those of 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 of one language there (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  28. Janusz Czelakowski (2003). The Suszko Operator. Part I. Studia Logica 74 (1-2):181 - 231.
    The paper is conceived as a first study on the Suszko operator. The purpose of this paper is to indicate the existence of close relations holding between the properties of the Suszko operator and the structural properties of the model class for various sentential logics. The emphasis is put on generality both of the results and methods of tackling the problems that arise in the theory of this operator. The attempt is made here to develop the theory for non-protoalgebraic logics.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  29. René David & Karim Nour (1995). Storage Operators and Directed Lambda-Calculus. Journal of Symbolic Logic 60 (4):1054-1086.
    Storage operators have been introduced by J. L. Krivine in [5] they are closed λ-terms which, for a data type, allow one to simulate a "call by value" while using the "call by name" strategy. In this paper, we introduce the directed λ-calculus and show that it has the usual properties of the ordinary λ-calculus. With this calculus we get an equivalent--and simple--definition of the storage operators that allows to show some of their properties: $\bullet$ the stability of the set (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  30. Maarten de Rijke & Yde Venema (1995). Sahlqvist's Theorem for Boolean Algebras with Operators with an Application to Cylindric Algebras. Studia Logica 54 (1).
    For an arbitrary similarity type of Boolean Algebras with Operators we define a class ofSahlqvist identities. Sahlqvist identities have two important properties. First, a Sahlqvist identity is valid in a complex algebra if and only if the underlying relational atom structure satisfies a first-order condition which can be effectively read off from the syntactic form of the identity. Second, and as a consequence of the first property, Sahlqvist identities arecanonical, that is, their validity is preserved under taking canonical embedding algebras. (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  31. Stéphane Demri (1999). A Logic with Relative Knowledge Operators. Journal of Logic, Language and Information 8 (2):167-185.
    We study a knowledge logic that assumes that to each set of agents, an indiscernibility relation is associated and the agents decide the membership of objects or states up to this indiscernibility relation. Its language contains a family of relative knowledge operators. We prove the decidability of the satisfiability problem, we show its EXPTIME-completeness and as a side-effect, we define a complete Hilbert-style axiomatization.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  32. Stéphane Demri (1997). A Completeness Proof for a Logic with an Alternative Necessity Operator. Studia Logica 58 (1):99-112.
    We show the completeness of a Hilbert-style system LK defined by M. Valiev involving the knowledge operator K dedicated to the reasoning with incomplete information. The completeness proof uses a variant of Makinson's canonical model construction. Furthermore we prove that the theoremhood problem for LK is co-NP-complete, using techniques similar to those used to prove that the satisfiability problem for propositional S5 is NP-complete.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  33. Harry Deutsch (2010). Diagonalization and Truth Functional Operators. Analysis 70 (2):215-217.
    (No abstract is available for this citation).
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  34. Jürgen Dix & David Makinson (1992). The Relationship Between KLM and MAK Models for Nonmonotonic Inference Operations. Journal of Logic, Language and Information 1 (2).
    The purpose of this note is to make quite clear the relationship between two variants of the general notion of a preferential model for nonmonotonic inference: the models of Kraus, Lehmann and Magidor (KLM models) and those of Makinson (MAK models).On the one hand, we introduce the notion of the core of a KLM model, which suffices to fully determine the associated nonmonotonic inference relation. On the other hand, we slightly amplify MAK models with a monotonic consequence operation as additional (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  35. Fred I. Dretske (1970). ``Epistemic Operators". Journal of Philosophy 67:1007-1023.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
1 — 100 / 206