Switch to: References

Add citations

You must login to add citations.
  1. Another Look at the Problem of the Unexpected Examination.Matthew H. Kramer - 1999 - Dialogue 38 (3):491-.
    RÉSUMÉ: Les philosophes, au cours des cinquante dernières années, se sont efforcés de démontrer qu’un professeur peut, d’une manière cohérente et exacte, annoncer à ses étudiants qu’un examen surprise aura lieu lors d’une journée non spécifiée d’une période donnée, le problème étant qu’une telle annonce peut sembler s’annuler ellemême lorsqu’elle est soumise à une induction régressive. Deux grandes approches, l’une épistémique et l’autre logique, one été développées à ce propos. Le présent article adopte une approche logique, mais repose aussi d’une (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • An Illocutionary Logical Explanation of the Surprise Execution.John Kearns - 1999 - History and Philosophy of Logic 20 (3-4):195-213.
    This paper further develops the system of illocutionary logic presented in ?Propositional logic of supposition and assertion? (Notre Dame Journal of Formal Logic 1997, 38, 325-349) to accommodate an ?I believe that? operator and resolve Moore's Paradox. This resolution is accomplished by providing both a truth-conditional and a commitment-based semantics. An important feature of the logical system is that the correctness of some arguments depends on who it is that makes the argument. The paper then shows that the logical system (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Is there a nonrecursive decidable equational theory?Benjamin Wells - 2002 - Minds and Machines 12 (2):301-324.
    The Church-Turing Thesis (CTT) is often paraphrased as ``every computable function is computable by means of a Turing machine.'' The author has constructed a family of equational theories that are not Turing-decidable, that is, given one of the theories, no Turing machine can recognize whether an arbitrary equation is in the theory or not. But the theory is called pseudorecursive because it has the additional property that when attention is limited to equations with a bounded number of variables, one obtains, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation