Results for 'partial meet contraction'

998 found
Order:
  1. On the Logic of Theory Change: Partial Meet Contraction and Revision Functions.Carlos E. Alchourrón, Peter Gärdenfors & David Makinson - 1985 - Journal of Symbolic Logic 50 (2):510-530.
    This paper extends earlier work by its authors on formal aspects of the processes of contracting a theory to eliminate a proposition and revising a theory to introduce a proposition. In the course of the earlier work, Gardenfors developed general postulates of a more or less equational nature for such processes, whilst Alchourron and Makinson studied the particular case of contraction functions that are maximal, in the sense of yielding a maximal subset of the theory (or alternatively, of one (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   526 citations  
  2.  28
    Possible Worlds Semantics for Partial Meet Multiple Contraction.Maurício D. L. Reis & Eduardo Fermé - 2012 - Journal of Philosophical Logic 41 (1):7-28.
    In the logic of theory change, the standard model is AGM, proposed by Alchourrón et al. (J Symb Log 50:510–530, 1985 ). This paper focuses on the extension of AGM that accounts for contractions of a theory by a set of sentences instead of only by a single sentence. Hansson (Theoria 55:114–132, 1989 ), Fuhrmann and Hansson (J Logic Lang Inf 3:39–74, 1994 ) generalized Partial Meet Contraction to the case of contractions by (possibly non-singleton) sets of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  3.  34
    A Note on Partial Meet Package Contraction.Jun Li - 1998 - Journal of Logic, Language and Information 7 (2):139-142.
    It was shown that finite P-recovery holds for partial meet package contraction in Furhmann and Hansson (1994). However, it is not known if recovery holds for partial meet package contraction in the infinite case. In this paper, I show that recovery does not hold for partial meet package contraction in the infinite case.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  4.  46
    Specified Meet Contraction.Sven Ove Hansson - 2008 - Erkenntnis 69 (1):31-54.
    Specified meet contraction is the operation defined by the identity where ∼ is full meet contraction and f is a sentential selector, a function from sentences to sentences. With suitable conditions on the sentential selector, specified meet contraction coincides with the partial meet contractions that yield a finite-based contraction outcome if the original belief set is finite-based. In terms of cognitive realism, specified meet contraction has an advantage over (...) meet contraction in that the selection mechanism operates on sentences rather than on temporary infinite structures (remainders) that are cognitively inaccessible. Specified meet contraction provides a versatile framework in which other types of contraction, such as severe withdrawal and base-generated contraction, can be expressed with suitably chosen properties of the sentential selector. (shrink)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  5.  23
    Peter Gärdenfors. Knowledge in Flux. Modeling the Dynamics of Epistemic States. Bradford Books. The MIT Press, Cambridge, Mass., and London, 1988, Xi + 262 Pp. - Carlos E. Alchourrón, Peter Gärdenfors, and David Makinson. On the Logic of Theory Change: Partial Meet Contraction and Revision Functions. The Journal of Symbolic Logic, Vol. 50 , Pp. 510–530. [REVIEW]André Fuhrmann - 1992 - Journal of Symbolic Logic 57 (4):1479-1481.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  6.  14
    Review: Peter Gardenfors, Knowledge in Flux. Modeling the Dynamics of Epistemic States; Carlos E. Alchourron, Peter Gardenfors, David Makinson, On the Logic of Theory Change: Partial Meet Contraction and Revision Functions. [REVIEW]Andre Fuhrmann - 1992 - Journal of Symbolic Logic 57 (4):1479-1481.
  7.  53
    Belief Contraction in the Context of the General Theory of Rational Choice.Hans Rott - 1993 - Journal of Symbolic Logic 59 (4):1426-1450.
    This paper reorganizes and further develops the theory of partial meet contraction which was introduced in a classic paper by Alchourron, Gardenfors, and Makinson. Our purpose is threefold. First, we put the theory in a broader perspective by decomposing it into two layers which can respectively be treated by the general theory of choice and preference and elementary model theory. Second, we reprove the two main representation theorems of AGM and present two more representation results for the (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  8.  44
    Blockage Contraction.Sven Ove Hansson - 2013 - Journal of Philosophical Logic 42 (2):415-442.
    Blockage contraction is an operation of belief contraction that acts directly on the outcome set, i.e. the set of logically closed subsets of the original belief set K that are potential contraction outcomes. Blocking is represented by a binary relation on the outcome set. If a potential outcome X blocks another potential outcome Y, and X does not imply the sentence p to be contracted, then Y ≠ K ÷ p. The contraction outcome K ÷ p (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  9.  39
    Maximal and Perimaximal Contraction.Sven Ove Hansson - 2013 - Synthese 190 (16):3325-3348.
    Generalizations of partial meet contraction are introduced that start out from the observation that only some of the logically closed subsets of the original belief set are at all viable as contraction outcomes. Belief contraction should proceed by selection among these viable options. Several contraction operators that are based on such selection mechanisms are introduced and then axiomatically characterized. These constructions are more general than the belief base approach. It is shown that partial (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  10. Theory Contraction and Base Contraction Unified.Sven Ove Hansson - 1993 - Journal of Symbolic Logic 58 (2):602-625.
    One way to construct a contraction operator for a theory (belief set) is to assign to it a base (belief base) and an operator of partial meet contraction for that base. Axiomatic characterizations are given of the theory contractions that are generated in this way by (various types of) partial meet base contractions.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  11.  67
    Kernel Contraction.Sven Ove Hansson - 1994 - Journal of Symbolic Logic 59 (3):845-859.
    Kernel contraction is a natural nonrelational generalization of safe contraction. All partial meet contractions are kernel contractions, but the converse relationship does not hold. Kernel contraction is axiomatically characterized. It is shown to be better suited than partial meet contraction for formal treatments of iterated belief change.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  12.  23
    Safe Contraction Revisited.Hans Rott & Sven Ove Hansson - 2014 - In Sven Ove Hansson (ed.), David Makinson on Classical Methods for Non-Classical Problems (Outstanding Contributions to Logic, Vol. 3). Dordrecht: Springer. pp. 35–70.
    Modern belief revision theory is based to a large extent on partial meet contraction that was introduced in the seminal article by Carlos Alchourrón, Peter Gärdenfors, and David Makinson that appeared in 1985. In the same year, Alchourrón and Makinson published a significantly different approach to the same problem, called safe contraction. Since then, safe contraction has received much less attention than partial meet contraction. The present paper summarizes the current state of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  13.  41
    Repertoire Contraction.Sven Ove Hansson - 2013 - Journal of Logic, Language and Information 22 (1):1-21.
    The basic assumption of repertoire contraction is that only some of the logically closed subsets of the original belief set are viable as contraction outcomes. Contraction takes the form of choosing directly among these viable outcomes, rather than among cognitively more far-fetched objects such as possible worlds or maximal consistent subsets of the original belief set. In this first investigation of repertoire contraction, postulates for various variants of the operation are introduced. Necessary and sufficient conditions are (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  14.  16
    Bootstrap Contraction.Sven Ove Hansson - 2013 - Studia Logica 101 (5):1013-1029.
    We can often specify how we would contract by a certain sentence by saying that this contraction would coincide with some other contraction that we know how to perform. We can for instance clarify that our contraction by p&q would coincide with our contraction by p, or by q, or by {p, q}. In a framework where the set of potential outcomes is known, some contractions are “self-evident” in the sense that there is only one serious (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15.  46
    Belief Contraction Without Recovery.Sven Ove Hansson - 1991 - Studia Logica 50 (2):251 - 260.
    The postulate of recovery is commonly regarded to be the intuitively least compelling of the six basic Gärdenfors postulates for belief contraction. We replace recovery by the seemingly much weaker postulate of core-retainment, which ensures that if x is excluded from K when p is contracted, then x plays some role for the fact that K implies p. Surprisingly enough, core-retainment together with four of the other Gärdenfors postulates implies recovery for logically closed belief sets. Reasonable contraction operators (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   45 citations  
  16.  43
    Multiple Kernel Contraction.Eduardo Fermé, Karina Saez & Pablo Sanz - 2003 - Studia Logica 73 (2):183 - 195.
    This paper focuses on the extension of AGM that allows change for a belief base by a set of sentences instead of a single sentence. In [FH94], Fuhrmann and Hansson presented an axiomatic for Multiple Contraction and a construction based on the AGM Partial Meet Contraction. We propose for their model another way to construct functions: Multiple Kernel Contraction, that is a modification of Kernel Contraction, proposed by Hansson [Han94] to construct classical AGM contractions (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  17.  62
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   64 citations  
  18.  11
    Multiple Kernel Contraction.Eduardo Fermé, Karina Saez & Pablo Sanz - 2003 - Studia Logica 73 (2):183-195.
    This paper focuses on the extension of AGM that allows change for a belief base by a set of sentences instead of a single sentence. In [FH94], Fuhrmann and Hansson presented an axiomatic for Multiple Contraction and a construction based on the AGM Partial Meet Contraction. We propose for their model another way to construct functions: Multiple Kernel Contraction, that is a modification of Kernel Contraction, proposed by Hansson [Han94] to construct classical AGM contractions (...)
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  19.  64
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  20.  50
    Probabilistic Belief Contraction.Raghav Ramachandran, Arthur Ramer & Abhaya C. Nayak - 2012 - Minds and Machines 22 (4):325-351.
    Probabilistic belief contraction has been a much neglected topic in the field of probabilistic reasoning. This is due to the difficulty in establishing a reasonable reversal of the effect of Bayesian conditionalization on a probabilistic distribution. We show that indifferent contraction, a solution proposed by Ramer to this problem through a judicious use of the principle of maximum entropy, is a probabilistic version of a full meet contraction. We then propose variations of indifferent contraction, using (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  21.  69
    AGM 25 Years: Twenty-Five Years of Research in Belief Change.Eduardo Fermé & Sven Ove Hansson - 2011 - Journal of Philosophical Logic 40 (2):295 - 331.
    The 1985 paper by Carlos Alchourrón (1931–1996), Peter Gärdenfors, and David Makinson (AGM), "On the Logic of Theory Change: Partial Meet Contraction and Revision Functions" was the starting-point of a large and rapidly growing literature that employs formal models in the investigation of changes in belief states and databases. In this review, the first twentyfive years of this development are summarized. The topics covered include equivalent characterizations of AGM operations, extended representations of the belief states, change operators (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  22.  25
    Changes of Disjunctively Closed Bases.Sven Ove Hansson - 1993 - Journal of Logic, Language and Information 2 (4):255-284.
    An operator of contraction for a belief set (a theory) can be obtained by assigning to it a belief base and an operator of partial meet contraction for that base. It is argued that closure of the base under disjunction is an intuitively reasonable condition. Axiomatic characterizations are given of the contractions of belief sets that can be generated by (various types of) partial meet contraction on disjunctively closed bases. The corresponding revision operators (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  23.  7
    Residual Contraction.Marco Garapa & Maurício D. L. Reis - 2020 - Journal of Logic, Language and Information 29 (2):255-274.
    In this paper, we propose and axiomatically characterize residual contractions, a new kind of contraction operators for belief bases. We establish that the class of partial meet contractions is a strict subclass of the class of residual contractions. We identify an extra condition that may be added to the definition of residual contractions, which is such that the class of residual contractions that satisfy it coincides with the class of partial meet contractions. We investigate the (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  24.  31
    Three Floors for the Theory of Theory Change.Hans Rott - 2014 - In Vít Punčochář & Michal Dančák (eds.), The Logica Yearbook 2013. London: College Publications. pp. 187–205.
    The theory of theory change due to Alchourrón, Gärdenfors and Makinson ("AGM") has been widely known as being characterized by two sets of postulates, one being very weak and the other being very strong. Commenting on the three classic constructions of partial meet contraction, safe contraction and entrenchment-based construction, I argue that three intermediate levels can be distinguished that play decisive roles within the AGM theory.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25.  15
    In Praise of Full Meet Contraction.Sven Ove Hansson - 2006 - Análisis Filosófico 26 (1):134-146.
    Full meet contraction, that was devised by Carlos Alchourrón and David Makinson in the early 1980' s, has often been overlooked since it is not in itself a plausible contraction operator. However, it is a highly useful building-block in the construction of composite contraction operators. In particular, all plausible contraction operators can be reconstructed so that the outcome of contracting a belief set K by a sentence p is defined as K ∼ f, where ∼ (...)
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  26.  31
    On AGM for Non-Classical Logics.Renata Wassermann - 2011 - Journal of Philosophical Logic 40 (2):271 - 294.
    The AGM theory of belief revision provides a formal framework to represent the dynamics of epistemic states. In this framework, the beliefs of the agent are usually represented as logical formulas while the change operations are constrained by rationality postulates. In the original proposal, the logic underlying the reasoning was supposed to be supraclassical, among other properties. In this paper, we present some of the existing work in adapting the AGM theory for non-classical logics and discuss their interconnections and what (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  27.  27
    AGM 25 Years: Twenty-Five Years of Research in Belief Change.Eduardo Fermé & Sven Ove Hansson - 2011 - Journal of Philosophical Logic 40 (2):295-331.
    The 1985 paper by Carlos Alchourrón, Peter Gärdenfors, and David Makinson, “On the Logic of Theory Change: Partial Meet Contraction and Revision Functions” was the starting-point of a large and rapidly growing literature that employs formal models in the investigation of changes in belief states and databases. In this review, the first twenty-five years of this development are summarized. The topics covered include equivalent characterizations of AGM operations, extended representations of the belief states, change operators not included (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  28.  25
    Replacement—A Sheffer Stroke for Belief Change.Sven Ove Hansson - 2009 - Journal of Philosophical Logic 38 (2):127-149.
    By replacement is meant an operation that replaces one sentence by another in a belief set. Replacement can be used as a kind of Sheffer stroke for belief change, since contraction, revision, and expansion can all be defined in terms of it. Replacement can also be defined either in terms of contraction or in terms of revision. Close connections are shown to hold between axioms for replacement and axioms for contraction and revision. Partial meet replacement (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  29.  55
    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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   34 citations  
  30.  27
    Contracting Intuitionistic Theories.Neil Tennant - 2005 - Studia Logica 80 (2-3):369-391.
    I reformulate the AGM-account of contraction (which would yield an account also of revision). The reformulation involves using introduction and elimination rules for relational notions. Then I investigate the extent to which the two main methods of partial meet contraction and safe contraction can be employed for theories closed under intuitionistic consequence.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  31.  50
    How to Give It Up: A Survey of Some Formal Aspects of the Logic of Theory Change.David Makinson - 1986 - Synthese 68 (1):185 - 186.
    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 (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  32. Context as Assumptions.Erich Rast - 2010 - Msh Lorraine Preprints 2010 of the Proceedings of the Epiconfor Workshop on Epistemology, Nancy 2009.
    In the tradition of Stalnaker there is a number of well-known problems that need to be addressed, because revision of iterated belief modalities is required in this case. These problems have already been investigated in detail in recent works on DDL Leitgeb/Segerberg 2007)and DEL see e.g. Ditmarsch et. Another strategy would be to maintain and revise assumptions independently of the beliefs of an agent.I will briefly discuss the advantages and disadvantages of each of these views. In both views, assumptions constitute (...)
     
    Export citation  
     
    Bookmark   1 citation  
  33.  45
    System of Spheres-Based Multiple Contractions.Eduardo Fermé & Maurício D. L. Reis - 2012 - Journal of Philosophical Logic 41 (1):29-52.
    We propose a new class of multiple contraction operations — the system of spheres-based multiple contractions — which are a generalization of Grove’s system of spheres-based (singleton) contractions to the case of contractions by (possibly non-singleton) sets of sentences. Furthermore, we show that this new class of functions is a subclass of the class of the partial meet multiple contractions.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  34. Playing Cards with Hintikka: An Introduction to Dynamic Epistemic Logic.H. van Ditmarsch, W. van der Hoek & B. Kooi - 2005 - Australasian Journal of Logic 3:108-134.
    This contribution is a gentle introduction to so-called dynamic epistemic logics, that can describe how agents change their knowledge and beliefs. We start with a concise introduction to epistemic logic, through the example of one, two and finally three players holding cards; and, mainly for the purpose of motivating the dynamics, we also very summarily introduce the concepts of general and common knowledge. We then pay ample attention to the logic of public announcements, wherein agents change their knowledge as the (...)
     
    Export citation  
     
    Bookmark   2 citations  
  35.  44
    On Revising Fuzzy Belief Bases.Richard Booth & Eva Richter - 2005 - Studia Logica 80 (1):29-61.
    We look at the problem of revising fuzzy belief bases, i.e., belief base revision in which both formulas in the base as well as revision-input formulas can come attached with varying degrees. Working within a very general framework for fuzzy logic which is able to capture certain types of uncertainty calculi as well as truth-functional fuzzy logics, we show how the idea of rational change from “crisp” base revision, as embodied by the idea of partial meet (base) revision, (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  36. Construction of System of Spheres-Based Transitively Relational Partial Meet Multiple Contractions: An Impossibility Result.Maurício D. L. Reis, Eduardo Fermé & Pavlos Peppas - 2016 - Artificial Intelligence 233:122-141.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37.  29
    Global and Iterated Contraction and Revision: An Exploration of Uniform and Semi-Uniform Approaches. [REVIEW]Sven Ove Hansson - 2012 - Journal of Philosophical Logic 41 (1):143-172.
    In order to clarify the problems of iterated (global) belief change it is useful to study simple cases, in particular consecutive contractions by sentences that are both logically and epistemically independent. Models in which the selection mechanism is kept constant are much more plausible in this case than what they are in general. One such model, namely uniform specified meet contraction, has the advantage of being closely connected with the AGM model. Its properties seem fairly adequate for the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38.  43
    Multiple and Iterated Contraction Reduced to Single-Step Single-Sentence Contraction.Sven Ove Hansson - 2010 - Synthese 173 (2):153-177.
    Multiple contraction (simultaneous contraction by several sentences) and iterated contraction are investigated in the framework of specified meet contraction (s.m.c.) that is extended for this purpose. Multiple contraction is axiomatized, and so is finitely multiple contraction (contraction by a finite set of sentences). Two ways to reduce finitely multiple contraction to contraction by single sentences are introduced. The reduced operations are axiomatically characterized and their properties are investigated. Furthermore, it is (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  39. Immoral Lies and Partial Beliefs.Neri Marsili - 2019 - Inquiry: An Interdisciplinary Journal of Philosophy:1-11.
    In a recent article, Krauss (2017) raises some fundamental questions concerning (i) what the desiderata of a definition of lying are, and (ii) how definitions of lying can account for partial beliefs. This paper aims to provide an adequate answer to both questions. Regarding (i), it shows that there can be a tension between two desiderata for a definition of lying: 'descriptive accuracy' (meeting intuitions about our ordinary concept of lying), and 'moral import' (meeting intuitions about what is wrong (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  40.  27
    Is a Set B with Boolean Operations a∨ B (Join), a∧ B (Meet) and− a (Complement), Partial Ordering a≤ B Defined by a∧ B= a and the Smallest and Greatest Element, 0 and 1. By Stone's Representation Theorem, Every Boolean Algebra is Isomorphic to an Algebra of Subsets of Some Nonempty Set S, Under Operations a∪ B, a∩ B, S− a, Ordered by Inclusion, with 0=∅. [REVIEW]Mystery Of Measurability - 2006 - Bulletin of Symbolic Logic 12 (2).
  41.  17
    The Misguided Concept of Partial Justification.Shachar Eldar & Elkana Laist - 2014 - Legal Theory 20 (3):157-185.
    Despite the fundamentally binary character of justification , an upsurge in recent Anglo-American scholarship offers some highly sophisticated and widely diverging conceptions of in criminal law. In the present article we identify eight distinct conceptions of partial justification. We find, however, that each of them is predicated on a different conceptual fallacy. Any sound concept of partial justification in criminal law ought to meet the dual challenge of utility and consistency: it should usefully convey a message that (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  42.  48
    Partial and Paraconsistent Approaches to Future Contingents in Tense Logic.Seiki Akama, Tetsuya Murai & Yasuo Kudo - 2016 - Synthese 193 (11).
    The problem of future contingents is regarded as an important philosophical problem in connection with determinism and it should be treated by tense logic. Prior’s early work focused on the problem, and later Prior studied branching-time tense logic which was invented by Kripke. However, Prior’s idea to use three-valued logic for the problem seems to be still alive. In this paper, we consider partial and paraconsistent approaches to the problem of future contingents. These approaches theoretically meet Aristotle’s interpretation (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  43.  54
    Directed Altruistic Living Organ Donation: Partial but Not Unfair.Medard T. Hilhorst - 2005 - Ethical Theory and Moral Practice 8 (1-2):197-215.
    Arguments against directed altruistic living organ donation are too weak to justify a ban. Potential donors who want to specify the non-related person or group of persons to receive their donated kidney should be accepted. The arguments against, based on considerations of motivation, fairness and (non-)anonymity (e.g. those recently cited by an advisory report of the Dutch Health Council), are presented and discussed, as well as the Dutch Governments response. Whereas the Government argues that individuals have authority with regard to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  44.  18
    On Why the Best Should Always Meet.Tor Sandqvist - 2000 - Economics and Philosophy 16 (2):287-313.
    It seems plausible, even truistic, that when an agent is faced with the choice of giving up one belief or another, the decision should be based on the relative strengths of these beliefs along some dimension of doxastic merit. This said, however, two non-trivial questions arise: (1) Which dimension? (2) How should the contraction outcome be affected by the distribution of beliefs along this dimension?
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  45.  10
    The Misguided Concept of Partial Justification.Shachar Eldar & Elkana Laist - 2014 - Legal Theory 20 (3):157-185.
    Despite the fundamentally binary character of justification, an upsurge in recent Anglo-American scholarship offers some highly sophisticated and widely diverging conceptions of “partial justification” in criminal law. In the present article we identify eight distinct conceptions of partial justification. We find, however, that each of them is predicated on a different conceptual fallacy. Any sound concept of partial justification in criminal law ought to meet the dual challenge of utility and consistency: it should usefully convey a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  46.  16
    Finite Contractions on Infinite Belief Sets.Sven Ove Hansson - 2012 - Studia Logica 100 (5):907-920.
    Contractions on belief sets that have no finite representation cannot be finite in the sense that only a finite number of sentences is removed. However, such contractions can be delimited so that the actual change takes place in a logically isolated, finite-based part of the belief set. A construction that answers to this principle is introduced, and is axiomatically characterized. It turns out to coincide with specified meet contraction.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  47.  55
    Two Methods of Constructing Contractions and Revisions of Knowledge Systems.Hans Rott - 1991 - Journal of Philosophical Logic 20 (2):149 - 173.
    This paper investigates the formal relationship between two prominent approaches to the logic of belief change. The first one uses the idea of "relational partial meet contractions" as developed by Alchourrón, Gärdenfors and Makinson (Journal of Symbolic Logic 1985), the second one uses the concept of "epistemic entrenchment" as elaborated by Gärdenfors and Makinson (in Theoretical Aspects of Reasoning about Knowledge, M. Y. Vardi, Los Altos 1988). The two approaches are shown to be strictly equivalent via direct links (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  48.  36
    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 (3 more)  
     
    Export citation  
     
    Bookmark   27 citations  
  49.  28
    Rational Metabolic Revision Based on Core Beliefs.Yongfeng Yuan - 2017 - Synthese 194 (6).
    When an agent can not recognize, immediately, the implausible part of new information received, she will usually first expand her belief state by the new information, and then she may encounter some belief conflicts, and find the implausible information based on her criteria to consolidate her belief state. This process indicates a new kind of non-prioritized multiple revision, called metabolic revision. I give some axiomatic postulates for metabolic revision and propose two functional constructions for it, namely kernel metabolic revision and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  50.  50
    Prioritized and Non-Prioritized Multiple Change on Belief Bases.Marcelo A. Falappa, Gabriele Kern-Isberner, Maurício D. L. Reis & Guillermo R. Simari - 2012 - Journal of Philosophical Logic 41 (1):77-113.
    In this article we explore multiple change operators, i.e., operators in which the epistemic input is a set of sentences instead of a single sentence. We propose two types of change: prioritized change, in which the input set is fully accepted, and symmetric change, where both the epistemic state and the epistemic input are equally treated. In both kinds of operators we propose a set of postulates and we present different constructions: kernel changes and partial meet changes.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
1 — 50 / 998