This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

9 found
Order:
  1. Self-Referential Theories.Samuel A. Alexander - forthcoming - Journal of Symbolic Logic:1-25.
    We study the structure of families of theories in the language of arithmetic extended to allow these families to refer to one another and to themselves. If a theory contains schemata expressing its own truth and expressing a specific Turing index for itself, and contains some other mild axioms, then that theory is untrue. We exhibit some families of true self-referential theories that barely avoid this forbidden pattern.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  2. A Logic for Factive Ignorance.Ekaterina Kubyshkina & Mattia Petrolo - forthcoming - Synthese:1-12.
    In the current debate there are two epistemological approaches to the definition of ignorance: the Standard View and the New View. The former defines ignorance simply as not knowing, while the latter defines it as the absence of true belief. One of the main differences between these two positions lies in rejecting (Standard View) or in accepting (New View) the factivity of ignorance, i.e., if an agent is ignorant of φ, then φ is true. In the present article, we first (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  3. Measuring the Intelligence of an Idealized Mechanical Knowing Agent.Samuel Alexander - 2020 - Lecture Notes in Computer Science 12226.
    We define a notion of the intelligence level of an idealized mechanical knowing agent. This is motivated by efforts within artificial intelligence research to define real-number intelligence levels of compli- cated intelligent systems. Our agents are more idealized, which allows us to define a much simpler measure of intelligence level for them. In short, we define the intelligence level of a mechanical knowing agent to be the supremum of the computable ordinals that have codes the agent knows to be codes (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  4. A History Based Logic for Dynamic Preference Updates.Can Başkent & Guy McCusker - 2020 - Journal of Logic, Language and Information 29 (3):275-305.
    History based models suggest a process-based approach to epistemic and temporal reasoning. In this work, we introduce preferences to history based models. Motivated by game theoretical observations, we discuss how preferences can dynamically be updated in history based models. Following, we consider arrow update logic and event calculus, and give history based models for these logics. This allows us to relate dynamic logics of history based models to a broader framework.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5. Vagueness and Imprecise Credence.Anna Mahtani - 2019 - In Richard Dietz (ed.), Vagueness and Rationality in Language Use and Cognition. Springer Verlag. pp. 7-30.
    In this paper I investigate an alternative to imprecise probabilism. Imprecise probabilism is a popular revision of orthodox Bayesianism: while the orthodox Bayesian claims that a rational agent’s belief-state can be represented by a single credence function, the imprecise probabilist claims instead that a rational agent’s belief-state can be represented by a set of such functions. The alternative that I put forward in this paper is to claim that the expression ‘credence’ is vague, and then apply the theory of supervaluationism (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. Towards Paraconsistent Inquiry.Can Baskent - 2016 - Australasian Journal of Logic 13 (2).
    In this paper, we discuss Hintikka’s theory of interrogative approach to inquiry with a focus on bracketing. First, we dispute the use of bracketing in the interrogative model of inquiry arguing that bracketing provides an indispensable component of an inquiry. Then, we suggest a formal system based on strategy logic and logic of paradox to describe the epistemic aspects of an inquiry, and obtain a naturally paraconsistent system. We then apply our framework to some cases to illustrate its use.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7. Some Non-Classical Approaches to the Brandenburger–Keisler Paradox.Can Başkent - 2015 - Logic Journal of the IGPL 23 (4):533-552.
  8. A Dynamic Epistemic Logic with a Knowability Principle.Michael Cohen - 2015 - In Logic, Rationality, and Interaction. LORI 2015. Lecture Notes in Computer Science. Berlin: Springer. pp. 406-410.
    A dynamic epistemic logic is presented in which the single agent can reason about his knowledge stages before and after announcements. The logic is generated by reinterpreting multi agent private announcements in a single agent environment. It is shown that a knowability principle is valid for such logic: any initially true ϕ can be known after a certain number of announcements.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  9. On Knowledge and Obligation.Can Başķent, Loes Olde Loohuis & Rohit Parikh - 2012 - Episteme 9 (2):171-188.
    This article provides a brief overview of several formal frameworks concerning the relation between knowledge on the one hand, and obligation on the other. We discuss the paradox of the knower, knowledge based obligation, knowingly doing, deontic dynamic epistemology, descriptive obligations, and responsibilities as dynamic epistemology.
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark