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:
Logical Connectives (276 | 121)
Negation* (108)
Conditionals* (1,360 | 357)
Disjunction* (45)
Conjunction* (19)
Quantifiers* (1,080 | 333)
Variables (12)

537 found
Search inside:
(import / add options)   Sort by:
1 — 50 / 537
Material to categorize
  1. Francine F. Abeles (2013). Nineteenth Century British Logic on Hypotheticals, Conditionals, and Implication. History and Philosophy of Logic 35 (1):1-14.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  2. M. Abraham, D. M. Gabbay & U. Schild (2012). Contrary to Time Conditionals in Talmudic Logic. Artificial Intelligence and Law 20 (2):145-179.
    We consider conditionals of the form A ⇒ B where A depends on the future and B on the present and past. We examine models for such conditional arising in Talmudic legal cases. We call such conditionals contrary to time conditionals.Three main aspects will be investigated: Inverse causality from future to past, where a future condition can influence a legal event in the past (this is a man made causality).Comparison with similar features in modern law.New types of temporal logics arising (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  3. T. Aho, A. V. Pietarinen & Alasdair Urquhart (2008). Truth and Games: Essays in Honour of Gabriel Sandu. Bulletin of Symbolic Logic 14 (1):119-121.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  4. Scott F. Aikin & Robert B. Talisse (2008). Modus Tonens. Argumentation 22 (4):521-529.
    Restating an interlocutor’s position in an incredulous tone of voice can sometimes serve legitimate dialectical ends. However, there are cases in which incredulous restatement is out of bounds. This article provides an analysis of one common instance of the inappropriate use of incredulous restatement, which the authors call “modus tonens.” The authors argue that modus tonens is vicious because it pragmatically implicates the view that one’s interlocutor is one’s cognitive subordinate and provides a cue to like-minded onlookers that dialectical opponents (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  5. Natasha Alechina & Michiel van Lambalgen (1996). Generalized Quantification as Substructural Logic. Journal of Symbolic Logic 61 (3):1006 - 1044.
    We show how sequent calculi for some generalized quantifiers can be obtained by generalizing the Herbrand approach to ordinary first order proof theory. Typical of the Herbrand approach, as compared to plain sequent calculus, is increased control over relations of dependence between variables. In the case of generalized quantifiers, explicit attention to relations of dependence becomes indispensible for setting up proof systems. It is shown that this can be done by turning variables into structured objects, governed by various types of (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  6. Alan Ross Anderson (1954). Review: B. J. Diggs, Counterfactual Conditionals. [REVIEW] Journal of Symbolic Logic 19 (1):68-68.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. Alan Ross Anderson (1954). Review: Julius R. Weinberg, Contrary-to-Fact Conditionals. [REVIEW] Journal of Symbolic Logic 19 (1):69-70.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  8. Rani Lill Anjum, Johan Arnt Myrstad & Stephen Mumford, Conditional Probability From an Ontological Point of View.
    This paper argues that the technical notion of conditional probability, as given by the ratio analysis, is unsuitable for dealing with our pretheoretical and intuitive understanding of both conditionality and probability. This is an ontological account of conditionals that include an irreducible dispositional connection between the antecedent and consequent conditions and where the conditional has to be treated as an indivisible whole rather than compositional. The relevant type of conditionality is found in some well-defined group of conditional statements. As an (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  9. Horacio L. Arlo Costa (1990). Conditionals and Monotonic Belief Revisions: The Success Postulate. Studia Logica 49 (4):557-566.
    One of the main applications of the logic of theory change is to the epistemic analysis of conditionals via the so-called Ramsey test. In the first part of the present note this test is studied in the “limiting case” where the theory being revised is inconsistent, and it is shown that this case manifests an intrinsic incompatibility between the Ramsey test and the AGM postulate of “success”. The paper then analyses the use of the postulate of success, and a weakening (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. Guillaume Aucher, Bastien Maubert & François Schwarzentruber (2012). Generalized DEL-Sequents. In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. 54--66.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  11. Vince Bárány, Łukasz Kaiser & Alexander Rabinovich (2011). Expressing Cardinality Quantifiers in Monadic Second-Order Logic Over Chains. Journal of Symbolic Logic 76 (2):603 - 619.
    We investigate the extension of monadic second-order logic of order with cardinality quantifiers "there exists uncountably many sets such that... " and "there exists continuum many sets such that... ". We prove that over the class of countable linear orders the two quantifiers are equivalent and can be effectively and uniformly eliminated. Weaker or partial elimination results are obtained for certain wider classes of chains. In particular, we show that over the class of ordinals the uncountability quantifier can be effectively (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  12. 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  
  13. Harald Andreas Bastiaanse (2014). The Intensional Many - Conservativity Reclaimed. Journal of Philosophical Logic 43 (5):883-901.
    Following on Westerståhl’s argument that many is not Conservative [9], I propose an intensional account of Conservativity as well as intensional versions of EXT and Isomorphism closure. I show that an intensional reading of many can easily possess all three of these, and provide a formal statement and proof that they are indeed proper intensionalizations. It is then discussed to what extent these intensionalized properties apply to various existing readings of many.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  14. 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 (8 more)  
     
    My bibliography  
     
    Export citation  
  15. Sarah R. Beck, Daniel P. Weisberg, Patrick Burns & Kevin J. Riggs (2014). Conditional Reasoning and Emotional Experience: A Review of the Development of Counterfactual Thinking. [REVIEW] Studia Logica 102 (4):673-689.
    What do human beings use conditional reasoning for? A psychological consequence of counterfactual conditional reasoning is emotional experience, in particular, regret and relief. Adults’ thoughts about what might have been influence their evaluations of reality. We discuss recent psychological experiments that chart the relationship between children’s ability to engage in conditional reasoning and their experience of counterfactual emotions. Relative to conditional reasoning, counterfactual emotions are late developing. This suggests that children need not only competence in conditional reasoning, but also to (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  16. Nuel D. Belnap Jr (1973). Restricted Quantification and Conditional Assertion. In Hugues Leblanc (ed.), Truth, Syntax and Modality. Amsterdam,North-Holland.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  17. Nuel Belnap (2006). Bressan's Type-Theoretical Combination of Quantification and Modality. In Henrik Lagerlund, Sten Lindström & Rysiek Sliwinski (eds.), Modality Matters: Twenty-Five Essays in Honour of Krister Segerberg. Uppsala Philosophical Studies 53. 53--31.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  18. E. W. Beth (1950). Review: Alfons Borgers, The Natural Number. [REVIEW] Journal of Symbolic Logic 15 (1):66-67.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  19. Robert Blanche (1968). Review: George Goe, Three Axiom Negation-Alternation Formulations of the Truth-Functional Calculus. [REVIEW] Journal of Symbolic Logic 33 (4):606-606.
  20. A. Borgers (1950). Review: G. F. C. Griss, On Negation. [REVIEW] Journal of Symbolic Logic 15 (2):135-136.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  21. Domenico Cantone & Calogero G. Zarba (2006). A Decision Procedure for Monotone Functions Over Bounded and Complete Lattices. In Harrie de Swart, Ewa Orlowska, Gunther Smith & Marc Roubens (eds.), Theory and Applications of Relational Structures as Knowledge Instruments Ii. Springer. 318--333.
  22. Sergio A. Celani (forthcoming). Properties of Saturation in Monotonic Neighbourhood Models and Some Applications. Studia Logica:1-23.
    In this paper we shall discuss properties of saturation in monotonic neighbourhood models and study some applications, like a characterization of compact and modally saturated monotonic models and a characterization of the maximal Hennessy-Milner classes. We shall also show that our notion of modal saturation for monotonic models naturally extends the notion of modal saturation for Kripke models.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  23. Roderick M. Chisholm (1951). Review: Elizabeth Lane Beardsley, "Non-Accidental" and Counterfactual Sentences. [REVIEW] Journal of Symbolic Logic 16 (1):63-64.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. Alonzo Church (1963). Review: Rolf Schock, Some Remarks on Russell's Treatment of Definite Descriptions. [REVIEW] Journal of Symbolic Logic 28 (1):105-106.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  25. Romane Lewis Clark (1952). An Analysis of Certain Forms of Negation Employed in Theory of Knowledge. Dissertation, The University of Iowa
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  26. Roger M. Cooke & Michiel Lambalgen (1983). The Representation of Takeuti's $$\Begin{Array}{*{20}C} \Parallel \\ \_ \\ \End{Array} $$ -Operator. Studia Logica 42 (4):407-415.
    Gaisi Takeuti has recently proposed a new operation on orthomodular latticesL, $\begin{array}{*{20}c} \parallel \\ \_ \\ \end{array} $ :P(L)»L. The properties of $\begin{array}{*{20}c} \parallel \\ \_ \\ \end{array} $ suggest that the value of $\begin{array}{*{20}c} \parallel \\ \_ \\ \end{array} $ (A) (A) $ \subseteq $ L) corresponds to the degree in which the elements ofA behave classically. To make this idea precise, we investigate the connection between structural properties of orthomodular latticesL and the existence of two-valued homomorphisms onL.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  27. J. Corcoran (2005). Counterexamples and Proexamples. Bulletin of Symbolic Logic 11:460.
    Corcoran, J. 2005. Counterexamples and proexamples. Bulletin of Symbolic Logic 11(2005) 460. -/- John Corcoran, Counterexamples and Proexamples. Philosophy, University at Buffalo, Buffalo, NY 14260-4150 E-mail: corcoran@buffalo.edu Every perfect number that is not even is a counterexample for the universal proposition that every perfect number is even. Conversely, every counterexample for the proposition “every perfect number is even” is a perfect number that is not even. Every perfect number that is odd is a proexample for the existential proposition that some (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  28. John Corcoran (2010). Counterarguments and Counterexamples. In Luis Vega (ed.), Luis Vega, Ed. Compendio de Lógica, Argumentación, y Retórica. Madrid: Trotta. 137-142.
    English translation of an entry on pages 137–42 of the Spanish-language dictionary of logic: Luis Vega, Ed. Compendio de Lógica, Argumentación, y Retórica. Madrid: Trotta. -/- DEDICATION: To my friend and collaborator Kevin Tracy. -/- This short essay—containing careful definitions of ‘counterargument’ and ‘counterexample’—is not an easy read but it is one you’ll be glad you struggled through. It contains some carefully chosen examples suitable for classroom discussion. -/- Using the word ‘counterexample’ instead of ‘counterargument’ in connection with Aristotle’s invalidity (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  29. John Corcoran (1999). CORCORAN'S 27 ENTRIES IN THE 1999 SECOND EDITION. In Robert Audi (ed.), Cambridge Dictionary of Philosophy. CAMBRIDGE UP. 65-941.
    Corcoran’s 27 entries in the 1999 second edition of Robert Audi’s Cambridge Dictionary of Philosophy [Cambridge: Cambridge UP]. -/- ancestral, axiomatic method, borderline case, categoricity, Church (Alonzo), conditional, convention T, converse (outer and inner), corresponding conditional, degenerate case, domain, De Morgan, ellipsis, laws of thought, limiting case, logical form, logical subject, material adequacy, mathematical analysis, omega, proof by recursion, recursive function theory, scheme, scope, Tarski (Alfred), tautology, universe of discourse. -/- The entire work is available online free at more than (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  30. John Corcoran (1989). Argumentations and Logic. ARGUMENTAION 3 (1):17-43.
    Argumentations are at the heart of the deductive and the hypothetico-deductive methods, which are involved in attempts to reduce currently open problems to problems already solved. These two methods span the entire spectrum of problem-oriented reasoning from the simplest and most practical to the most complex and most theoretical, thereby uniting all objective thought whether ancient or contemporary, whether humanistic or scientific, whether normative or descriptive, whether concrete or abstract. Analysis, synthesis, evaluation, and function of argumentations are described. Perennial philosophic (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  31. Charles B. Cross (1989). Review: Donald Nute, Conditional Logic. [REVIEW] Journal of Symbolic Logic 54 (4):1477-1479.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  32. Charles B. Cross & Donald Nute (1997). Review: G. Crocco, L. Farinas Del Cerro, A. Herzig, Conditionals: From Philosophy to Computer Science. [REVIEW] Journal of Symbolic Logic 62 (4):1487-1490.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  33. Barbara F. Csima & Joseph R. Mileti (2009). The Strength of the Rainbow Ramsey Theorem. Journal of Symbolic Logic 74 (4):1310 - 1324.
    The Rainbow Ramsey Theorem is essentially an "anti-Ramsey" theorem which states that certain types of colorings must be injective on a large subset (rather than constant on a large subset). Surprisingly, this version follows easily from Ramsey's Theorem, even in the weak system RCA₀ of reverse mathematics. We answer the question of the converse implication for pairs, showing that the Rainbow Ramsey Theorem for pairs is in fact strictly weaker than Ramsey's Theorem for pairs over RCA₀. The separation involves techniques (...)
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  34. N. C. A. Da Costa & A. A. M. Rodrigues (2007). Definability and Invariance. Studia Logica 86 (1):1-30.
    In his thesis Para uma Teoria Geral dos Homomorfismos (1944), the Portuguese mathematician José Sebastião e Silva constructed an abstract or generalized Galois theory, that is intimately linked to F. Klein’s Erlangen Program and that foreshadows some notions and results of today’s model theory; an analogous theory was independently worked out by M. Krasner in 1938. In this paper, we present a version of the theory making use of tools which were not at Silva’s disposal. At the same time, we (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  35. K. Das (2001). Justification Of Rules In Quantification Logic. Indian Philosophical Quarterly 28 (2):119-138.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  36. Martin Davis (1951). Review: W. V. Quine, On Decidability and Completeness. [REVIEW] Journal of Symbolic Logic 16 (1):76-76.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  37. B. J. Diggs (1969). Review: William T. Fontaine, Avoidability and the Contrary-to-Fact Conditional in C. L. Stevenson and C. I. Lewis. [REVIEW] Journal of Symbolic Logic 34 (3):500-500.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  38. Mikael Eriksson (2008). Hypothesis Testing Analysis. Sorites 20:141-156.
    Logic, as the theory of reasoning, traditionally focuses upon the validity of natural language arguments. During the millennia several logical systems have evolved, each using a specific set of logical constants validating some part of the natural language arguing. Therefore, at the time when reasoning of empirical knowledge entered the scene, it was not surprising to find logical systems having their set of logical constants validating that natural phenomenon. The aim of this paper is to question the strength of such (...)
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  39. E. M. Fels (1968). Review: A. P. Jerschow, Heinz D. Modrow, Operator Algorithmen. II. [REVIEW] Journal of Symbolic Logic 33 (3):467-467.
    Remove from this list |
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  40. Agnes Fiilop (1995). Generalized Dimensions and Generalized Entropies of Strange Attractors. In R. J. Russell, N. Murphy & A. R. Peacocke (eds.), Chaos and Complexity. Vatican Observatory Publications. 251.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  41. Frederic B. Fitch (1949). Review: Erik Stenius, Natural Implication and Material Implication. [REVIEW] Journal of Symbolic Logic 14 (3):198-198.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  42. Dagfinn Follesdal (1968). Review: Claes-Goran Holm, On the Question of the Rise of Quantification Theory. [REVIEW] Journal of Symbolic Logic 33 (4):605-605.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  43. Nissim Francez & Roy Dyckhoff (2012). A Note on Harmony. Journal of Philosophical Logic 41 (3):613-628.
    In the proof-theoretic semantics approach to meaning, harmony , requiring a balance between introduction-rules (I-rules) and elimination rules (E-rules) within a meaning conferring natural-deduction proof-system, is a central notion. In this paper, we consider two notions of harmony that were proposed in the literature: 1. GE-harmony , requiring a certain form of the E-rules, given the form of the I-rules. 2. Local intrinsic harmony : imposes the existence of certain transformations of derivations, known as reduction and expansion . We propose (...)
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  44. Peter Gärdenfors (2011). Notes on the History of Ideas Behind AGM. Journal of Philosophical Logic 40 (2):115 - 120.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  45. R. Gavalda, A. Atserias & N. Galesi (2001). Monotone Proofs of the Pigeon Hole Principle. Mathematical Logic Quarterly 47 (4):461-474.
    We study the complexity of proving the Pigeon Hole Principle in a monotone variant of the Gentzen Calculus, also known as Geometric Logic. We prove a size-depth trade-off upper bound for monotone proofs of the standard encoding of the PHP as a monotone sequent. At one extreme of the trade-off we get quasipolynomia -size monotone proofs, and at the other extreme we get subexponential-size bounded-depth monotone proofs. This result is a consequence of deriving the basic properties of certain monotone formulas (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  46. Angelo Gilio & Giuseppe Sanfilippo (2014). Conditional Random Quantities and Compounds of Conditionals. Studia Logica 102 (4):709-729.
    In this paper we consider conditional random quantities (c.r.q.’s) in the setting of coherence. Based on betting scheme, a c.r.q. X|H is not looked at as a restriction but, in a more extended way, as \({XH + \mathbb{P}(X|H)H^c}\) ; in particular (the indicator of) a conditional event E|H is looked at as EH + P(E|H)H c . This extended notion of c.r.q. allows algebraic developments among c.r.q.’s even if the conditioning events are different; then, for instance, we can give a (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  47. Jonathan Michael Gold (1981). Complexity, Ordinality and Logic. Dissertation, State University of New York at Stony Brook
    We give an account of the applicability of first order logic to states of affairs. We show that the metaphysics of atomism is incapable of doing this. Against the central thesis of the Tractatus, we show that the logical constant symbols do represent. We rebut Wittgenstein's arguments by showing they are either non sequiturs or beg the question. We provide a model which displays that logically equivalent formulae can and do represent different states of affairs. We also consider criticisms of (...)
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  48. Jerzy Gołosz (2013). Presentism, Eternalism, and the Triviality Problem. Logic and Logical Philosophy 22 (1):45-61.
    It is often claimed that the debate between presentism and eternalism is merely verbal, because when we use tensed, detensed or tenseless notions of existence, there is no difference in the accepted metaphysical statements between the adherents of both views. On the contrary, it is shown in this paper that when we express their positions making use, in accordance with intentions of the presentists and the eternalists, of the tensed notion of existence (in the case of the presentists) and the (...)
    Remove from this list | Direct download (11 more)  
     
    My bibliography  
     
    Export citation  
  49. Noam Greenberg (2011). A Random Set Which Only Computes Strongly Jump-Traceable C.E. Sets. Journal of Symbolic Logic 76 (2):700 - 718.
    We prove that there is a ${\mathrm{\Delta }}_{2}^{0}$ , 1-random set Y such that every computably enumerable set which is computable from Y is strongly jump-traceable. We also show that for every order function h there is an ω-c.e. random set Y such that every computably enumerable set which is computable from Y is h-jump-traceable. This establishes a correspondence between rates of jump-traceability and computability from ω-c.e. random sets.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  50. Bruce L. Grenberg (1989). Some Other World to Find Quest and Negation in the Works of Herman Melville. Monograph Collection (Matt - Pseudo).
    Remove from this list |
     
    My bibliography  
     
    Export citation  
1 — 50 / 537