5,087 Hits in 2.7 sec

On the Ramsey Test without Triviality

Hannes Leitgeb
2010 Notre Dame Journal of Formal Logic  
For one of these ways-conditionals which are not descriptive but which only have an inferential role as being given by the Ramsey test-we determine which of the assumptions in three different versions  ...  We present a way of classifying the logically possible ways out of Gärdenfors' inconsistency or triviality result on belief revision with conditionals.  ...  (ii) If G is trivial, then A ∈ G * A. Usually, regarding (i), the Ramsey test is stated without restricting 'A' to consistent sentences and without restricting 'G' to non-trivial acceptability sets.  ... 
doi:10.1215/00294527-2010-003 fatcat:meerogsifzdjbcdhe744n4ovvq

A Defence of the Ramsey Test

R. Bradley
2007 Mind  
In this paper, I argue that these results do not in fact have this implication, on the grounds that similar results can be proved without recourse to the Ramsey test hypothesis.  ...  According to the Ramsey Test hypothesis the conditional claim that if A then B is credible just in case it is credible that B, on the supposition that A.  ...  But it is clearly possible to accept the intuitive idea of the Ramsey Test without taking CDR on board -certainly Ramsey never explicitly endorsed the latter. 4 Levi (1996) argues that a weaker preservation  ... 
doi:10.1093/mind/fzm001 fatcat:v2agyrsnivbijjiez4qfplr5ti

The Sum Rule Has Not Been Tested

Nancy Cartwright
1977 Philosophy of Science  
any format or medium without the formal permission of the copyright holders.  ...  The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes  ...  would test the Sum Rule; for one could not rely on standard scattering theory in calculating corrections, as do Cross and Ramsey and the authors they cite. (3) An experiment to test the Sum Rule must,  ... 
doi:10.1086/288727 fatcat:7afpt5yknrb5bl3es5cmtmc274

A reason maintenance perspective on relevant Ramsey conditionals

H. O. Ismail
2009 Logic Journal of the IGPL  
This paper presents a Ramsey account of conditionals within the framework of an implemented reason maintenance system.  ...  The reason maintenance system is built on top of a deductive reasoning engine based on relevance logic. Thus, the account of conditionals provided is not susceptible to the fallacies of relevance.  ...  In addition, the triviality trap is also avoided as a result of adopting relevance logic and only one direction of the Ramsey test.  ... 
doi:10.1093/jigpal/jzp036 fatcat:sibbxf7gvvfy5lpnltzl2klywy

Weak AGM postulates and strong Ramsey Test: A logical formalization

Laura Giordano, Valentina Gliozzi, Nicola Olivetti
2005 Artificial Intelligence  
We show that we can establish a mapping between belief revision systems and conditionals by means of the so called Ramsey Test, without incurring Gärdenfors triviality result.  ...  We then derive the conditional logic BCR from our revision postulates by means of a strong version of the Ramsey Test.  ...  This research has been partially supported by the project MIUR PRIN 2003 Logic-based development and verification of multi-agent systems.  ... 
doi:10.1016/j.artint.2005.06.004 fatcat:bzgq2ykkmbbxpclok6qpasotfu

Behaviourism in Disguise: The Triviality of Ramsey Sentence Functionalism

T. S. Lowther
2020 Axiomathes  
Together, these proofs suggest that functionalism formalised by the Ramsey sentence trivially reduces to a kind of behaviourism plus a cardinality constraint on the number of relations holding between  ...  The most common method to express this precise formulation is by means of the modified Ramsey sentence.  ...  This work would not have been possible without the patient support of Jason Lowther (University of Birmingham). None of those acknowledged should be blamed for the work that follows.  ... 
doi:10.1007/s10516-020-09511-w fatcat:4ukjff76cnhcxomhnykylypmxe

Observation of a Topological and Parity-Dependent Phase ofm=0Spin States

Koji Usami, Mikio Kozuma
2007 Physical Review Letters  
While no phase shift occurred when the reversal was sudden, the Ramsey fringes were shifted by a factor of π when the reversal was adiabatic.  ...  A Ramsey interrogation scheme was used to measure the phase shift of laser-cooled ^87Rb clock-transition pseudospins arising as a result of a reversal of a bias magnetic field, i.e., B→ -B, during the  ...  The unique character of the phase is its parity dependence, which may provide a new scheme for testing parity non-conservation in atoms [23] .  ... 
doi:10.1103/physrevlett.99.140404 pmid:17930651 fatcat:h3qemiae25fgjdatc4gabkwexq

Conditionals and theory change: Revisions, expansions, and additions

Hans Rott
1989 Synthese  
If negated or 'might' conditionals are interpreted on the basis of 'autoepistemic omniscience', or if autoepistemic modalities (Moore) are admitted, even more severe triviality results ensue.  ...  After defining the basic concept of a (non-trivial) belief revision model. I present a simple proof of G~irdenfors's (1986) triviality theorem.  ...  The triviality proofs of Sections 2 and 3, therefore, cannot be directed against the Ramsey test.  ... 
doi:10.1007/bf00869346 fatcat:sa7i7ik3rvgd7mn5wsv2krclhq

Reapproaching Ramsey: Conditionals and Iterated Belief Change in the Spirit of AGM

Hans Rott
2011 Journal of Philosophical Logic  
Since Gärdenfors's seminal paper of 1986, a series of impossibility theorems ("triviality theorems") has seemed to show that the Ramsey test is not a viable analysis of conditionals if it is combined with  ...  I argue that it is possible to endorse that Ramsey test for conditionals while staying true to the spirit of AGM.  ...  So this attempt at trivializing the Ramsey test does not work.  ... 
doi:10.1007/s10992-011-9177-3 fatcat:rzrgdwyks5eapmkf2zrxn2gice

Ramsey's Tests

B. H. Slater
2004 Synthese  
Ramsey's Tests 1 The so-called 'Ramsey Test', as a way of understanding conditionals, has been discussed very extensively over the last few decades.  ...  Thus, the formal incorporation of the 'Ramsey Test' in Gärdenfors' work on belief revision brings in, for instance, the axiom if K ≠ K ⊥ , and K A = K ⊥ , then |-¬A, where K A is the belief set adjusted  ... 
doi:10.1023/b:synt.0000044995.88380.6a fatcat:7ksz2xzszjgpppxbxzxyzezqn4

New surprises for the Ramsey Test

Malte Willer
2009 Synthese  
I then develop a double-indexed Update Semantics for conditionals that takes these two results into account while doing justice to the key intuitions underlying the Ramsey Test.  ...  In contemporary discussions of the Ramsey Test for conditionals, it is commonly held that (i) supposing the antecedent of a conditional is adopting a potential state of full belief, and (ii) Modus Ponens  ...  Ackknowledgements I would like to thank audiences at the University of Texas at Austin, at the University of Southern California, and at the 36 th annual meeting of the Society for Exact Philosophy at  ... 
doi:10.1007/s11229-009-9494-z fatcat:pgpu7rggvvg6lgj6i7s2slz46q

Supporters and Underminers: Reply to Chandler

Richard Bradley
2016 Mind  
In 'A Defence of the Ramsey Test', I argued that the triviality results for the Ramsey Test hypothesis were misdirected and that we should instead reject one or more of the premises of these results.  ...  In his discussion paper Chandler contests the significance of these results, though not the broader argument in favour of the Ramsey Test hypothesis.  ...  SUPPORTERS AND UNDERMINERS: REPLY TO CHANDLER Richard Bradley London School of Economics and Political Science In 'A Defence of the Ramsey Test', I argued that the triviality results  ... 
doi:10.1093/mind/fzw003 fatcat:rtzdmrhhvfcchdkgd4axfgqgtq

Cohomological Ramsey Theory [article]

Alexander Engstrom
2010 arXiv   pre-print
In a corollary, we give an explicit description of the Ramsey complexes used for upper bounds on Ramsey numbers.  ...  The main theorem states that if certain cohomology groups of the Ramsey complex Ram(dDelta_p^k, Sigma) are trivial, then the vertices of the simplicial complex Sigma cannot be n-colored such that every  ...  In [6] most results on Hom(G, K n ) were extended to Part(Σ, {1, 2, . . . , n}) with more transparent proofs, but without any condition on Σ.  ... 
arXiv:1002.4074v1 fatcat:cxsuvleberfdzc7fkajwnjqz3m


2008 The Review of Symbolic Logic  
result, due to Arló-Costa, that targets the Ramsey test. §1.  ...  The principle of monotonicity in question is implied by the Ramsey test for conditionals.  ...  So the Ramsey test, without loss of power or interest, can be modified as follows: (R † ) If    ϕ ⊥ ψ ⊥ K , ϕ ⊥    , then [K (ϕ •→ ψ) ⇔ (K * ϕ) ψ].  ... 
doi:10.1017/s1755020308090023 fatcat:sjuh7n3hc5b7loatzhjuvsym5y

Efficient Büchi Universality Checking [chapter]

Seth Fogarty, Moshe Y. Vardi
2010 Lecture Notes in Computer Science  
Surprisingly, there also exist several areas, including the area most difficult for rank-based tools, on which the Ramsey-based solver scales better than the rank-based solver.  ...  The complementation of Büchi automata, required for checking automata universality, remains one of the outstanding automata-theoretic challenges in formal verification.  ...  We impose one exception to avoid trivial cases of non-universality: the initial node must have at least one outgoing transition for each letter of the alphabet.  ... 
doi:10.1007/978-3-642-12002-2_17 fatcat:7ntaqt3byfgo3exa65u5l2zy6i
« Previous Showing results 1 — 15 out of 5,087 results