188 found
Order:
Disambiguations
Dov M. Gabbay [123]Dov Gabbay [68]Dovm Gabbay [2]
See also
Dov Gabbay
Hebrew University of Jerusalem
  1.  58
    Many-Dimensional Modal Logics: Theory and Applications.Dov M. Gabbay (ed.) - 2003 - Elsevier North Holland.
    Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a many-dimensional system, say, to reason about knowledge bases developing in time or moving objects. To study (...)
    Direct download  
     
    Export citation  
     
    Bookmark   35 citations  
  2.  50
    Labelled Deductive Systems.Dov M. Gabbay - 1996 - Oxford University Press.
    This important book provides a new unifying methodology for logic. It replaces the traditional view of logic as manipulating sets of formulas with the notion of structured families of labelled formulas with algebraic structures. This approach has far reaching consequences for the methodology of logics and their semantics, and the book studies the main features of such systems along with their applications. It will interest logicians, computer scientists, philosophers and linguists.
    Direct download  
     
    Export citation  
     
    Bookmark   37 citations  
  3. A Logical Account of Formal Argumentation.Martin W. A. Caminada & Dov M. Gabbay - 2009 - Studia Logica 93 (2-3):109-145.
    In the current paper, we re-examine how abstract argumentation can be formulated in terms of labellings, and how the resulting theory can be applied in the field of modal logic. In particular, we are able to express the extensions of an argumentation framework as models of a set of modal logic formulas that represents the argumentation framework. Using this approach, it becomes possible to define the grounded extension in terms of modal logic entailment.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   35 citations  
  4. Temporal Logic Mathematical Foundations and Computational Aspects.Dov M. Gabbay, Ian Hodkinson & Mark Reynolds - 1994
     
    Export citation  
     
    Bookmark   27 citations  
  5.  19
    Semantical Investigations in Heyting's Intuitionistic Logic.Dov M. Gabbay - 1986 - Journal of Symbolic Logic 51 (3):824-824.
  6.  65
    An Irreflexivity Lemma with Applications to Axiomatizations of Conditions on Tense Frames.Dov M. Gabbay - 1981 - In U. Mönnich (ed.), Aspects of Philosophical Logic. Dordrecht. pp. 67--89.
    Direct download  
     
    Export citation  
     
    Bookmark   37 citations  
  7.  84
    Adding a Temporal Dimension to a Logic System.Marcelo Finger & Dov M. Gabbay - 1992 - Journal of Logic, Language and Information 1 (3):203-233.
    We introduce a methodology whereby an arbitrary logic system L can be enriched with temporal features to create a new system T(L). The new system is constructed by combining L with a pure propositional temporal logic T (such as linear temporal logic with Since and Until) in a special way. We refer to this method as adding a temporal dimension to L or just temporalising L. We show that the logic system T(L) preserves several properties of the original temporal logic (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  8.  47
    Fibring Argumentation Frames.Dov M. Gabbay - 2009 - Studia Logica 93 (2):231-295.
    This paper is part of a research program centered around argumentation networks and offering several research directions for argumentation networks, with a view of using such networks for integrating logics and network reasoning. In Section 1 we introduce our program manifesto. In Section 2 we motivate and show how to substitute one argumentation network as a node in another argumentation network. Substitution is a purely logical operation and doing it for networks, besides developing their theory further, also helps us see (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  9. Advice on Abductive Logic.Dov Gabbay & John Woods - 2006 - Logic Journal of the IGPL 14 (2):189-219.
    One of our purposes here is to expose something of the elementary logical structure of abductive reasoning, and to do so in a way that helps orient theorists to the various tasks that a logic of abduction should concern itself with. We are mindful of criticisms that have been levelled against the very idea of a logic of abduction; so we think it prudent to proceed with a certain diffidence. That our own account of abduction is itself abductive is methodological (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  10.  49
    Logical Modes of Attack in Argumentation Networks.Dov M. Gabbay & Artur S. D’Avila Garcez - 2009 - Studia Logica 93 (2-3):199-230.
    This paper studies methodologically robust options for giving logical contents to nodes in abstract argumentation networks. It defines a variety of notions of attack in terms of the logical contents of the nodes in a network. General properties of logics are refined both in the object level and in the metalevel to suit the needs of the application. The network-based system improves upon some of the attempts in the literature to define attacks in terms of defeasible proofs, the so-called rule-based (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  11.  57
    Handbook of Philosophical Logic.Dov M. Gabbay & Franz Guenthner (eds.) - 1989 - Kluwer Academic Publishers.
    The first edition of the Handbook of Philosophical Logic (four volumes) was published in the period 1983-1989 and has proven to be an invaluable reference work ...
    Direct download  
     
    Export citation  
     
    Bookmark   15 citations  
  12. Analysis of the Talmudic Argumentum A Fortiori Inference Rule Using Matrix Abduction.M. Abraham, Dov M. Gabbay & U. Schild - 2009 - Studia Logica 92 (3):281-364.
    We motivate and introduce a new method of abduction, Matrix Abduction, and apply it to modelling the use of non-deductive inferences in the Talmud such as Analogy and the rule of Argumentum A Fortiori. Given a matrix with entries in {0,1}, we allow for one or more blank squares in the matrix, say $a_{i,j} =?.$ The method allows us to decide whether to declare $a_{i,j} = 0$ or $a_{i,j} = 1$ or $a_{i,j} =?$ undecided. This algorithmic method is then applied (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  13.  42
    Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming.Yining Wu, Martin Caminada & Dov M. Gabbay - 2009 - Studia Logica 93 (2):383-403.
    In this paper, we prove the correspondence between complete extensions in abstract argumentation and 3-valued stable models in logic programming. This result is in line with earlier work of [6] that identified the correspondence between the grounded extension in abstract argumentation and the well-founded model in logic programming, as well as between the stable extensions in abstract argumentation and the stable models in logic programming.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  14.  67
    Semantics for Higher Level Attacks in Extended Argumentation Frames Part 1: Overview.Dov M. Gabbay - 2009 - Studia Logica 93 (2-3):357 - 381.
    In 2005 the author introduced networks which allow attacks on attacks of any level. So if a → b reads a attacks 6, then this attack can itself be attacked by another node c. This attack itself can attack another node d. This situation can be iterated to any level with attacks and nodes attacking other attacks and other nodes. In this paper we provide semantics (of extensions) to such networks. We offer three different approaches to obtaining semantics. 1. The (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  15.  13
    Investigations in Modal and Tense Logics with Application to Problems in Philosophy and Linguistics.Dov M. Gabbay - 1979 - Journal of Symbolic Logic 44 (4):656-657.
  16. Roadmap for Preferential Logics.Dov M. Gabbay & Karl Schlechta - 2009 - Journal of Applied Non-Classical Logics 19 (1):43-95.
    We give a systematic overview of semantical and logical rules in non monotonic and related logics. We show connections and sometimes subtle differences, and also compare such rules to uses of the notion of size.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  17.  22
    Fibring Logics.Dov M. Gabbay - 1999 - Clarendon Press.
    Modern applications of logic in mathematics, computer science, and linguistics use combined systems of different types of logic working together. This book develops a method for combining--or fibring--systems by breaking them into simple components which can be manipulated easily and recombined.
    Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  18.  38
    Modal Provability Foundations for Argumentation Networks.Dov M. Gabbay - 2009 - Studia Logica 93 (2):181-198.
    Given an argumentation network we associate with it a modal formula representing the 'logical content' of the network. We show a one-to-one correspondence between all possible complete Caminada labellings of the network and all possible models of the formula.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  19.  22
    Model Theory for Tense Logics.Dov M. Gabbay - 1975 - Annals of Mathematical Logic 8 (1):185.
  20.  67
    A General Theory of the Conditional in Terms of a Ternary Operator.Dov M. Gabbay - 1972 - Theoria 38 (3):97-104.
  21.  40
    Handbook of the Logic of Argument and Inference: The Turn Towards the Practical.Dov M. Gabbay (ed.) - 2002 - Elsevier.
    The Handbook of the Logic of Argument and Inference is an authoritative reference work in a single volume, designed for the attention of senior undergraduates, graduate students and researchers in all the leading research areas concerned with the logic of practical argument and inference. After an introductory chapter, the role of standard logics is surveyed in two chapters. These chapters can serve as a mini-course for interested readers, in deductive and inductive logic, or as a refresher. Then follow two chapters (...)
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  22.  24
    Expressive Functional Completeness in Tense Logic (Preliminary Report).Dov M. Gabbay - 1981 - In U. Mönnich (ed.), Aspects of Philosophical Logic. Dordrecht. pp. 91--117.
  23.  11
    Normality, Non-contamination and Logical Depth in Classical Natural Deduction.Marcello D’Agostino, Dov Gabbay & Sanjay Modgil - 2020 - Studia Logica 108 (2):291-357.
    In this paper we provide a detailed proof-theoretical analysis of a natural deduction system for classical propositional logic that represents classical proofs in a more natural way than standard Gentzen-style natural deduction, admits of a simple normalization procedure such that normal proofs enjoy the Weak Subformula Property, provides the means to prove a Non-contamination Property of normal proofs that is not satisfied by normal proofs in the Gentzen tradition and is useful for applications, especially in formal argumentation, naturally leads to (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  24.  78
    Combining Temporal Logic Systems.Marcelo Finger & Dov Gabbay - 1996 - Notre Dame Journal of Formal Logic 37 (2):204-232.
    This paper investigates modular combinations of temporal logic systems. Four combination methods are described and studied with respect to the transfer of logical properties from the component one-dimensional temporal logics to the resulting combined two-dimensional temporal logic. Three basic logical properties are analyzed, namely soundness, completeness, and decidability. Each combination method comprises three submethods that combine the languages, the inference systems, and the semantics of two one-dimensional temporal logic systems, generating families of two-dimensional temporal languages with varying expressivity and varying (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  25.  21
    The Talmudic Logic Project, Ongoing Since 2008.Dov M. Gabbay, Uri Schild & Esther David - 2019 - Logica Universalis 13 (4):425-442.
    We describe the state of the Talmudic Logic project as of end of 2019. The Talmud is the most comprehensive and fundamental work of Jewish religious law, employing a large number of logical components centuries ahead of their time. In many cases the basic principles are not explicitly formulated, which makes it difficult to formalize and make available to the modern student of Logic. This project on Talmudic Logic, aims to present logical analysis of Talmudic reasoning using modern logical tools. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26.  53
    Resource-Origins of Nonmonotonicity.Dov Gabbay & John Woods - 2008 - Studia Logica 88 (1):85-112.
    Formal nonmonotonic systems try to model the phenomenon that common sense reasoners are able to “jump” in their reasoning from assumptions Δ to conclusions C without their being any deductive chain from Δ to C. Such jumps are done by various mechanisms which are strongly dependent on context and knowledge of how the actual world functions. Our aim is to motivate these jump rules as inference rules designed to optimise survival in an environment with scant resources of effort and time. (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  27.  48
    Meta-Argumentation Modelling I: Methodology and Techniques.Guido Boella, Dov M. Gabbay, Leendert van der Torre & Serena Villata - 2009 - Studia Logica 93 (2-3):297 - 355.
    In this paper, we introduce the methodology and techniques of metaargumentation to model argumentation. The methodology of meta-argumentation instantiates Dung's abstract argumentation theory with an extended argumentation theory, and is thus based on a combination of the methodology of instantiating abstract arguments, and the methodology of extending Dung's basic argumentation frameworks with other relations among abstract arguments. The technique of meta-argumentation applies Dung's theory of abstract argumentation to itself, by instantiating Dung's abstract arguments with meta-arguments using a technique called flattening. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  28.  19
    Semantics for Higher Level Attacks in Extended Argumentation Frames Part 1: Overview.Dov M. Gabbay - 2009 - Studia Logica 93 (2-3):357-381.
    In 2005 the author introduced networks which allow attacks on attacks of any level. So if a → b reads a attacks 6, then this attack can itself be attacked by another node c. This attack itself can attack another node d. This situation can be iterated to any level with attacks and nodes attacking other attacks and other nodes. In this paper we provide semantics to such networks. We offer three different approaches to obtaining semantics. 1. The translation approach (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  29.  24
    Applications of Trees to Intermediate Logics.Dov M. Gabbay - 1972 - Journal of Symbolic Logic 37 (1):135-138.
  30.  52
    Belief Revision in Non-Classical Logics.Dov Gabbay, Odinaldo Rodrigues & Alessandra Russo - 2008 - Review of Symbolic Logic 1 (3):267-304.
    In this article, we propose a belief revision approach for families of (non-classical) logics whose semantics are first-order axiomatisable. Given any such (non-classical) logic , the approach enables the definition of belief revision operators for , in terms of a belief revision operation satisfying the postulates for revision theory proposed by Alchourrrdenfors and Makinson (AGM revision, Alchourrukasiewicz's many-valued logic. In addition, we present a general methodology to translate algebraic logics into classical logic. For the examples provided, we analyse in what (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  31.  38
    Philosophy of Economics.Uskali Mäki, Dov M. Gabbay, Paul Thagard & John Woods (eds.) - 2012 - North Holland.
    This volume serves as a detailed introduction for those new to the field as well as a rich source of new insights and potential research agendas for those already engaged with the philosophy of economics.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  32.  28
    Normative Models of Rational Agency: The Theoretical Disutility of Certain Approaches.Dov Gabbay & John Woods - 2003 - Logic Journal of the IGPL 11 (6):597-613.
    Much of cognitive science seeks to provide principled descriptions of various kinds and aspects of rational behaviour, especially in beings like us or AI simulacra of beings like us. For the most part, these investigators presuppose an unarticulated common sense appreciation of the rationality that such behaviour consists in. On those occasions when they undertake to bring the relevant norms to the surface and to give an account of that to which they owe their legitimacy, these investigators tend to favour (...)
    Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  33.  57
    Reactive Preferential Structures and Nonmonotonic Consequence.Dov M. Gabbay & Karl Schlechta - 2009 - Review of Symbolic Logic 2 (2):414-450.
    We introduce Information Bearing Relation Systems (IBRS) as an abstraction of many logical systems. These are networks with arrows recursively leading to other arrows etc. We then define a general semantics for IBRS, and show that a special case of IBRS generalizes in a very natural way preferential semantics and solves open representation problems for weak logical systems. This is possible, as we can the strong coherence properties of preferential structures by higher arrows, that is, arrows, which do not go (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  34.  13
    The Decidability of the Kreisel-Putnam System.Dov M. Gabbay - 1970 - Journal of Symbolic Logic 35 (3):431-437.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  35.  33
    Montague Type Semantics for Modal Logics with Propositional Quantifiers.Dov M. Gabbay - 1971 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 17 (1):245-249.
  36.  55
    What is a Logical System?Dov M. Gabbay (ed.) - 1994 - Oxford University Press.
    This superb collection of papers focuses on a fundamental question in logic and computation: What is a logical system? With contributions from leading researchers--including Ian Hacking, Robert Kowalski, Jim Lambek, Neil Tennent, Arnon Avron, L. Farinas del Cerro, Kosta Dosen, and Solomon Feferman--the book presents a wide range of views on how to answer such a question, reflecting current, mainstream approaches to logic and its applications. Written to appeal to a diverse audience of readers, What is a Logical System? will (...)
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  37.  11
    A Practical Logic of Cognitive Systems.Dov M. Gabbay - 2003 - North Holland.
    Agenda Relevance is the first volume in the authors' omnibus investigation of the logic of practical reasoning, under the collective title, A Practical Logic of Cognitive Systems. In this highly original approach, practical reasoning is identified as reasoning performed with comparatively few cognitive assets, including resources such as information, time and computational capacity. Unlike what is proposed in optimization models of human cognition, a practical reasoner lacks perfect information, boundless time and unconstrained access to computational complexity. The practical reasoner is (...)
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  38.  5
    Meta-Argumentation Modelling I: Methodology and Techniques.Guido Boella, Dov Gabbay, Leendert Torre & Serena Villata - 2009 - Studia Logica 93 (2):297-355.
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  39.  45
    Modal Logics of Reactive Frames.Dov M. Gabbay & Sérgio Marcelino - 2009 - Studia Logica 93 (2):405-446.
    A reactive graph generalizes the concept of a graph by making it dynamic, in the sense that the arrows coming out from a point depend on how we got there. This idea was first applied to Kripke semantics of modal logic in [2]. In this paper we strengthen that unimodal language by adding a second operator. One operator corresponds to the dynamics relation and the other one relates paths with the same endpoint. We explore the expressivity of this interpretation by (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  40.  44
    Non-Cooperation in Dialogue Logic.Dov Gabbay & John Woods - 2001 - Synthese 127 (1-2):161 - 186.
  41.  24
    On Some New Intuitionistic Propositional Connectives. I.Dov M. Gabbay - 1977 - Studia Logica 36 (1-2):127 - 139.
  42.  63
    Cut and Pay.Marcelo Finger & Dov Gabbay - 2006 - Journal of Logic, Language and Information 15 (3):195-218.
    In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce three families of parameterised logics that arise from different ways of controlling the use of cut. We start with a formulation of classical logic in which cut is non-eliminable and then impose restrictions on the use of cut. Three Cut-and-Pay families of logics are presented, and it is shown that each family provides an (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  43.  8
    Embedding and Automating Conditional Logics in Classical Higher-Order Logic.Christoph Benzmüller, Dov Gabbay, Valerio Genovese & Daniele Rispoli - 2012 - Annals of Mathematics and Artificial Intelligence 66 (1-4):257-271.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  44.  23
    Dung’s Argumentation is Essentially Equivalent to Classical Propositional Logic with the Peirce–Quine Dagger.Dov M. Gabbay - 2011 - Logica Universalis 5 (2):255-318.
    In this paper we show that some versions of Dung’s abstract argumentation frames are equivalent to classical propositional logic. In fact, Dung’s attack relation is none other than the generalised Peirce–Quine dagger connective of classical logic which can generate the other connectives ${\neg, \wedge, \vee, \to}$ of classical logic. After establishing the above correspondence we offer variations of the Dung argumentation frames in parallel to variations of classical logic, such as resource logics, predicate logic, etc., etc., and create resource argumentation (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  45.  9
    Goal-Directed Proof Theory.Dov M. Gabbay - 2000 - Kluwer Academic.
    Goal Directed Proof Theory presents a uniform and coherent methodology for automated deduction in non-classical logics, the relevance of which to computer science is now widely acknowledged. The methodology is based on goal-directed provability. It is a generalization of the logic programming style of deduction, and it is particularly favourable for proof search. The methodology is applied for the first time in a uniform way to a wide range of non-classical systems, covering intuitionistic, intermediate, modal and substructural logics. The book (...)
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  46.  8
    Decidability Results in Non-Classical Logics. Part I.Dov M. Gabbay - 1975 - Annals of Mathematical Logic 8 (3):237.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  47.  35
    Fibred Security Language.Guido Boella, Dov M. Gabbay, Valerio Genovese & Leendert van der Torre - 2009 - Studia Logica 92 (3):395-436.
    We study access control policies based on the says operator by introducing a logical framework called Fibred Security Language (FSL) which is able to deal with features like joint responsibility between sets of principals and to identify them by means of first-order formulas. FSL is based on a multimodal logic methodology. We first discuss the main contributions from the expressiveness point of view, we give semantics for the language both for classical and intuitionistic fragment), we then prove that in order (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  48.  26
    Annotation Theories Over Finite Graphs.Dov M. Gabbay & Andrzej Szałas - 2009 - Studia Logica 93 (2):147-180.
    In the current paper we consider theories with vocabulary containing a number of binary and unary relation symbols. Binary relation symbols represent labeled edges of a graph and unary relations represent unique annotations of the graph's nodes. Such theories, which we call annotation theories^ can be used in many applications, including the formalization of argumentation, approximate reasoning, semantics of logic programs, graph coloring, etc. We address a number of problems related to annotation theories over finite models, including satisfiability, querying problem, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  49.  27
    Sufficient Conditions for the Undecidability of Intuitionistic Theories with Applications.Dov M. Gabbay - 1972 - Journal of Symbolic Logic 37 (2):375-384.
  50.  16
    Non-Cooperation In Dialogue Logic.Dov Gabbay & John Woods - 2001 - Synthese 127 (1):161-186.
1 — 50 / 188