This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Most recently added entries found
Search inside:
(import / add options)   Sort by:
1 — 50 / 2589
  1. added 2015-05-04
    Terence Rajivan Edward, Another Solution to the Surprise Exam Paradox.
    I identify an assumption that the students should not rely on. Even if students are entitled to assume that the teacher was sincere at the time of giving the exam announcement, there is a reason against them assuming the following: if the teacher believes that the exam will not be a surprise on a certain day, the teacher will not give the exam on that day. The reason I present does not involve doubting the moral goodness of the teacher.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  2. added 2015-05-01
    Pierre-Jean Renaudie (forthcoming). La Question de la Logique Dans l'Idéalisme Allemand. History and Philosophy of Logic:1-4.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. added 2015-04-30
    Gil Sagi (2014). Formality in Logic: From Logical Terms to Semantic Constraints. Logique Et Analyse 57 (227).
    In this paper I discuss a prevailing view by which logical terms determine forms of sentences and arguments and therefore the logical validity of arguments. This view is common to those who hold that there is a principled distinction between logical and nonlogical terms and those holding relativistic accounts. I adopt the Tarskian tradition by which logical validity is determined by form, but reject the centrality of logical terms. I propose an alternative framework for logic where logical terms no longer (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  4. added 2015-04-27
    Peter Anstey (2015). Francis Bacon and the Laws of Ramus. Hopos: The Journal of the International Society for the History of Philosophy of Science 5 (1):1-23.
    This article assesses the role of the laws of the French logician and educational reformer Petrus Ramus in the writings of Francis Bacon. The laws of Ramus derive from Aristotle’s grounds for necessary propositions. Necessary propositions, according to Aristotle, Ramus, and Bacon, are required for the premises of scientific syllogisms. It is argued that in Bacon’s Advancement of Learning and De augmentis scientiarum the only role for these laws is in the transmission of knowledge that has already been acquired. However, (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  5. added 2015-04-26
    D. M. Gabbay & O. Rodrigues (forthcoming). Equilibrium States in Numerical Argumentation Networks. Logica Universalis:1-63.
    Given an argumentation network with initial values to the arguments, we look for algorithms which can yield extensions compatible with such initial values. We find that the best way of tackling this problem is to offer an iteration formula that takes the initial values and the attack relation and iterates a sequence of intermediate values that eventually converges leading to an extension. The properties surrounding the application of the iteration formula and its connection with other numerical and non-numerical techniques proposed (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  6. added 2015-04-26
    Alexandru Baltag & Sonja Smets (forthcoming). Logics of Informational Interactions. Journal of Philosophical Logic:1-13.
    The pre-eminence of logical dynamics, over a static and purely propositional view of Logic, lies at the core of a new understanding of both formal epistemology and the logical foundations of quantum mechanics. Both areas appear at first sight to be based on purely static propositional formalisms, but in our view their fundamental operators are essentially dynamic in nature. Quantum logic can be best understood as the logic of physically-constrained informational interactions between subsystems of a global physical system. Similarly, epistemic (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. added 2015-04-26
    D. M. Gabbay & O. Rodrigues (forthcoming). Probabilistic Argumentation: An Equational Approach. Logica Universalis:1-38.
    There is a generic way to add any new feature to a system. It involves identifying the basic units which build up the system and introducing the new feature to each of these basic units. In the case where the system is argumentation and the feature is probabilistic we have the following. The basic units are: the nature of the arguments involved; the membership relation in the set S of arguments; the attack relation; and the choice of extensions. Generically to (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  8. added 2015-04-26
    Dale Jacquette (2014). Against Logically Possible World-Relativized Existence. Metaphysica 15 (1).
    The thesis that entities exist in, at, or in relation to logically possible worlds is criticized. The suggestion that actually nonexistent fictional characters might nevertheless exist in nonactual merely logically possible worlds runs afoul of the most general transworld identity requirements. An influential philosophical argument for the concept of world-relativized existence is examined in Alvin Plantinga’s formal development and explanation of modal semantic relations. Despite proposing an attractive unified semantics of alethic modality, Plantinga’s argument is rejected on formal grounds as (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  9. added 2015-04-25
    Gary Ebbs (forthcoming). Satisfying Predicates: Kleene's Proof of the Hilbert–Bernays Theorem. History and Philosophy of Logic:1-21.
    The Hilbert–Bernays Theorem establishes that for any satisfiable first-order quantificational schema S, one can write out linguistic expressions that are guaranteed to yield a true sentence of elementary arithmetic when they are substituted for the predicate letters in S. The theorem implies that if L is a consistent, fully interpreted language rich enough to express elementary arithmetic, then a schema S is valid if and only if every sentence of L that can be obtained by substituting predicates of L for (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. added 2015-04-25
    B. Davidson (1982). Modal trees for modal predicate logics. Logique Et Analyse 25 (97):47.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  11. added 2015-04-25
    Karl DÖhmann (1967). Les travaux du Centre National de Recherches de Logique en 1966. Logique Et Analyse 10 (38):(1967:juin).
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  12. added 2015-04-24
    Y. Cohen (1982). Logical polygraph. Logique Et Analyse 25:425.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  13. added 2015-04-24
    Howard G. Callaway (1979). Reference variables and the empty universe. Logique Et Analyse 22 (85):85.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  14. added 2015-04-22
    Alberto Gatto (forthcoming). Axiomatization of a Branching Time Logic with Indistinguishability Relations. Journal of Philosophical Logic:1-28.
    Trees with indistinguishability relations provide a semantics for a temporal language “composed by” the Peircean tense operators and the Ockhamist modal operator. In this paper, a finite axiomatization with a non standard rule for this language interpreted over bundled trees with indistinguishability relations is given. This axiomatization is proved to be sound and strongly complete.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  15. added 2015-04-22
    M. W. Bunder (1988). Corrections to some results for BCK logics and algebras. Logique Et Analyse 31 (21):115.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  16. added 2015-04-22
    M. W. Bunder (1985). A result for combinators, BCK logics and BCK algebras. Logique Et Analyse 28 (9):33.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  17. added 2015-04-22
    Ross T. Brady (1982). Completeness proofs for the systems RM3 and BN4. Logique Et Analyse 25 (97):9.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  18. added 2015-04-21
    Ross Brady (2008). Negation in Metacomplete Relevant Logics. Logique Et Analyse 51.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  19. added 2015-04-21
    Katalin BimbÓ (2006). 1. Curry-Type Paradoxes. Logique Et Analyse 49.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  20. added 2015-04-21
    R. T. Brady (1984). Natural deduction systems for some quantified relevant logics. Logique Et Analyse 27 (8):355.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  21. added 2015-04-21
    R. T. Brady (1977). Unspecified constants in predicate calculus and first-order theories. Logique Et Analyse 20 (79):229.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  22. added 2015-04-21
    Michael Bennett (1977). Les activités du centre national de recherches de logique en 1977. Logique Et Analyse:519.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  23. added 2015-04-21
    R. T. Brady (1976). A computer program for determining matrix models of propositional calculi. Logique Et Analyse 19 (74):233.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  24. added 2015-04-21
    Nynfa Bosco (1963). La Logique de l'Argumentation. Logique Et Analyse 6 (21):40.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  25. added 2015-04-21
    E. W. Beth (1959). Considérations heuristiques sur les méthodes de déduction par séquences. Logique Et Analyse 2 (8):153.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  26. added 2015-04-19
    Max Gottschlich (forthcoming). Logik und Selbsterkenntnis. Perspektiven der Philosophie.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  27. added 2015-04-19
    John Corcoran (2014). Truth-Preserving and Consequence-Preserving Deduction Rules”,. Bulletin of Symbolic Logic 20:130-1.
    A truth-preservation fallacy is using the concept of truth-preservation where some other concept is needed. For example, in certain contexts saying that consequences can be deduced from premises using truth-preserving deduction rules is a fallacy if it suggests that all truth-preserving rules are consequence-preserving. The arithmetic additive-associativity rule that yields 6 = (3 + (2 + 1)) from 6 = ((3 + 2) + 1) is truth-preserving but not consequence-preserving. As noted in James Gasser’s dissertation, Leibniz has been criticized for (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  28. added 2015-04-19
    John Corcoran (2001). Second-Order Logic. In M. Zeleny (ed.), Logic, Meaning, and Computation: Essays in Memory of Alonzo Church. KLUKER. 61–76.
    “Second-order Logic” in Anderson, C.A. and Zeleny, M., Eds. Logic, Meaning, and Computation: Essays in Memory of Alonzo Church. Dordrecht: Kluwer, 2001. Pp. 61–76. -/- Abstract. This expository article focuses on the fundamental differences between second- order logic and first-order logic. It is written entirely in ordinary English without logical symbols. It employs second-order propositions and second-order reasoning in a natural way to illustrate the fact that second-order logic is actually a familiar part of our traditional intuitive logical framework and (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  29. added 2015-04-18
    Hsing-Chien Tsai (2015). On the Decidability of Axiomatized Mereotopological Theories. Notre Dame Journal of Formal Logic 56 (2):287-306.
    The signature of the formal language of mereotopology contains two predicates $P$ and $C$, which stand for “being a part of” and “contact,” respectively. This paper will deal with the decidability issue of the mereotopological theories which can be formed by the axioms found in the literature. Three main results to be given are as follows: all axiomatized mereotopological theories are separable; all mereotopological theories up to $\mathbf{ACEMT}$, $\mathbf{SACEMT}$, or $\mathbf{SACEMT}^{\prime}$ are finitely inseparable; all axiomatized mereotopological theories except $\mathbf{SAX}$, $\mathbf{SAX}^{\prime}$, (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  30. added 2015-04-18
    Takahiro Seki (2015). Halldén Completeness for Relevant Modal Logics. Notre Dame Journal of Formal Logic 56 (2):333-350.
    Halldén completeness closely resembles the relevance property. To prove Halldén completeness in terms of Kripke-style semantics, the van Benthem–Humberstone theorem is often used. In relevant modal logics, the Halldén completeness of Meyer–Fuhrmann logics has been obtained using the van Benthem–Humberstone theorem. However, there remain a number of Halldén-incomplete relevant modal logics. This paper discusses the Halldén completeness of a wider class of relevant modal logics, namely, those with some Sahlqvist axioms.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  31. added 2015-04-18
    Tapani Hyttinen (2015). Forking in Finite Models. Notre Dame Journal of Formal Logic 56 (2):307-320.
    We study properties of forking in the classes of all finite models of a complete theory in a finite variable logic. We also study model constructions under the assumption that forking is trivial.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  32. added 2015-04-18
    Harold T. Hodes (2015). Why Ramify? Notre Dame Journal of Formal Logic 56 (2):379-415.
    This paper considers two reasons that might support Russell’s choice of a ramified-type theory over a simple-type theory. The first reason is the existence of purported paradoxes that can be formulated in any simple-type language, including an argument that Russell considered in 1903. These arguments depend on certain converse-compositional principles. When we take account of Russell’s doctrine that a propositional function is not a constituent of its values, these principles turn out to be too implausible to make these arguments troubling. (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  33. added 2015-04-18
    David R. Belanger (2015). Weak Truth Table Degrees of Structures. Notre Dame Journal of Formal Logic 56 (2):263-285.
    We study the weak truth table degree spectra of first-order relational structures. We prove a dichotomy among the possible wtt degree spectra along the lines of Knight’s upward-closure theorem for Turing degree spectra. We prove new results contrasting the wtt degree spectra of finite- and infinite-signature structures. We show that, as a method of defining classes of reals, the wtt degree spectrum is, except for some trivial cases, strictly more expressive than the Turing degree spectrum.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  34. added 2015-04-18
    George Voutsadakis (2015). Categorical Abstract Algebraic Logic: Truth-Equational $Pi$-Institutions. Notre Dame Journal of Formal Logic 56 (2):351-378.
    Finitely algebraizable deductive systems were introduced by Blok and Pigozzi to capture the essential properties of those deductive systems that are very tightly connected to quasivarieties of universal algebras. They include the equivalential logics of Czelakowski. Based on Blok and Pigozzi’s work, Herrmann defined algebraizable deductive systems. These are the equivalential deductive systems that are also truth-equational, in the sense that the truth predicate of the class of their reduced matrix models is explicitly definable by some set of unary equations. (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  35. added 2015-04-18
    Andrea Sorbi & Sebastiaan A. Terwijn (2015). Generalizations of the Weak Law of the Excluded Middle. Notre Dame Journal of Formal Logic 56 (2):321-331.
    We study a class of formulas generalizing the weak law of the excluded middle and provide a characterization of these formulas in terms of Kripke frames and Brouwer algebras. We use these formulas to separate logics corresponding to factors of the Medvedev lattice.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  36. added 2015-04-18
    Paolo Mancosu (2014). Grundlagen, Section 64: Frege's Discussion of Definitions by Abstraction in Historical Context. History and Philosophy of Logic 36 (1):62-89.
    I offer in this paper a contextual analysis of Frege's Grundlagen, section 64. It is surprising that with so much ink spilled on that section, the sources of Frege's discussion of definitions by abstraction have remained elusive. I hope to have filled this gap by providing textual evidence coming from, among other sources, Grassmann, Schlömilch, and the tradition of textbooks in geometry for secondary schools . In addition, I put Frege's considerations in the context of a widespread debate in Germany (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  37. added 2015-04-18
    A. J. Dale (1985). A completeness property of negationless intuitionist propositional logics. Logique Et Analyse 28 (9):79.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  38. added 2015-04-18
    M. J. Cresswell (1983). The completeness of KW and K1.1. Logique Et Analyse 26 (2):123.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  39. added 2015-04-18
    A. J. Dale (1983). The non-independence of axioms in a propositional calculus formulated in terms of axiom schemata. Logique Et Analyse 26 (1):91.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  40. added 2015-04-18
    M. J. Cresswell (1982). A canonical model for S2. Logique Et Analyse 25 (97):3.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  41. added 2015-04-18
    L. Apostel (1977). In memoriam Samuel Issman : D'une logique formelle syntaxique a une logique formelle pragmatique. Logique Et Analyse 20 (77):3.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  42. added 2015-04-18
    Haskell B. Curry (1960). The inferential approach to logical calculus, I. Logique Et Analyse 3 (11):119.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  43. added 2015-04-18
    Alan Ross Anderson (1958). Activités du Centre de recherches de Logique en 1957. Logique Et Analyse:92.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  44. added 2015-04-17
    Terence Rajivan Edward, A Solution to the Surprise Exam Paradox.
    The students’ argument against the possibility of a surprise exam assumes that the following would not occur: the teacher decides to give the exam on a certain day, the exam would not be a surprise on that day, but the teacher does not realize this. I give a reason to reject this assumption, and I argue that an attempt to reformulate the surprise exam paradox in order to allow for the assumption does not result in an acceptable argument.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  45. added 2015-04-17
    Marc Champagne, Reply to My Commentator. Argument Cultures: Proceedings of the Ontario Society for the Study of Argumentation.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  46. added 2015-04-17
    M. W. Bunder (1980). Quantified relevance logic and generalised restricted generality. Logique Et Analyse 23 (90):319.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  47. added 2015-04-17
    Robert Burch (1979). Propositions and the liar paradox. Logique Et Analyse 22 (85):55.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  48. added 2015-04-17
    Michael Byrd (1979). On Lukasiewiczian logics with several designated values. Logique Et Analyse 22 (88):489.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  49. added 2015-04-16
    Diderik Batens & Kristof Clercq (2004). A Rich Paraconsistent Extension Of Full Positive Logic. Logique Et Analyse 47.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  50. added 2015-04-16
    J. L. Bell (1982). OLDBLATT, R. I.: "Topoi: The Categorial Analysis of Logic". [REVIEW] British Journal for the Philosophy of Science 33:95.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
1 — 50 / 2589