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 / 98
  1. added 2015-07-31
    Farzad Didehvar, Consistency Problem and “Unexpected Hanging Problem”.
  2. added 2015-07-30
    Albert J. J. Anglberger, Nobert Gratzl & Olivier Roy (forthcoming). Obligation, Free Choice, and the Logic of Weakest Permissions. Review of Symbolic Logic:1-21.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. added 2015-07-30
    L. M. Geerdink & C. Dutilh Novaes (forthcoming). Varieties of Logic. History and Philosophy of Logic:1-3.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  4. added 2015-07-29
    Rachael Briggs (forthcoming). Foundations of Probability. Journal of Philosophical Logic:1-16.
    The foundations of probability are viewed through the lens of the subjectivist interpretation. This article surveys conditional probability, arguments for probabilism, probability dynamics, and the evidential and subjective interpretations of probability.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  5. added 2015-07-28
    Todd R. Davies (1991). Knowledge Bases and Neural Network Synthesis. In Hozumi Tanaka (ed.), Artificial Intelligence in the Pacific Rim: Proceedings of the Pacific Rim International Conference on Artificial Intelligence. IOS Press, Inc. 717-722.
    We describe and try to motivate our project to build systems using both a knowledge based and a neural network approach. These two approaches are used at different stages in the solution of a problem, instead of using knowledge bases exclusively on some problems, and neural nets exclusively on others. The knowledge base (KB) is defined first in a declarative, symbolic language that is easy to use. It is then compiled into an efficient neural network (NN) representation, run, and the (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  6. added 2015-07-26
    Marc Champagne (forthcoming). Sound Reasoning : Prospects and Challenges of Current Acoustic Logics. Logica Universalis:1-13.
    Building on the notational principles of C. S. Peirce’s graphical logic, Pietarinen has tried to develop a propositional logic unfolding in the medium of sound. Apart from its intrinsic interest, this project serves as a concrete test of logic’s range. However, I argue that Pietarinen’s inaugural proposal, while promising, has an important shortcoming, since it cannot portray double-negation without thereby portraying a contradiction.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. added 2015-07-26
    Kit Fine (forthcoming). Angellic Content. Journal of Philosophical Logic:1-28.
    I provide a truthmaker semantics for Angell’s system of analytic implication and establish completeness.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  8. added 2015-07-24
    Thomas Mormann, Squares of Oppositions, Commutative Diagrams, and Galois Connection for Topological Spaces and Similarity Structures.
    The aim of this paper is to elucidate the relationship between Aristotelian conceptual oppositions, commutative diagrams of relational structures, and Galois connections.This is done by investigating in detail some examples of Aristotelian conceptual oppositions arising from topological spaces and similarity structures. The main technical device for this endeavor is the notion of Galois connections of order structures.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  9. added 2015-07-24
    Vít Punčochář (forthcoming). A Generalization of Inquisitive Semantics. Journal of Philosophical Logic:1-30.
    This paper introduces a generalized version of inquisitive semantics, denoted as GIS, and concentrates especially on the role of disjunction in this general framework. Two alternative semantic conditions for disjunction are compared: the first one corresponds to the so-called tensor operator of dependence logic, and the second one is the standard condition for inquisitive disjunction. It is shown that GIS is intimately related to intuitionistic logic and its Kripke semantics. Using this framework, it is shown that the main results concerning (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  10. added 2015-07-22
    Michael C. Laskowski (2015). Characterizing Model Completeness Among Mutually Algebraic Structures. Notre Dame Journal of Formal Logic 56 (3):463-470.
    We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula is equivalent. This characterization yields a new, more constructive proof that the elementary diagram of any model of a strongly minimal, trivial theory is model complete.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  11. added 2015-07-22
    Laurence Kirby (2015). Ordinal Exponentiations of Sets. Notre Dame Journal of Formal Logic 56 (3):449-462.
    The “high school algebra” laws of exponentiation fail in the ordinal arithmetic of sets that generalizes the arithmetic of the von Neumann ordinals. The situation can be remedied by using an alternative arithmetic of sets, based on the Zermelo ordinals, where the high school laws hold. In fact the Zermelo arithmetic of sets is uniquely characterized by its satisfying the high school laws together with basic properties of addition and multiplication. We also show how in both arithmetics the behavior of (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  12. added 2015-07-22
    Juliette Kennedy, Saharon Shelah & Jouko Väänänen (2015). Regular Ultrapowers at Regular Cardinals. Notre Dame Journal of Formal Logic 56 (3):417-428.
    In earlier work by the first and second authors, the equivalence of a finite square principle $\square^{\mathrm{fin}}_{\lambda,D}$ with various model-theoretic properties of structures of size $\lambda $ and regular ultrafilters was established. In this paper we investigate the principle $\square^{\mathrm{fin}}_{\lambda,D}$—and thereby the above model-theoretic properties—at a regular cardinal. By Chang’s two-cardinal theorem, $\square^{\mathrm{fin}}_{\lambda,D}$ holds at regular cardinals for all regular filters $D$ if we assume the generalized continuum hypothesis. In this paper we prove in ZFC that, for certain regular filters (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  13. added 2015-07-22
    Eunsuk Yang (2015). Substructural Fuzzy-Relevance Logic. Notre Dame Journal of Formal Logic 56 (3):471-491.
    This paper proposes a new topic in substructural logic for use in research joining the fields of relevance and fuzzy logics. For this, we consider old and new relevance principles. We first introduce fuzzy systems satisfying an old relevance principle, that is, Dunn’s weak relevance principle. We present ways to obtain relevant companions of the weakening-free uninorm systems introduced by Metcalfe and Montagna and fuzzy companions of the system R of relevant implication and its neighbors. The algebraic structures corresponding to (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  14. added 2015-07-22
    Lynn Scow (2015). Indiscernibles, EM-Types, and Ramsey Classes of Trees. Notre Dame Journal of Formal Logic 56 (3):429-447.
    The author has previously shown that for a certain class of structures $\mathcal {I}$, $\mathcal {I}$-indexed indiscernible sets have the modeling property just in case the age of $\mathcal {I}$ is a Ramsey class. We expand this known class of structures from ordered structures in a finite relational language to ordered, locally finite structures which isolate quantifier-free types by way of quantifier-free formulas. This result is applied to give new proofs that certain classes of trees are Ramsey. To aid this (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  15. added 2015-07-22
    Isaac Goldbring & Vinicius Cifú Lopes (2015). Pseudofinite and Pseudocompact Metric Structures. Notre Dame Journal of Formal Logic 56 (3):493-510.
    The definition of a pseudofinite structure can be translated verbatim into continuous logic, but it also gives rise to a stronger notion and to two parallel concepts of pseudocompactness. Our purpose is to investigate the relationship between these four concepts and establish or refute each of them for several basic theories in continuous logic. Pseudofiniteness and pseudocompactness turn out to be equivalent for relational languages with constant symbols, and the four notions coincide with the standard pseudofiniteness in the case of (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  16. added 2015-07-20
    Christopher Gauker, A Completenesss Theorem for a 3-Valued Semantics for a First-Order Language.
    This document presents a Gentzen-style deductive calculus and proves that it is complete with respect to a 3-valued semantics for a language with quantifiers. The semantics resembles the strong Kleene semantics with respect to conjunction, disjunction and negation. The completeness proof for the sentential fragment fills in the details of a proof sketched in Arnon Avron (2003). The extension to quantifiers is original but uses standard techniques.
    Remove from this list |
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  17. added 2015-07-19
    Tore Fjetland Øgaard (forthcoming). Paths to Triviality. Journal of Philosophical Logic:1-40.
    This paper presents a range of new triviality proofs pertaining to naïve truth theory formulated in paraconsistent relevant logics. It is shown that excluded middle together with various permutation principles such as A → ⊩B → trivialize naïve truth theory. The paper also provides some new triviality proofs which utilize the axioms ∧) → and → ¬A, the fusion connective and the Ackermann constant. An overview over various ways to formulate Leibniz’s law in non-classical logics and two new triviality proofs (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  18. added 2015-07-18
    Noah Greenstein (2015). Punny Logic. Analysis 75 (3):359-362.
    Logic and humour tend to be mutually exclusive topics. Humour plays off ambiguity, while classical logic falters over it. Formalizing puns is therefore impossible, since puns have ambiguous meanings for their components. However, I will use Independence-Friendly logic to formally encode the multiple meanings within a pun. This will show a general strategy of how to logically represent ambiguity and reveals humour as an untapped source of novel logical structure.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  19. added 2015-07-17
    Gabriel Oak Rabin & Brian Rabern (forthcoming). Well Founding Grounding Grounding. Journal of Philosophical Logic:1-31.
    Those who wish to claim that all facts about grounding are themselves grounded (“the meta-grounding thesis”) must defend against the charge that such a claim leads to infinite regress and violates the well-foundedness of ground. In this paper, we defend. First, we explore three distinct but related notions of “well-founded”, which are often conflated, and three corresponding notions of infinite regress. We explore the entailment relations between these notions. We conclude that the meta-grounding thesis need not lead to tension with (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  20. added 2015-07-17
    Marilynn Johnson (2015). Tree Trimming: Four Non-Brancing Rules for Priest's Introduction to Non-Classical Logic. Australasian Journal of Logic 12 (2):97-120.
    In An Introduction to Non-Classical Logic: From If to Is Graham Priest presents branching rules in Free Logic, Variable Domain Modal Logic, and Intuitionist Logic. I propose a simpler, non-branching rule to replace Priest's rule for universal instantiation in Free Logic, a second, slightly modified version of this rule to replace Priest's rule for universal instantiation in Variable Domain Modal Logic, and third and fourth rules, further modifying the second rule, to replace Priest's branching universal and particular instantiation rules in (...)
    Remove from this list |
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  21. added 2015-07-16
    John C. McCabe-Dansted, Tim French, Sophie Pinchinat & Mark Reynolds (forthcoming). Expressiveness and Succinctness of a Logic of Robustness. Journal of Applied Non-Classical Logics:1-36.
    This paper compares the recently proposed Robust Full Computational Tree Logic to model robustness in concurrent systems with other computational tree logic -based logics. RoCTL* extends CTL* with the addition of the operators Obligatory and Robustly, which quantify over failure-free paths and paths with one more failure respectively. This paper focuses on examining the succinctness and expressiveness of RoCTL* by presenting translations to and from RoCTL*. The core result of this paper is to show that RoCTL* is expressively equivalent to (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  22. added 2015-07-14
    John Corcoran & William Frank (2013). SURPRISES IN LOGIC. Bulletin of Symbolic Logic 19:253.
    JOHN CORCORAN AND WILIAM FRANK. Surprises in logic. Bulletin of Symbolic Logic. 19 (2013) 253. Some people, not just beginning students, are at first surprised to learn that the proposition “If zero is odd, then zero is not odd” is not self-contradictory. Some people are surprised to find out that there are logically equivalent false universal propositions that have no counterexamples in common, i. e., that no counterexample for one is a counterexample for the other. Some people would be surprised (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  23. added 2015-07-11
    John Goodrick, Byunghan Kim & Alexei Kolesnikov (2015). Type-Amalgamation Properties and Polygroupoids in Stable Theories. Journal of Mathematical Logic 15 (1):1550004.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. added 2015-07-11
    Darío García, Dugald Macpherson & Charles Steinhorn (2015). Pseudofinite Structures and Simplicity. Journal of Mathematical Logic 15 (1):1550002.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  25. added 2015-07-09
    Makoto Kikuchi & Taishi Kurahashi (forthcoming). Liar-Type Paradoxes and the Incompleteness Phenomena. Journal of Philosophical Logic:1-18.
    We define a liar-type paradox as a consistent proposition in propositional modal logic which is obtained by attaching boxes to several subformulas of an inconsistent proposition in classical propositional logic, and show several famous paradoxes are liar-type. Then we show that we can generate a liar-type paradox from any inconsistent proposition in classical propositional logic and that undecidable sentences in arithmetic can be obtained from the existence of a liar-type paradox. We extend these results to predicate logic and discuss Yablo’s (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  26. added 2015-07-09
    Paolo Maffezioli (forthcoming). Analytic Rules for Mereology. Studia Logica:1-36.
    We present a sequent calculus for extensional mereology. It extends the classical first-order sequent calculus with identity by rules of inference corresponding to well-known mereological axioms. Structural rules, including cut, are admissible.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  27. added 2015-07-09
    Taolue Chen, Giuseppe Primiero, Franco Raimondi & Neha Rungta (forthcoming). A Computationally Grounded, Weighted Doxastic Logic. Studia Logica:1-25.
    Modelling, reasoning and verifying complex situations involving a system of agents is crucial in all phases of the development of a number of safety-critical systems. In particular, it is of fundamental importance to have tools and techniques to reason about the doxastic and epistemic states of agents, to make sure that the agents behave as intended. In this paper we introduce a computationally grounded logic called COGWED and we present two types of semantics that support a range of practical situations. (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  28. added 2015-07-09
    Peter Verdée & Diderik Batens (forthcoming). Nice Embedding in Classical Logic. Studia Logica:1-32.
    It is shown that a set of semi-recursive logics, including many fragments of CL, can be embedded within CL in an interesting way. A logic belongs to the set iff it has a certain type of semantics, called nice semantics. The set includes many logics presented in the literature. The embedding reveals structural properties of the embedded logic. The embedding turns finite premise sets into finite premise sets. The partial decision methods for CL that are goal directed with respect to (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  29. added 2015-07-09
    Marcelo E. Coniglio & Martín Figallo (2015). A Formal Framework for Hypersequent Calculi and Their Fibring. In Arnold Koslow & Arthur Buchsbaum (eds.), The Road to Universal Logic: Festschrift for 50th Birthday of Jean-Yves Béziau, Volume I. Springer 73-93.
    Hypersequents are a natural generalization of ordinary sequents which turn out to be a very suitable tool for presenting cut-free Gentzent-type formulations for diverse logics. In this paper, an alternative way of formulating hypersequent calculi (by introducing meta-variables for formulas, sequents and hypersequents in the object language) is presented. A suitable category of hypersequent calculi with their morphisms is defined and both types of fibring (constrained and unconstrained) are introduced. The introduced morphisms induce a novel notion of translation between logics (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  30. added 2015-07-09
    Marcelo E. Coniglio & Luís A. Sbardellini (2015). On the Ordered Dedekind Real Numbers in Toposes. In Edward H. Haeusler, Wagner Sanz & Bruno Lopes (eds.), Why is this a Proof? Festschrift for Luiz Carlos Pereira. College Publications 87-105.
    In 1996, W. Veldman and F. Waaldijk present a constructive (intuitionistic) proof for the homogeneity of the ordered structure of the Cauchy real numbers, and so this result holds in any topos with natural number object. However, it is well known that the real numbers objects obtained by the traditional constructions of Cauchy sequences and Dedekind cuts are not necessarily isomorphic in an arbitrary topos with natural numbers object. Consequently, Veldman and Waaldijk's result does not apply to the ordered structure (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  31. added 2015-07-09
    Marcelo E. Coniglio, Francesc Esteva & Lluís Godo (2014). Logics of Formal Inconsistency Arising From Systems of Fuzzy Logic. Logic Journal of the IGPL 22 (6):880-904.
    This article proposes the meeting of fuzzy logic with paraconsistency in a very precise and foundational way. Specifically, in this article we introduce expansions of the fuzzy logic MTL by means of primitive operators for consistency and inconsistency in the style of the so-called Logics of Formal Inconsistency (LFIs). The main novelty of the present approach is the definition of postulates for this type of operators over MTL-algebras, leading to the definition and axiomatization of a family of logics, expansions of (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  32. added 2015-07-09
    Marcelo E. Coniglio & Luiz H. Da Cruz Silvestrini (2013). An Alternative Approach for Quasi-Truth. Logic Journal of the IGPL 22 (2):387-410.
    In 1986, Mikenberg et al. introduced the semantic notion of quasi-truth defined by means of partial structures. In such structures, the predicates are seen as triples of pairwise disjoint sets: the set of tuples which satisfies, does not satisfy and can satisfy or not the predicate, respectively. The syntactical counterpart of the logic of partial truth is a rather complicated first-order modal logic. In the present article, the notion of predicates as triples is recursively extended, in a natural way, to (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  33. added 2015-07-07
    Charles B. Cross (forthcoming). Embedded Counterfactuals and Possible Worlds Semantics. Philosophical Studies:1-9.
    Stephen Barker argues that a possible worlds semantics for the counterfactual conditional of the sort proposed by Stalnaker and Lewis cannot accommodate certain examples in which determinism is true and a counterfactual Q > R is false, but where, for some P, the compound counterfactual P > (Q > R) is true. I argue that the completeness theorem for Lewis’s system VC of counterfactual logic shows that Stalnaker–Lewis semantics does accommodate Barker’s example, and I argue that its doing so should (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  34. added 2015-07-07
    Martin Fischer & Leon Horsten (2015). The Expressive Power of Truth. Review of Symbolic Logic 8 (2):345-369.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  35. added 2015-07-07
    Paolo Mancosu (2015). In Good Company? On Hume’s Principle and the Assignment of Numbers to Infinite Concepts. Review of Symbolic Logic 8 (2):370-410.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  36. added 2015-07-07
    Toby Meadows (2015). Infinitary Tableau for Semantic Truth. Review of Symbolic Logic 8 (2):207-235.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  37. added 2015-07-07
    Neil Tennant (2015). Cut for Classical Core Logic. Review of Symbolic Logic 8 (2):236-256.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  38. added 2015-07-07
    Nissim Francez (2015). On the Notion of Canonical Derivations From Open Assumptions and its Role in Proof-Theoretic Semantics. Review of Symbolic Logic 8 (2):296-305.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  39. added 2015-07-07
    Hitoshi Omori (2015). Remarks on Naive Set Theory Based on Lp. Review of Symbolic Logic 8 (2):279-295.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  40. added 2015-07-07
    Michael Ernst (2015). The Prospects of Unlimited Category Theory: Doing What Remains to Be Done. Review of Symbolic Logic 8 (2):306-327.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  41. added 2015-07-04
    Domingos Faria (2013). São Sólidos os Argumentos de Quine Contra a Modalidade de Re? Theoria - Revista Eletrônica de Filosofia 5.
    Remove from this list |
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  42. added 2015-07-02
    John Corcoran & Gerald Rising (2015). Expressing Set-Size Equality. Bulletin of Symbolic Logic 21 (2):239.
    The word ‘equality’ often requires disambiguation, which is provided by context or by an explicit modifier. For each sort of magnitude, there is at least one sense of ‘equals’ with its correlated senses of ‘is greater than’ and ‘is less than’. Given any two magnitudes of the same sort—two line segments, two plane figures, two solids, two time intervals, two temperature intervals, two amounts of money in a single currency, and the like—the one equals the other or the one is (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  43. added 2015-07-01
    Felice Cardone (forthcoming). Continuity in Semantic Theories of Programming. History and Philosophy of Logic:1-20.
    Continuity is perhaps the most familiar characterization of the finitary character of the operations performed in computation. We sketch the historical and conceptual development of this notion by interpreting it as a unifying theme across three main varieties of semantical theories of programming: denotational, axiomatic and event-based. Our exploration spans the development of this notion from its origins in recursion theory to the forms it takes in the context of the more recent event-based analyses of sequential and concurrent computations, touching (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  44. added 2015-07-01
    John Corcoran & Anthony Ramnauth (2013). Equality and Identity. Bulletin of Symbolic Logic 19:255-256.
    Equality and identity. Bulletin of Symbolic Logic. 19 (2013) 255-6. (Coauthor: Anthony Ramnauth) Also see https://www.academia.edu/s/a6bf02aaab This article uses ‘equals’ [‘is equal to’] and ‘is’ [‘is identical to’, ‘is one and the same as’] as they are used in ordinary exact English. In a logically perfect language the oxymoron ‘the numbers 3 and 2+1 are the same number’ could not be said. Likewise, ‘the number 3 and the number 2+1 are one number’ is just as bad from a logical point (...)
    Remove from this list |
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  45. added 2015-06-30
    Caleb Dewey & Garri Hovhannisyan, Inductive Theories Are Cognitive Metaphors.
    For decades, metaphors have been known to be very important within science. Recently, Brown (2008) strengthened their importance so far as to argue that all scientific models are metaphors (in the cognitive sense). We stretch their importance even further to say that all scientific theories are cognitive metaphors as long as those theories are yielded by a coherent account of induction. Since standard induction is incoherent, as per Hume and Duhem, we primarily concern ourselves with defining a coherent account of (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  46. added 2015-06-30
    Igal Kvart, THE CAUSAL-PROCESS-CHANCE-BASED ANALYSIS OF CONTERFACTUALS.
    Abstract In this paper I consider an easier-to-read and improved to a certain extent version of the causal chance-based analysis of counterfactuals that I proposed and argued for in my A Theory of Counterfactuals. Sections 2, 3 and 4 form Part I: In it, I survey the analysis of the core counterfactuals (in which, very roughly, the antecedent is compatible with history prior to it). In section 2 I go through the three main aspects of this analysis, which are the (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  47. added 2015-06-29
    Francesco Berto (2015). A Modality Called ‘Negation. Mind 124 (495):761-793.
    I propose a comprehensive account of negation as a modal operator, vindicating a moderate logical pluralism. Negation is taken as a quantifier on worlds, restricted by an accessibility relation encoding the basic concept of compatibility. This latter captures the core meaning of the operator. While some candidate negations are then ruled out as violating plausible constraints on compatibility, different specifications of the notion of world support different logical conducts for negations. The approach unifies in a philosophically motivated picture the following (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  48. added 2015-06-29
    Luciana Benotti (2015). Book Review: Jonathan Ginzburg, The Interactive Stance: Meaning in Conversation. [REVIEW] Studia Logica 103 (4):877-882.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  49. added 2015-06-27
    Robert J. Rovetto (forthcoming). Presentism and the Problem of Singular Propositions About Non-Present Objects – Limitations of a Proposed Solution. Polish Journal of Philosophy 8 (1).
    In “A Defense of Presentism”, Ned Markosian addresses the problem of singular propositions about non-present objects. The proposed solution uses a paraphrasing strategy that differentiates between two kinds of meaning in declarative sentences, and also distinguishes between two truth-conditions for singular propositions. The solution, however, is unsatisfactory. I demonstrate that the both truth-conditions suffer from the same problems in spite of the examples used to support the claim that one is a proper treatment for singular propositions. Part of the difficulty (...)
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  50. added 2015-06-21
    Chien-Hsing Ho (forthcoming). Resolving the Ineffability Paradox. Bloomsbury Academic.
    A number of contemporary philosophers think that the unqualified statement “X is unspeakable” faces the danger of self-referential absurdity: if this statement is true, it must simultaneously be false, given that X is speakable by the predicate word “unspeakable.” This predicament is in this chapter formulated as an argument that I term the “ineffability paradox.” After examining the Buddhist semantic theory of apoha (exclusion) and an apoha solution to the issue, I resort to a few Chinese Buddhist and Hindu philosophical (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
1 — 50 / 98