Order:
  1.  5
    When Cheating Would Make You a Cheater: Implicating the Self Prevents Unethical Behavior.Christopher J. Bryan, Gabrielle S. Adams & Benoît Monin - 2013 - Journal of Experimental Psychology: General 142 (4):1001-1005.
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  2.  57
    The Dynamic Moral Self: A Social Psychological Perspective.Benoît Monin & Alexander H. Jordan - 2009 - In Darcia Narvaez & Daniel Lapsley (eds.), Personality, Identity, and Character. Cambridge University Press. pp. 341--354.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  3.  10
    Continuous Higher Randomness.Laurent Bienvenu, Noam Greenberg & Benoit Monin - 2017 - Journal of Mathematical Logic 17 (1):1750004.
    We investigate the role of continuous reductions and continuous relativization in the context of higher randomness. We define a higher analogue of Turing reducibility and show that it interacts well with higher randomness, for example with respect to van Lambalgen’s theorem and the Miller–Yu/Levin theorem. We study lowness for continuous relativization of randomness, and show the equivalence of the higher analogues of the different characterizations of lowness for Martin-Löf randomness. We also characterize computing higher [Formula: see text]-trivial sets by higher (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  3
    The Trouble with Thinking: People Want to Have Quick Reactions to Personal Taboos.Anna C. Merritt & Benoît Monin - 2011 - Emotion Review 3 (3):318-319.
    If lay theories associate moral intuitions with deeply held values, people should feel uncomfortable relying on deliberative thinking when judging violations of personal taboos. In two preliminary studies, participants with siblings of the opposite sex were particularly troubled when evaluating a sibling incest scenario under instructions to think slowly and rationally, or when the scenario was presented in a hard-to-read font forcing them to employ deliberative processing. This suggests that we may be intuitive intuitionists, and opens the door for investigations (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5.  50
    Two More Characterizations of K-Triviality.Noam Greenberg, Joseph S. Miller, Benoit Monin & Daniel Turetsky - 2018 - Notre Dame Journal of Formal Logic 59 (2):189-195.
    We give two new characterizations of K-triviality. We show that if for all Y such that Ω is Y-random, Ω is -random, then A is K-trivial. The other direction was proved by Stephan and Yu, giving us the first titular characterization of K-triviality and answering a question of Yu. We also prove that if A is K-trivial, then for all Y such that Ω is Y-random, ≡LRY. This answers a question of Merkle and Yu. The other direction is immediate, so (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  90
    Are Mental States Assessed Relative to What Most People “Should” or “Would” Think? Prescriptive and Descriptive Components of Expected Attitudes.Tamar A. Kreps, Benoît Monin & Joshua Knobe - 2010 - Behavioral and Brain Sciences 33 (4):341.
    For Knobe, observers evaluate mental states by comparing agents' statements with the attitudes they are expected to hold. In our analysis, Knobe's model relies primarily on what agents should think, and little on expectancies of what they would think. We show the importance and complexity of including descriptive and prescriptive norms if one is to take expectancies seriously.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  7.  4
    Genericity and Randomness with Ittms.Benoît Monin & Paul-Elliot Anglès D’Auriac - 2019 - Journal of Symbolic Logic 84 (4):1670-1710.
    We study genericity and randomness with respect to ITTMs, continuing the work initiated by Carl and Schlicht. To do so, we develop a framework to study randomness in the constructible hierarchy. We then answer several of Carl and Schlicht’s question. We also ask a new question one the equality of two classes of randoms. Although the natural intuition would dictate that the two classes are distinct, we show that things are not as simple as they seem. In particular we show (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8.  7
    $\Pi ^{0}_{1}$ -Encodability and Omniscient Reductions.Benoit Monin & Ludovic Patey - 2019 - Notre Dame Journal of Formal Logic 60 (1):1-12.
    A set of integers A is computably encodable if every infinite set of integers has an infinite subset computing A. By a result of Solovay, the computably encodable sets are exactly the hyperarithmetic ones. In this article, we extend this notion of computable encodability to subsets of the Baire space, and we characterize the Π10-encodable compact sets as those which admit a nonempty Σ11-subset. Thanks to this equivalence, we prove that weak weak König’s lemma is not strongly computably reducible to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark