Search results for 'Partial Meet Contraction' (try it on Scholar)

1000+ found
Sort by:
  1. Jun Li (1998). A Note on Partial Meet Package Contraction. Journal of Logic, Language and Information 7 (2):139-142.score: 176.0
    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 (6 more)  
     
    My bibliography  
     
    Export citation  
  2. Carlos E. Alchourrón, Peter Gärdenfors & David Makinson (1985). On the Logic of Theory Change: Partial Meet Contraction and Revision Functions. Journal of Symbolic Logic 50 (2):510-530.score: 126.0
    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 (6 more)  
     
    My bibliography  
     
    Export citation  
  3. Maurício D. L. Reis & Eduardo Fermé (2012). Possible Worlds Semantics for Partial Meet Multiple Contraction. Journal of Philosophical Logic 41 (1):7-28.score: 123.0
    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 (6 more)  
     
    My bibliography  
     
    Export citation  
  4. Sven Ove Hansson (2013). Blockage Contraction. Journal of Philosophical Logic 42 (2):415-442.score: 99.0
    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 (6 more)  
     
    My bibliography  
     
    Export citation  
  5. Hans Rott (1993). Belief Contraction in the Context of the General Theory of Rational Choice. Journal of Symbolic Logic 58 (4):1426-1450.score: 99.0
    This paper reorganizes and further develops the theory of partial meet contraction which was introduced in a classic paper by Alchourrón, Gärdenfors, 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 (6 more)  
     
    My bibliography  
     
    Export citation  
  6. Sven Ove Hansson (2013). Maximal and Perimaximal Contraction. Synthese 190 (16):3325-3348.score: 99.0
    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 (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  7. Eduardo Fermé & Sven Ove Hansson (2011). AGM 25 Years: Twenty-Five Years of Research in Belief Change. Journal of Philosophical Logic 40 (2):295 - 331.score: 90.0
    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)  
     
    My bibliography  
     
    Export citation  
  8. Sven Ove Hansson (1993). Changes of Disjunctively Closed Bases. Journal of Logic, Language and Information 2 (4):255-284.score: 90.0
    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 (4 more)  
     
    My bibliography  
     
    Export citation  
  9. André Fuhrmann (1992). Gärdenfors Peter. Knowledge in Flux. Modeling the Dynamics of Epistemic States. Bradford Books. The MIT Press, Cambridge, Mass., and London, 1988, Xi+ 262 Pp. Alchourrón Carlos E., Gärdenfors Peter, and Makinson David. On the Logic of Theory Change: Partial Meet Contraction and Revision Functions. [REVIEW] Journal of Symbolic Logic 57 (4):1479-1481.score: 90.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  10. Andre Fuhrmann (1992). 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] Journal of Symbolic Logic 57 (4):1479-1481.score: 90.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  11. Raghav Ramachandran, Arthur Ramer & Abhaya C. Nayak (2012). Probabilistic Belief Contraction. Minds and Machines 22 (4):325-351.score: 83.0
    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 (6 more)  
     
    My bibliography  
     
    Export citation  
  12. Sven Ove Hansson (2010). Multiple and Iterated Contraction Reduced to Single-Step Single-Sentence Contraction. Synthese 173 (2):153 - 177.score: 83.0
    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 (...)
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  13. Sven Ove Hansson (2013). Repertoire Contraction. Journal of Logic, Language and Information 22 (1):1-21.score: 83.0
    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 (6 more)  
     
    My bibliography  
     
    Export citation  
  14. Sven Ove Hansson (2008). Specified Meet Contraction. Erkenntnis 69 (1):31 - 54.score: 72.0
    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 (5 more)  
     
    My bibliography  
     
    Export citation  
  15. Sven Ove Hansson (2013). Bootstrap Contraction. Studia Logica 101 (5):1013-1029.score: 72.0
    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 (5 more)  
     
    My bibliography  
     
    Export citation  
  16. Renata Wassermann (2011). On AGM for Non-Classical Logics. Journal of Philosophical Logic 40 (2):271 - 294.score: 60.0
    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)  
     
    My bibliography  
     
    Export citation  
  17. Sven Ove Hansson (2006). In Praise of Full Meet Contraction. Análisis Filosófico 26 (1):134-146.score: 56.0
    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 (p), where (...)
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  18. Sven Ove Hansson (2012). Global and Iterated Contraction and Revision: An Exploration of Uniform and Semi-Uniform Approaches. [REVIEW] Journal of Philosophical Logic 41 (1):143-172.score: 51.0
    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 (6 more)  
     
    My bibliography  
     
    Export citation  
  19. Sven Ove Hansson (2012). Finite Contractions on Infinite Belief Sets. Studia Logica 100 (5):907-920.score: 45.0
    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 (5 more)  
     
    My bibliography  
     
    Export citation  
  20. Carlos E. Alchourrón & David Makinson (1985). On the Logic of Theory Change: Safe Contraction. Studia Logica 44 (4):405 - 422.score: 39.0
    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 (5 more)  
     
    My bibliography  
     
    Export citation  
  21. Carlos E. Alchourrón & David Makinson (1986). Maps Between Some Different Kinds of Contraction Function: The Finite Case. Studia Logica 45 (2):187 - 198.score: 39.0
    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 (5 more)  
     
    My bibliography  
     
    Export citation  
  22. Sven Ove Hansson (1994). Kernel Contraction. Journal of Symbolic Logic 59 (3):845-859.score: 39.0
    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 (6 more)  
     
    My bibliography  
     
    Export citation  
  23. Eduardo Fermé, Karina Saez & Pablo Sanz (2003). Multiple Kernel Contraction. Studia Logica 73 (2):183 - 195.score: 39.0
    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 (6 more)  
     
    My bibliography  
     
    Export citation  
  24. Sven Ove Hansson (1993). Theory Contraction and Base Contraction Unified. Journal of Symbolic Logic 58 (2):602-625.score: 39.0
    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 (6 more)  
     
    My bibliography  
     
    Export citation  
  25. Sven Ove Hansson (1991). Belief Contraction Without Recovery. Studia Logica 50 (2):251 - 260.score: 38.3
    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 (5 more)  
     
    My bibliography  
     
    Export citation  
  26. Eduardo Fermé & Maurício D. L. Reis (2012). System of Spheres-Based Multiple Contractions. Journal of Philosophical Logic 41 (1):29-52.score: 38.0
    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 (6 more)  
     
    My bibliography  
     
    Export citation  
  27. Sven Ove Hansson (2009). Replacement—a Sheffer Stroke for Belief Change. Journal of Philosophical Logic 38 (2):127 - 149.score: 36.0
    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 (5 more)  
     
    My bibliography  
     
    Export citation  
  28. Mystery Of Measurability (2006). 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] Bulletin of Symbolic Logic 12 (2).score: 36.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  29. Neil Tennant (2005). Contracting Intuitionistic Theories. Studia Logica 80 (2-3):369 - 391.score: 33.0
    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 (5 more)  
     
    My bibliography  
     
    Export citation  
  30. Erich Rast, Context as Assumptions. MSH Lorraine Preprints 2010 of the Proceedings of the Epiconfor Workshop on Epistemology, Nancy 2009.score: 30.0
    In the tradition of Stalnaker (1978,2002, context can be regarded as a set of assumptions that are mutually shared by a group of epistemic agents.An obvious generalization of this view is to explicitly represent each agent’s assumptions in a given situation and update them accordingly when new information is accepted. I lay out a number of philosophical and linguistic requirements for using such a model in order to describe communication of ideally-rational agents. In particular,the following questions are addressed: -/- 1. (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  31. David Makinson (1985). How to Give It Up: A Survey of Some Formal Aspects of the Logic of Theory Change. Synthese 62 (3):347 - 363.score: 30.0
    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)  
     
    My bibliography  
     
    Export citation  
  32. David Makinson (1986). How to Give It Up: A Survey of Some Formal Aspects of the Logic of Theory Change. Synthese 68 (1):185 - 186.score: 30.0
    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 (7 more)  
     
    My bibliography  
     
    Export citation  
  33. Richard Booth & Eva Richter (2005). On Revising Fuzzy Belief Bases. Studia Logica 80 (1):29 - 61.score: 29.0
    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)  
     
    My bibliography  
     
    Export citation  
  34. Medard T. Hilhorst (2005). Directed Altruistic Living Organ Donation: Partial but Not Unfair. [REVIEW] Ethical Theory and Moral Practice 8 (1-2):197 - 215.score: 23.0
    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 (5 more)  
     
    My bibliography  
     
    Export citation  
  35. Nicholas Mantegani (2013). Instantiation is Not Partial Identity. Philosophical Studies 163 (3):697-715.score: 18.0
    In order to avoid the problems faced by standard realist analyses of the “relation” of instantiation, Baxter and, following him, Armstrong each analyze the instantiation of a universal by a particular in terms of their partial identity. I introduce two related conceptions of partial identity, one mereological and one non-mereological, both of which require at least one of the relata of the partial identity “relation” to be complex. I then introduce a second non-mereological conception of partial (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  36. Matteo Morganti (2011). The Partial Identity Account of Partial Similarity Revisited. Philosophia 39 (3):527-546.score: 18.0
    This paper provides a defence of the account of partial resemblances between properties according to which such resemblances are due to partial identities of constituent properties. It is argued, first of all, that the account is not only required by realists about universals à la Armstrong, but also useful (of course, in an appropriately re-formulated form) for those who prefer a nominalistic ontology for material objects. For this reason, the paper only briefly considers the problem of how to (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  37. Sebastian Lutz, Generalizing Empirical Adequacy II: Partial Structures.score: 18.0
    The companion piece to this article captures and generalizes empirical adequacy in terms of vagueness sets. In this article, I show that previous attempts to capture and generalize empirical adequacy in terms of partial structures fail. Indeed, the motivations for the partial structures approach are better met by vagueness sets, which can be used to generalize the partial structure approach.
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  38. David Beaver & Emiel Krahmer (2001). A Partial Account of Presupposition Projection. Journal of Logic, Language and Information 10 (2):147-182.score: 18.0
    In this paper it is shown how a partial semantics for presuppositions can be given which is empirically more satisfactory than its predecessors, and how this semantics can be integrated with a technically sound, compositional grammar in the Montagovian fashion. Additionally, it is argued that the classical objection to partial accounts of presupposition projection, namely that they lack “flexibility,” is based on a misconception. Partial logics can give rise to flexible predictions without postulating any ad hoc ambiguities. (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  39. Peter Vickers (2009). Can Partial Structures Accommodate Inconsistent Science? Principia 13 (2):233-250-.score: 18.0
    The semantic approach to scientific representation is now long established as a favourite amongst philosophers of science. One of the foremost strains of this approach-the model-theoretic approach (MTA)-is to represent scientific theories as families of models, all of which satisfy or 'make true' a given set of constraints. However some autho.rs (Brown 2002, Frisch 2005) have criticised the approach on the grounds that certain scientific theories are logically inconsistent, and there can be no models of an inconsistent set of constraints. (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  40. Kevin Tobia (2013). Rule Consequentialism and the Problem of Partial Acceptance. Ethical Theory and Moral Practice 16 (3):643-652.score: 18.0
    Most plausible moral theories must address problems of partial acceptance or partial compliance. The aim of this paper is to examine some proposed ways of dealing with partial acceptance problems as well as to introduce a new Rule Utilitarian suggestion. Here I survey three forms of Rule Utilitarianism, each of which represents a distinct approach to solving partial acceptance issues. I examine Fixed Rate, Variable Rate, and Optimum Rate Rule Utilitarianism, and argue that a new approach, (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  41. Gregory Wheeler & Marco Alberti (2011). NO Revision and NO Contraction. Minds and Machines 21 (3):411-430.score: 18.0
    One goal of normative multi-agent system theory is to formulate principles for normative system change that maintain the rule-like structure of norms and preserve links between norms and individual agent obligations. A central question raised by this problem is whether there is a framework for norm change that is at once specific enough to capture this rule-like behavior of norms, yet general enough to support a full battery of norm and obligation change operators. In this paper we propose an answer (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  42. Fernando Tohmé, Claudio Delrieux & Otávio Bueno (2011). Defeasible Reasoning + Partial Models: A Formal Framework for the Methodology of Research Programs. [REVIEW] Foundations of Science 16 (1):47-65.score: 18.0
    In this paper we show that any reasoning process in which conclusions can be both fallible and corrigible can be formalized in terms of two approaches: (i) syntactically, with the use of defeasible reasoning, according to which reasoning consists in the construction and assessment of arguments for and against a given claim, and (ii) semantically, with the use of partial structures, which allow for the representation of less than conclusive information. We are particularly interested in the formalization of scientific (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  43. Maurizio Negri (2010). A Probability Measure for Partial Events. Studia Logica 94 (2):271 - 290.score: 18.0
    We introduce the concept of partial event as a pair of disjoint sets, respectively the favorable and the unfavorable cases. Partial events can be seen as a De Morgan algebra with a single fixed point for the complement. We introduce the concept of a measure of partial probability, based on a set of axioms resembling Kolmogoroff’s. Finally we define a concept of conditional probability for partial events and apply this concept to the analysis of the two-slit (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  44. Robert Schroer (2013). Can a Single Property Be Both Dispositional and Categorical? The “Partial Consideration Strategy”, Partially Considered. Metaphysica 14 (1):63-77.score: 18.0
    One controversial position in the debate over dispositional and categorical properties maintains that our concepts of these properties are the result of partially considering unitary properties that are both dispositional and categorical. As one of its defenders (Heil 2005, p. 351) admits, this position is typically met with “incredulous stares”. In this paper, I examine whether such a reaction is warranted. This thesis about properties is an instance of what I call “the Partial Consideration Strategy”—i.e., the strategy of claiming (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  45. Takahito Aoto (1999). Uniqueness of Normal Proofs in Implicational Intuitionistic Logic. Journal of Logic, Language and Information 8 (2):217-242.score: 18.0
    A minimal theorem in a logic L is an L-theorem which is not a non-trivial substitution instance of another L-theorem. Komori (1987) raised the question whether every minimal implicational theorem in intuitionistic logic has a unique normal proof in the natural deduction system NJ. The answer has been known to be partially positive and generally negative. It is shown here that a minimal implicational theorem A in intuitionistic logic has a unique -normal proof in NJ whenever A is provable without (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  46. Brian Hill & Francesca Poggiolesi (2010). A Contraction-Free and Cut-Free Sequent Calculus for Propositional Dynamic Logic. Studia Logica 94 (1):47 - 72.score: 18.0
    In this paper we present a sequent calculus for propositional dynamic logic built using an enriched version of the tree-hypersequent method and including an infinitary rule for the iteration operator. We prove that this sequent calculus is theoremwise equivalent to the corresponding Hilbert-style system, and that it is contraction-free and cut-free. All results are proved in a purely syntactic way.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  47. Carlos Barceló & Gil Jannes (2008). A Real Lorentz-FitzGerald Contraction. Foundations of Physics 38 (2):191-199.score: 18.0
    Many condensed matter systems are such that their collective excitations at low energies can be described by fields satisfying equations of motion formally indistinguishable from those of relativistic field theory. The finite speed of propagation of the disturbances in the effective fields (in the simplest models, the speed of sound) plays here the role of the speed of light in fundamental physics. However, these apparently relativistic fields are immersed in an external Newtonian world (the condensed matter system itself and the (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  48. Guram Bezhanishvili & Ramon Jansana (2011). Priestley Style Duality for Distributive Meet-Semilattices. Studia Logica 98 (1-2):83-122.score: 18.0
    We generalize Priestley duality for distributive lattices to a duality for distributive meet-semilattices. On the one hand, our generalized Priestley spaces are easier to work with than Celani’s DS-spaces, and are similar to Hansoul’s Priestley structures. On the other hand, our generalized Priestley morphisms are similar to Celani’s meet-relations and are more general than Hansoul’s morphisms. As a result, our duality extends Hansoul’s duality and is an improvement of Celani’s duality.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  49. Horacio Arlo-Costa & Isaac Levi, Contraction: On the Decision Theoretical Origins of Minimal Change and Entrenchment.score: 18.0
    Horacio Arlo-Costa and Issac Levi. Contraction: On the Decision Theoretical Origins of Minimal Change and Entrenchment.
    No categories
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  50. Horacio Arló-Costa & Isaac Levi (2006). Contraction: On the Decision-Theoretical Origins of Minimal Change and Entrenchment. Synthese 152 (1):129 - 154.score: 18.0
    We present a decision-theoretically motivated notion of contraction which, we claim, encodes the principles of minimal change and entrenchment. Contraction is seen as an operation whose goal is to minimize loses of informational value. The operation is also compatible with the principle that in contracting A one should preserve the sentences better entrenched than A (when the belief set contains A). Even when the principle of minimal change and the latter motivation for entrenchment figure prominently among the basic (...)
    No categories
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000