Search results for 'Entailment (Logic' (try it on Scholar)

309 found
Order:
  1. Alan Ross Anderson (1990). Entailment: The Logic of Relevance and Necessity. Princeton University Press.
  2.  23
    Richard Patterson (1995). Aristotle's Modal Logic: Essence and Entailment in the Organon. Cambridge University Press.
    Aristotle's Modal Logic presents a very new interpretation of Aristotle's logic by arguing that a proper understanding of the system depends on an appreciation of its connection to the metaphysics. Richard Patterson develops three striking theses in the book. First, there is a fundamental connection between Aristotle's logic of possibility and necessity, and his metaphysics, and that this connection extends far beyond the widely recognised tie to scientific demonstration and relates to the more basic distinction between the essential and accidental (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  3.  9
    Pietro Galliani (2013). General Models and Entailment Semantics for Independence Logic. Notre Dame Journal of Formal Logic 54 (2):253-275.
    We develop a semantics for independence logic with respect to what we will call general models. We then introduce a simpler entailment semantics for the same logic, and we reduce the validity problem in the former to the validity problem in the latter. Then we build a proof system for independence logic and prove its soundness and completeness with respect to entailment semantics.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  4. Alan R. Anderson & Nuel D. Belnap (1975). Entailment: The Logic of Relevance and Neccessity, Vol. I. Princeton University Press.
  5.  12
    Teodor Stepien (1985). Logic Based on Atomic Entailment. Bulletin of the Section of Logic 14 (2):65-69.
    . In this paper we propose a new definition of entailment and construct a system S of predicate calculus based on this entailment. It is also shown that all well-known set theories can be based on the system S.
    Direct download  
     
    Export citation  
     
    My bibliography  
  6. Kevin Knight (2003). Probabilistic Entailment and a Non-Probabilistic Logic. Logic Journal of the Igpl 11 (3):353-365.
    In this paper we present a probabilistic notion of entailment for finite sets of premises, which has classical entailment as a special case, and show that it is well defined; i.e., that the problem of whether a sentence is entailed by a set of premises is computable. Further we present a natural deductive system and prove that it is the strongest deductive system possible without referring to probabilities.
    Direct download  
     
    Export citation  
     
    My bibliography  
  7. Alan Ross Anderson, Nuel D. Belnap & J. Michael Dunn (1992). Entailment: The Logic of Relevance and Necessity, Vol. II. Princeton University Press.
    Translate
     
     
    Export citation  
     
    My bibliography   41 citations  
  8.  2
    Larisa Maksimova (1996). Review: Alan Ross Anderson, Entailment. The Logic of Relevance and Necessity. [REVIEW] Journal of Symbolic Logic 61 (1):338-341.
    Direct download  
     
    Export citation  
     
    My bibliography  
  9.  2
    Harry Deutsch (1992). Review: J. Michael Dunn, Relevance Logic and Entailment. [REVIEW] Journal of Symbolic Logic 57 (2):752-753.
    Direct download  
     
    Export citation  
     
    My bibliography  
  10.  1
    Daniel H. Cohen (1990). Meyer Robert K.. A Farewell to Entailment. Foundations of Logic and Linguistics, Problems and Their Solutions, Edited by Dorn Georg and Weingartner P., Plenum Press, New York and London 1985, Pp. 577–636. [REVIEW] Journal of Symbolic Logic 55 (1):352-353.
    Direct download  
     
    Export citation  
     
    My bibliography  
  11.  1
    Gordon Matthews (1977). Review: Alan Ross Anderson, Nuel D. Belnap., Entailment. The Logic of Relevance and Necessity. Volume I. [REVIEW] Journal of Symbolic Logic 42 (2):311-313.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12. David Makinson (1975). Review: Arthur Pap, Logic and the Concept of Entailment. [REVIEW] Journal of Symbolic Logic 40 (3):466-466.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  13.  42
    A. J. Dale (1980). Mathematical Logic and the Substitutional Account of Entailment. Analysis 40 (4):203 - 205.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  14.  12
    Wesley C. Salmon (1969). Partial Entailment as a Basis for Inductive Logic. In Nicholas Rescher (ed.), Essays in Honor of Carl G. Hempel. Reidel 47--82.
    Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  15.  32
    P. T. Geach (1977). Entailment: The Logic of Relevance and Necessity, Vol. I By Alan Ross Anderson and Nuel D. Belnap Jr Princeton University Press, 1976, Xxxii + 542 Pp., £13.70. [REVIEW] Philosophy 52 (202):493-.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  16. A. Orenstein (2000). Richard Patterson, Aristotle's Modal Logic: Essence and Entailment in the Organon. International Journal of Philosophical Studies 8 (2):263-265.
    No categories
     
    Export citation  
     
    My bibliography   1 citation  
  17.  21
    V. K. Bharadwaja (1987). Implication and Entailment in Navya-Nyāya Logic. Journal of Indian Philosophy 15 (2):149-154.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  18.  1
    Mohini Mullick (1976). Implication And Entailment In Navya-Nyaya Logic. Journal of Indian Philosophy 4 (September-December):127-134.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  19.  1
    Michael Clark, Alan Ross Anderson & Nuel D. Belnap (1978). Entailment. The Logic of Relevance and Necessity. Volume I. Philosophical Quarterly 28 (111):172.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  20.  3
    A. Beckermann, H. Flohr, J. Kim & S. Benhabib (1993). Allen, RT, The Education of Autonomous Man, Aldershot, Avebury, 1992, Vi, 82,£ 22.50 (Cloth). Anderson, AR Belnap, ND and Dunn, JM, Entailment: The Logic of Relevance and Necessity Vol II, Princeton, Princeton University Press, 1992, Xxvii, 749, US $75.00 (Cloth). [REVIEW] Australasian Journal of Philosophy 71 (2).
    Direct download  
     
    Export citation  
     
    My bibliography  
  21.  10
    Arthur Pap (1950). Logic and the Concept of Entailment. Journal of Philosophy 47 (13):378-387.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  22.  8
    Charles F. Kielkopf (1979). Wittgenstein,Aposteriori Necessity and Logic for Entailment. Philosophia 9 (1):63-74.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  23.  4
    Leo J. Elders (1997). Patterson, Richard. Aristotle's Modal Logic: Essence and Entailment in the Organon. Review of Metaphysics 50 (4):915-915.
  24.  1
    H. A. Lewis (1978). ENTAILMENT: The Logic of Relevance and Necessity (Volume I). Philosophical Books 19 (2):75-77.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  25. P. T. Geach (1977). Anderson, Alan Ross and Nuel D. Belnap Jr. "Entailment: The Logic of Relevance and Necessity". [REVIEW] Philosophy 52:493.
     
    Export citation  
     
    My bibliography  
  26. P. T. Geach (1977). Belnap, Nuel D. Jr. And Alan Ross Anderson "Entailment: The Logic of Relevance and Necessity". [REVIEW] Philosophy 52:(1977).
     
    Export citation  
     
    My bibliography  
  27. Richard Routley (1980). ANDERSON, A. R. & BELNAP, N. D., "Entailment: The Logic of Relevance and Necessity". [REVIEW] Australasian Journal of Philosophy 58:405.
    Direct download  
     
    Export citation  
     
    My bibliography  
  28.  35
    Donald Bamber (2000). Entailment with Near Surety of Scaled Assertions of High Conditional Probability. Journal of Philosophical Logic 29 (1):1-74.
    An assertion of high conditional probability or, more briefly, an HCP assertion is a statement of the type: The conditional probability of B given A is close to one. The goal of this paper is to construct logics of HCP assertions whose conclusions are highly likely to be correct rather than certain to be correct. Such logics would allow useful conclusions to be drawn when the premises are not strong enough to allow conclusions to be reached with certainty. This goal (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  29.  24
    Lou Goble (2003). Neighborhoods for Entailment. Journal of Philosophical Logic 32 (5):483-529.
    This paper presents a neighborhood semantics for logics of entailment. It begins with a minimal system Min that expresses the most fundamental assumptions about the entailment relation, and continues by examining various extensions that reflect further assumptions that might be made about entailment. This leads first to the logic B that is the basic relevant logic, and then to more powerful systems. All of these logics are proved to be sound and strongly complete. With B the neighborhood (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  30.  3
    Jiří Raclavský (2013). On the Interaction of Semantics and Deduction in Transparent Intensional Logic. Logic and Logical Philosophy 23 (1):57-68.
    It is sometimes objected that Tichý’s logic is not a logic because it underestimates deduction, providing only logical analyses of expressions. I argue that this opinion is wrong. First of all, to detect valid arguments, which are formulated in a language, there needs to be logical analysis to ascertain which semantical entities are involved. Entailment is defined as an extralinguistic affair relating those constructions. The validity of an argument, composed of propositional constructions, stems from the properties of the constructions. (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  31.  96
    Gonzalo Rodriguez-Pereyra (2006). Truthmaking, Entailment, and the Conjunction Thesis. Mind 115 (460):957-982.
    In this paper I undermine the Entailment Principle according to which if an entity is a truthmaker for a certain proposition and this proposition entails another, then the entity in question is a truthmaker for the latter proposition. I argue that the two most promising versions of the principle entail the popular but false Conjunction Thesis, namely that a truthmaker for a conjunction is a truthmaker for its conjuncts. One promising version of the principle understands entailment as strict (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   21 citations  
  32.  4
    Stefan Wintein (forthcoming). On All Strong Kleene Generalizations of Classical Logic. Studia Logica:1-43.
    By using the notions of exact truth and exact falsity, one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the Strong Kleene schema. Besides familiar logics such as Strong Kleene logic, the Logic of Paradox and First Degree Entailment, the resulting class of all Strong Kleene generalizations of classical logic also contains a host (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  33.  7
    Timothy R. Colburn (1991). Defeasible Reasoning and Logic Programming. Minds and Machines 1 (4):417-436.
    The general conditions of epistemic defeat are naturally represented through the interplay of two distinct kinds of entailment, deductive and defeasible. Many of the current approaches to modeling defeasible reasoning seek to define defeasible entailment via model-theoretic notions like truth and satisfiability, which, I argue, fails to capture this fundamental distinction between truthpreserving and justification-preserving entailments. I present an alternative account of defeasible entailment and show how logic programming offers a paradigm in which the distinction can be (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  34.  34
    Ross Thomas Brady (2010). Free Semantics. Journal of Philosophical Logic 39 (5):511 - 529.
    Free Semantics is based on normalized natural deduction for the weak relevant logic DW and its near neighbours. This is motivated by the fact that in the determination of validity in truth-functional semantics, natural deduction is normally used. Due to normalization, the logic is decidable and hence the semantics can also be used to construct counter-models for invalid formulae. The logic DW is motivated as an entailment logic just weaker than the logic MC of meaning containment. DW is the (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  35.  39
    Jan Dejnožka (2010). The Concept of Relevance and the Logic Diagram Tradition. Logica Universalis 4 (1):67-135.
    What is logical relevance? Anderson and Belnap say that the “modern classical tradition [,] stemming from Frege and Whitehead-Russell, gave no consideration whatsoever to the classical notion of relevance.” But just what is this classical notion? I argue that the relevance tradition is implicitly most deeply concerned with the containment of truth-grounds, less deeply with the containment of classes, and least of all with variable sharing in the Anderson–Belnap manner. Thus modern classical logicians such as Peirce, Frege, Russell, Wittgenstein, and (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  36.  25
    Joeri Engelfriet & Jan Treur (1998). An Interpretation of Default Logic in Minimal Temporal Epistemic Logic. Journal of Logic, Language and Information 7 (3):369-388.
    When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in this area is Reiter's Default Logic (1980). A characteristic of this formalism is that the applicability of default (inference) rules can only be verified in the future of the reasoning process. We describe an interpretation of default logic in temporal epistemic logic which makes this characteristic explicit. It is shown that this interpretation yields a (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  37. Pranab Kumar Sen (1980). Logic, Induction, and Ontology: Essays in Philosophical Analysis. Macmillan.
  38.  12
    Michael De & Hitoshi Omori (2015). Classical Negation and Expansions of Belnap–Dunn Logic. Studia Logica 103 (4):825-851.
    We investigate the notion of classical negation from a non-classical perspective. In particular, one aim is to determine what classical negation amounts to in a paracomplete and paraconsistent four-valued setting. We first give a general semantic characterization of classical negation and then consider an axiomatic expansion BD+ of four-valued Belnap–Dunn logic by classical negation. We show the expansion complete and maximal. Finally, we compare BD+ to some related systems found in the literature, specifically a four-valued modal logic of Béziau and (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  39.  42
    Yaroslav Shramko & Heinrich Wansing (2005). Some Useful 16-Valued Logics: How a Computer Network Should Think. [REVIEW] Journal of Philosophical Logic 34 (2):121 - 153.
    In Belnap's useful 4-valued logic, the set 2 = {T, F} of classical truth values is generalized to the set 4 = (2) = {Ø, {T}, {F}, {T, F}}. In the present paper, we argue in favor of extending this process to the set 16 = ᵍ (4) (and beyond). It turns out that this generalization is well-motivated and leads from the bilattice FOUR₂ with an information and a truth-and-falsity ordering to another algebraic structure, namely the trilattice SIXTEEN₃ with an (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   14 citations  
  40.  32
    Andreas Pietz & Umberto Rivieccio (2013). Nothing but the Truth. Journal of Philosophical Logic 42 (1):125-135.
    A curious feature of Belnap’s “useful four-valued logic”, also known as first-degree entailment (FDE), is that the overdetermined value B (both true and false) is treated as a designated value. Although there are good theoretical reasons for this, it seems prima facie more plausible to have only one of the four values designated, namely T (exactly true). This paper follows this route and investigates the resulting logic, which we call Exactly True Logic.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  41.  21
    Joseph Y. Halpern (1996). Should Knowledge Entail Belief? Journal of Philosophical Logic 25 (5):483 - 494.
    The appropriateness of S5 as a logic of knowledge has been attacked at some length in the philosophical literature. Here one particular attack based on the interplay between knowledge and belief is considered: Suppose that knowledge satisfies S5, belief satisfies KD45, and both the entailment property (knowledge implies belief) and positive certainty (if the agent believes something, she believes she knows it) hold. Then it can be shown that belief reduces to knowledge: it is impossible to have false beliefs. (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   11 citations  
  42.  14
    John Slaney & Edward Walker (2014). The One-Variable Fragment of T→. Journal of Philosophical Logic 43 (5):867-878.
    We show that there are infinitely many pairwise non-equivalent formulae in one propositional variable p in the pure implication fragment of the logic T of “ticket entailment” proposed by Anderson and Belnap. This answers a question posed by R. K. Meyer.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  43. Dmitry Zaitsev & Oleg Grigoriev (2010). Relevant Generalization Starts Here (and Here = 2). Logic and Logical Philosophy 19 (4):329-340.
    There is a productive and suggestive approach in philosophical logic based on the idea of generalized truth values. This idea, which stems essentially from the pioneering works by J.M. Dunn, N. Belnap, and which has recently been developed further by Y. Shramko and H. Wansing, is closely connected to the power-setting formation on the base of some initial truth values. Having a set of generalized truth values, one can introduce fundamental logical notions, more specifically, the ones of logical operations and (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  44.  3
    Guillermo Badia (forthcoming). A Lindström-Style Theorem for Finitary Propositional Weak Entailment Languages with Absurdity. Logic Journal of the IGPL.
    Following a result by De Rijke for modal logic, it is shown that the basic weak entailment model-theoretic language with absurdity is the maximal model-theoretic language having (i) the finite occurrence property, (ii) preservation under relevant directed bisimulations and (iii) the finite depth property. This can be seen as a generalized preservation theorem characterizing propositional weak entailment formulas among formulas of other model-theoretic languages.
    Direct download  
     
    Export citation  
     
    My bibliography  
  45.  2
    Guillermo Badia (forthcoming). A Lindström-Style Theorem for Finitary Propositional Weak Entailment Languages with Absurdity. Logic Journal of the IGPL.
    Following a result by De Rijke for modal logic, it is shown that the basic weak entailment model-theoretic language with absurdity is the maximal model-theoretic language having (i) the finite occurrence property, (ii) preservation under relevant directed bisimulations and (iii) the finite depth property. This can be seen as a generalized preservation theorem characterizing propositional weak entailment formulas among formulas of other model-theoretic languages.
    Direct download  
     
    Export citation  
     
    My bibliography  
  46.  4
    Katalin Bimbó & J. Michael Dunn (2013). On the Decidability of Implicational Ticket Entailment. Journal of Symbolic Logic 78 (1):214-236.
    The implicational fragment of the logic of relevant implication, $R_\to$ is known to be decidable. We show that the implicational fragment of the logic of ticket entailment, $T_\to$ is decidable. Our proof is based on the consecution calculus that we introduced specifically to solve this 50-year old open problem. We reduce the decidability problem of $T_\to$ to the decidability problem of $R_\to$. The decidability of $T_\to$ is equivalent to the decidability of the inhabitation problem of (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  47. Katalin Bimbó (2009). Dual Gaggle Semantics for Entailment. Notre Dame Journal of Formal Logic 50 (1):23-41.
    A sequent calculus for the positive fragment of entailment together with the Church constants is introduced here. The single cut rule is admissible in this consecution calculus. A topological dual gaggle semantics is developed for the logic. The category of the topological structures for the logic with frame morphisms is proven to be the dual category of the variety, that is defined by the equations of the algebra of the logic, with homomorphisms. The duality results are extended to the (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  48.  9
    Andreas Schöter (1996). Evidential Bilattice Logic and Lexical Inference. Journal of Logic, Language and Information 5 (1):65-105.
    This paper presents an information-based logic that is applied to the analysis of entailment, implicature and presupposition in natural language. The logic is very fine-grained and is able to make distinctions that are outside the scope of classical logic. It is independently motivated by certain properties of natural human reasoning, namely partiality, paraconsistency, relevance, and defeasibility: once these are accounted for, the data on implicature and presupposition comes quite naturally.The logic is based on the family of semantic (...) known as bilattices, originally proposed by Ginsberg (1988), and used extensively by Fitting (1989, 1992). Specifically, the logic is based on a subset of bilattices that I call evidential bilattices, constructed as the Cartesian product of certain algebras with themselves. The specific details of the epistemic agent approach of the logical system is derived from the work of Belnap (1975, 1977), augmented by the use of evidential links for inferencing. An important property of the system is that it has been implemented using an extension of Fitting's work on bilattice logic programming (1989, 1991) to build a model-based inference engine for the augmented Belnap logic. This theorem prover is very efficient for a reasonably wide range of inferences. (shrink)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  49.  21
    Dmitry Zaitsev (2009). A Few More Useful 8-Valued Logics for Reasoning with Tetralattice Eight. Studia Logica 92 (2):265 - 280.
    In their useful logic for a computer network Shramko and Wansing generalize initial values of Belnap’s 4-valued logic to the set 16 to be the power-set of Belnap’s 4. This generalization results in a very specific algebraic structure — the trilattice SIXTEEN 3 with three orderings: information, truth and falsity. In this paper, a slightly different way of generalization is presented. As a base for further generalization a set 3 is chosen, where initial values are a — incoming data is (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  50.  4
    Joanna Golinska-Pilarek & Emilio Munoz Velasco (2009). Relational Approach for a Logic for Order of Magnitude Qualitative Reasoning with Negligibility Non-Closeness and Distance. Logic Journal of the IGPL 17 (4):375–394.
    We present a relational proof system in the style of dual tableaux for a multimodal propositional logic for order of magnitude qualitative reasoning to deal with relations of negligibility, non-closeness, and distance. This logic enables us to introduce the operation of qualitative sum for some classes of numbers. A relational formalization of the modal logic in question is introduced in this paper, i.e., we show how to construct a relational logic associated with the logic for order-of-magnitude reasoning and its dual (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
1 — 50 / 309