101 found
Order:
Disambiguations
David Makinson [108]David C. Makinson [15]David Clement Makinson [2]
  1.  30
    Bridges from Classical to Nonmonotonic Logic.David Makinson - 2005 - London: King's College Publications.
    An graduate level introduction to nonmonotonic reasoning, emphasizing structures and spirit common to different formulations, with exercises.
    Direct download  
     
    Export citation  
     
    Bookmark   48 citations  
  2. On the logic of theory change: Contraction functions and their associated revision functions.Carlos E. Alchourron & David Makinson - 1982 - Theoria 48 (1):14-37.
    A study in the logic of theory change, examining the properties of maxichoice contraction and revision operations.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   109 citations  
  3.  89
    (1 other version)On the logic of theory change: Safe contraction.Carlos E. Alchourrón & David Makinson - 1985 - Studia Logica 44 (4):405 - 422.
    This paper is concerned with formal aspects of the logic of theory change, and in particular with the process of shrinking or contracting a theory to eliminate a proposition. It continues work in the area by the authors and Peter Gärdenfors. The paper defines a notion of safe contraction of a set of propositions, shows that it satisfies the Gärdenfors postulates for contraction and thus can be represented as a partial meet contraction, and studies its properties both in general and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   106 citations  
  4. General Patterns in Nonmonotonic Reasoning.David Makinson - 1994 - In Handbook of Logic in Artificial Intelligence Nad Logic Programming, Vol. Iii. Clarendon Press. pp. 35-110.
    An extended review of what is known about the formal behaviour of nonmonotonic inference operations, including those generated by the principal systems in the artificial intelligence literature. Directed towards computer scientists and others with some background in logic.
     
    Export citation  
     
    Bookmark   92 citations  
  5.  35
    Nonmonotonic inference based on expectations.Peter Gärdenfors & David Makinson - 1994 - Artificial Intelligence 65 (2):197-245.
  6.  52
    On the status of the postulate of recovery in the logic of theory change.David Makinson - 1987 - Journal of Philosophical Logic 16 (4):383 - 394.
    Describes and discusses the rather special behaviour of one of the postulates in the AGM account of theory change.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   72 citations  
  7. Bridges from Classical to Nonmonotonic Logic.David Makinson - 2008 - Studia Logica 89 (3):437-439.
     
    Export citation  
     
    Bookmark   56 citations  
  8.  70
    Hierarchies of regulations and their logic.Carlos E. Alchourrón & David Makinson - 1981 - In Risto Hilpinen (ed.), New Studies in Deontic Logic: Norms, Actions, and the Foundations of Ethics. Dordrecht, Netherland: Wiley-Blackwell. pp. 125--148.
    Investigates the resolution of contradictions and ambiguous derogations in a code, by means of the imposition of partial orderings.
    Direct download  
     
    Export citation  
     
    Bookmark   64 citations  
  9.  32
    Input/Output Logics.David Makinson & Leendert van der Torre - 2000 - Journal of Philosophical Logic 29 (4):383 - 408.
    In a range of contexts, one comes across processes resembling inference, but where input propositions are not in general included among outputs, and the operation is not in any way reversible. Examples arise in contexts of conditional obligations, goals, ideals, preferences, actions, and beliefs. Our purpose is to develop a theory of such input/output operations. Four are singled out: simple-minded, basic (making intelligent use of disjunctive inputs), simple-minded reusable (in which outputs may be recycled as inputs), and basic reusable. They (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   61 citations  
  10.  80
    Five faces of minimality.David Makinson - 1993 - Studia Logica 52 (3):339 - 379.
    We discuss similarities and residual differences, within the general semantic framework of minimality, between defeasible inference, belief revision, counterfactual conditionals, updating — and also conditional obligation in deontic logic. Our purpose is not to establish new results, but to bring together existing material to form a clear overall picture.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   56 citations  
  11.  72
    The Quantitative/Qualitative Watershed for Rules of Uncertain Inference.James Hawthorne & David Makinson - 2007 - Studia Logica 86 (2):247-297.
    We chart the ways in which closure properties of consequence relations for uncertain inference take on different forms according to whether the relations are generated in a quantitative or a qualitative manner. Among the main themes are: the identification of watershed conditions between probabilistically and qualitatively sound rules; failsafe and classicality transforms of qualitatively sound rules; non-Horn conditions satisfied by probabilistic consequence; representation and completeness problems; and threshold-sensitive conditions such as `preface' and `lottery' rules.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   45 citations  
  12.  40
    Relations between the logic of theory change and nonmonotonic logic.David Makinson & Peter Gärdenfors - 1991 - In Andre Fuhrmann & Michael Morreau (eds.), The Logic of Theory Change: Workshop, Konstanz, FRG, October 13-15, 1989, Proceedings. Springer. pp. 183--205.
    Examines the link between nonmonotonic inference relations and theory revision operations, focusing on the correspondence between abstract properties which each may satisfy.
    Direct download  
     
    Export citation  
     
    Bookmark   52 citations  
  13.  43
    Some embedding theorems for modal logic.David Makinson - 1971 - Notre Dame Journal of Formal Logic 12 (2):252-254.
    Some results on the upper end of the lattice of all modal propositional logics.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   52 citations  
  14.  67
    Screened Revision.David Makinson - 1997 - Theoria 63 (1-2):14-23.
    Develops a concept of revision, akin in spirit to AGM partial meet revision, but in which the postulate of 'success' may fail. The basic idea is to see such an operation as composite, with a pre-processor using a priori considerations to resolve the question of whether to revise, following which another operation revises in a manner that protects the a priori material.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   47 citations  
  15.  27
    Deontic Logic.David Makinson & Lennart Aqvist - 1989 - Journal of Symbolic Logic 54 (4):1481.
  16.  93
    Constraints for Input/Output Logics.David Makinson & Leendert van der Torre - 2001 - Journal of Philosophical Logic 30 (2):155 - 185.
    In a previous paper we developed a general theory of input/output logics. These are operations resembling inference, but where inputs need not be included among outputs, and outputs need not be reusable as inputs. In the present paper we study what happens when they are constrained to render output consistent with input. This is of interest for deontic logic, where it provides a manner of handling contrary-to-duty obligations. Our procedure is to constrain the set of generators of the input/output system, (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   44 citations  
  17.  80
    (1 other version)How to give it up: A survey of some formal aspects of the logic of theory change.David Makinson - 1985 - Synthese 62 (3):347 - 363.
    The paper surveys some recent work on formal aspects of the logic of theory change. It begins with a general discussion of the intuitive processes of contraction and revision of a theory, and of differing strategies for their formal study. Specific work is then described, notably Gärdenfors'' postulates for contraction and revision, maxichoice contraction and revision functions and the condition of orderliness, partial meet contraction and revision functions and the condition of relationality, and finally the operations of safe contraction and (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   43 citations  
  18. Conditional Probability in the Light of Qualitative Belief Change.David C. Makinson - 2011 - Journal of Philosophical Logic 40 (2):121 - 153.
    We explore ways in which purely qualitative belief change in the AGM tradition throws light on options in the treatment of conditional probability. First, by helping see why it can be useful to go beyond the ratio rule defining conditional from one-place probability. Second, by clarifying what is at stake in different ways of doing that. Third, by suggesting novel forms of conditional probability corresponding to familiar variants of qualitative belief change, and conversely. Likewise, we explain how recent work on (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  19.  68
    On the formal representation of rights relations.David Makinson - 1986 - Journal of Philosophical Logic 15 (4):403 - 425.
    A discussion of work formalising Hohfeld's classic taxonomy of rights relations between two parties.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   31 citations  
  20.  72
    Permission from an Input/Output Perspective.David Makinson & Leendert van der Torre - 2003 - Journal of Philosophical Logic 32 (4):391 - 416.
    Input/output logics are abstract structures designed to represent conditional obligations and goals. In this paper we use them to study conditional permission. This perspective provides a clear separation of the familiar notion of negative permission from the more elusive one of positive permission. Moreover, it reveals that there are at least two kinds of positive permission. Although indistinguishable in the unconditional case, they are quite different in conditional contexts. One of them, which we call static positive permission, guides the citizen (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  21.  20
    Floating conclusions and zombie paths: Two deep difficulties in the “directly skeptical” approach to defeasible inheritance nets.David Makinson & Karl Schlechta - 1991 - Artificial Intelligence 48 (2):199-209.
  22. (1 other version)A normal modal calculus between T and s4 without the finite model property.David Makinson - 1969 - Journal of Symbolic Logic 34 (1):35-38.
    The first example of an intuitively meaningful propositional logic without the finite model property, and still the simplest one in the literature. The question of its decidability appears still to be open.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  23.  33
    Bridges between Classical and Nonmonotonic Logic.David Makinson - 2003 - Logic Journal of the IGPL 11 (1):69-96.
    The purpose of this paper is to take some of the mystery out of what is known as nonmonotonic logic, by showing that it is not as unfamiliar as may at first sight appear. In fact, it is easily accessible to anybody with a background in classical propositional logic, provided that certain misunderstandings are avoided and a tenacious habit is put aside. In effect, there are logics that act as natural bridges between classical consequence and the principal kinds of nonmonotonic (...)
    Direct download  
     
    Export citation  
     
    Bookmark   20 citations  
  24.  93
    Maps between some different kinds of contraction function: The finite case.Carlos E. Alchourrón & David Makinson - 1986 - Studia Logica 45 (2):187 - 198.
    In some recent papers, the authors and Peter Gärdenfors have defined and studied two different kinds of formal operation, conceived as possible representations of the intuitive process of contracting a theory to eliminate a proposition. These are partial meet contraction (including as limiting cases full meet contraction and maxichoice contraction) and safe contraction. It is known, via the representation theorem for the former, that every safe contraction operation over a theory is a partial meet contraction over that theory. The purpose (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  25.  62
    Parallel interpolation, splitting, and relevance in belief change.George Kourousias & David Makinson - 2007 - Journal of Symbolic Logic 72 (3):994-1002.
    The splitting theorem says that any set of formulae has a finest representation as a family of letter-disjoint sets. Parikh formulated this for classical propositional logic, proved it in the finite case, used it to formulate a criterion for relevance in belief change, and showed that AGMpartial meet revision can fail the criterion. In this paper we make three further contributions. We begin by establishing a new version of the well-known interpolation theorem, which we call parallel interpolation, use it to (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  26.  30
    Propositional relevance through letter-sharing.David Makinson - 2009 - Journal of Applied Logic 7 (4):377-387.
    The concept of relevance between classical propositional formulae, defined in terms of letter-sharing, has been around for a long time. But it began to take on a fresh life in the late 1990s when it was reconsidered in the context of the logic of belief change. Two new ideas appeared in independent work of Odinaldo Rodrigues and Rohit Parikh: the relation of relevance was considered modulo the choice of a background belief set, and the belief set was put into a (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  27.  9
    (2 other versions)Doing the Best We Can. An Essay in Informal Deontic Logic.David Makinson - 1987 - Journal of Symbolic Logic 52 (4):1050-1051.
    Direct download  
     
    Export citation  
     
    Bookmark   14 citations  
  28.  53
    A warning about the choice of primitive operators in modal logic.David Makinson - 1973 - Journal of Philosophical Logic 2 (2):193 - 196.
    Draws attention to some unexpected consequences of using a zero-ary connective in modal propositional logic.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  29.  25
    First-Order Friendliness.Guillermo Badia & David Makinson - forthcoming - Review of Symbolic Logic:1-15.
    In this note we study a counterpart in predicate logic of the notion of logical friendliness, introduced into propositional logic in [15]. The result is a new consequence relation for predicate languages with equality using first-order models. While compactness, interpolation and axiomatizability fail dramatically, several other properties are preserved from the propositional case. Divergence is diminished when the language does not contain equality with its standard interpretation.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  30.  12
    Relevance-Sensitive Truth-Trees.David Makinson - 2021 - In Ivo Düntsch & Edwin Mares (eds.), Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs. Springer Verlag. pp. 23-65.
    Our goal is to articulate a clear rationale for relevance-sensitive propositional logic. The method: truth-trees. Familiar decomposition rules for truth-functional connectives, accompanied by novel ones for the for the arrow, together with a recursive rule, generate a set of ‘acceptable’ formulae that properly contains all theorems of the well-known system R and is closed under substitution, conjunction, and detachment. We conjecture that it satisfies the crucial letter-sharing condition.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  31.  65
    On an inferential semantics for classical logic.David C. Makinson - 2014 - Logic Journal of the IGPL 22 (1):147-154.
    We seek a better understanding of why an inferential semantics devised by Tor Sandqvist yields full classical logic, by providing and analysing a direct proof via a suitable maximality construction.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  32. Logical questions behind the lottery and preface paradoxes: lossy rules for uncertain inference.David Makinson - 2012 - Synthese 186 (2):511-529.
    We reflect on lessons that the lottery and preface paradoxes provide for the logic of uncertain inference. One of these lessons is the unreliability of the rule of conjunction of conclusions in such contexts, whether the inferences are probabilistic or qualitative; this leads us to an examination of consequence relations without that rule, the study of other rules that may nevertheless be satisfied in its absence, and a partial rehabilitation of conjunction as a ‘lossy’ rule. A second lesson is the (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  33. Handbook of Logic in Artificial Intelligence Nad Logic Programming, Vol. Iii.David Makinson - 1994 - Clarendon Press.
  34.  51
    A generalisation of the concept of a relational model for modal logic.David Makinson - 1970 - Theoria 36 (3):331-335.
    Generalises the concept of a relational model for modal logic, due to Kripke, so as to obtain a closer correspondence between relational and algebraic models. The generalisation obtained is essentially equivalent to the notion of a "first-order" model that was defined independently by S.K.Thomason.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  35.  52
    The gärdenfors impossibility theorem in non-monotonic contexts.David Makinson - 1990 - Studia Logica 49 (1):1 - 6.
    Gärdenfors' impossibility theorem draws attention to certain formal difficulties in defining a conditional connective from a notion of theory revision, via the Ramsey test. We show that these difficulties are not avoided by taking the background inference operation to be non-monotonic.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  36.  44
    How meaningful are modal operators?David Makinson - 1966 - Australasian Journal of Philosophy 44 (3):331 – 337.
    A philosophical discussion of the intuitive meaning of the formalism of modal propositional logics.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  37.  45
    (3 other versions)The Logic of Inconsistency. A Study in Non-Standard Possible-World Semantics and Ontology.David Makinson - 1979 - Journal of Symbolic Logic 47 (1):233-236.
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  38. Intuitionistic Logic and Elementary Rules.Lloyd Humberstone & David Makinson - 2011 - Mind 120 (480):1035-1051.
    The interplay of introduction and elimination rules for propositional connectives is often seen as suggesting a distinguished role for intuitionistic logic. We prove three formal results concerning intuitionistic propositional logic that bear on that perspective, and discuss their significance. First, for a range of connectives including both negation and the falsum, there are no classically or intuitionistically correct introduction rules. Second, irrespective of the choice of negation or the falsum as a primitive connective, classical and intuitionistic consequence satisfy exactly the (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  39. In memoriam carlos eduardo alchourron.David Makinson - 1996 - Nordic Journal of Philosophical Logic 1 (1):3-10.
    Obituary notice with overview of the work of Carlos Alchourrón, focussing on his contributions to the logic of theory change.
     
    Export citation  
     
    Bookmark   6 citations  
  40.  55
    Post Completeness and Ultrafilters.David Makinson & Krister Segerberg - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (25-27):385-388.
    A cardinality result in modal propositional logic.
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  41.  54
    (1 other version)Remarks on the concept of distribution in traditional logic.David Makinson - 1969 - Noûs 3 (1):103-108.
    Uses ideas of mathematical logic to clarify and to a certain extent defend a controverted and rather obscure notion of traditional syllogistic.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  42.  54
    Stenius' approach to disjunctive permission.David Makinson - 1984 - Theoria 50 (2-3):138-147.
    A critical review of Stenius' account of the logic of disjunctive permissions, leading to a proposal for a closely related approach in terms of "checklist conditionals".
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  43.  31
    Relevance via decomposition.David Makinson - 2017 - Australasian Journal of Logic 14 (3).
    We report on progress and an unsolved problem in our attempt to obtain a clear rationale for relevance logic via semantic decomposition trees. Suitable decomposition rules, constrained by a natural parity condition, generate a set of directly acceptable formulae that contains all axioms of the well-known system R, is closed under substitution and conjunction, satisfies the letter-sharing condition, but is not closed under detachment. To extend it, a natural recursion is built into the procedure for constructing decomposition trees. The resulting (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  44.  20
    A Guide to Ivan Orlov's "The calculus of the compatibility of propositions".David Makinson & Werner Stelzner - 2024 - Australasian Journal of Logic 21 (1):1-19.
    Ivan Efimovič Orlov’s paper “The calculus of the compatibility of propositions”, published in Russian in 1928, is fascinating for anyone interested in the early history of relevance, modal or intuitionistic logic. This is a guide that outlines Orlov's life and work, analyses the content of the paper, and relates it to work of his contemporaries and successors.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45.  10
    Topics in modern logic.David Makinson - 1973 - London,: Methuen; distributed by Harper & Row Publishers, inc., Barnes and Noble Import Division.
  46.  35
    Friendliness for logicians.David C. Makinson - 2005 - In Sergei Artemov, H. Barringer, A. S. D'Avila Garcez, L. C. Lamb & J. Woods (eds.), We Will Show Them! Essays in Honour of Dov Gabbay. London, U.K.: College Publications. pp. 259-292.
    We define and examine a notion of logical friendliness, which is a broadening of the familiar notion of classical consequence. The concept is studied first in its simplest form, and then in a syntax-independent version, which we call sympathy. We also draw attention to the surprising number of familiar notions and operations with which it makes contact, providing a new light in which they may be seen.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  47.  35
    Local and global metrics for the semantics of counterfactual conditionals.Karl Schlechta & David Makinson - 1994 - Journal of Applied Non-Classical Logics 4 (2):129-140.
    No aConsiders the question of how far the different ‘closeness’ relations, indexed by worlds, in a given model for counterfactual conditionals may be derived from a common source. Counterbalancing some well-known negative observations, we show that there is also a strong positive answer.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  48.  27
    (1 other version)Intelim rules for classical connectives.David C. Makinson - 2013 - In Sven Ove Hansson (ed.), David Makinson on Classical Methods for Non-Classical Problems. Dordrecht, Netherland: Springer. pp. 359-382.
    We investigate introduction and elimination rules for truth-functional connectives, focusing on the general questions of the existence, for a given connective, of at least one such rule that it satisfies, and the uniqueness of a connective with respect to the set of all of them. The answers are straightforward in the context of rules using general set/set sequents of formulae, but rather complex and asymmetric in the restricted (but more often used) context of set/formula sequents, as also in the intermediate (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  49.  73
    Respecting relevance in belief change.David C. Makinson & George Kourousias - 2006 - Análisis Filosófico 26 (1):53-61.
    In this paper dedicated to Carlos Alchourrón, we review an issue that emerged only after his death in 1996, but would have been of great interest to him: To what extent do the formal operations of AGM belief change respect criteria of relevance? A natural criterion was proposed in 1999 by Rohit Parikh, who observed that the AGM model does not always respect it. We discuss the pros and cons of this criterion, and explain how the AGM account may be (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  50.  40
    Friendliness and sympathy in logic.David C. Makinson - 2005 - In Jean-Yves Béziau (ed.), Logica Universalis: Towards a General Theory of Logic. Boston: Birkhäuser Verlog. pp. 191-206.
    We define and examine a notion of logical friendliness, which is a broadening of the familiar notion of classical consequence. The concept is tudied first in its simplest form, and then in a syntax-independent version, which we call sympathy. We also draw attention to the surprising number of familiar notions and operations with which it makes contact, providing a new light in which they may be seen.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 101