Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 66 (2000), S. 1-4 
    ISSN: 1572-8730
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 56 (1996), S. 323-360 
    ISSN: 1572-8730
    Keywords: circumscription ; honesty ; modal logic ; partial models ; stable sets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract We propose an epistemic logic in which knowledge is fully introspective and implies truth, although truth need not imply epistemic possibility. The logic is presented in sequential format and is interpreted in a natural class of partial models, called balloon models. We examine the notions of honesty and circumscription in this logic: What is the state of an agent that ‘only knows ϕ’ and which honest ϕ enable such circumscription? Redefining stable sets enables us to provide suitable syntactic and semantic criteria for honesty. The rough syntactic definition of honesty is the existence of a minimal stable expansion, so the problem resides in the ordering relation underlying minimality. We discuss three different proposals for this ordering, together with their semantic counterparts, and show their effects on the induced notions of honesty.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Annals of mathematics and artificial intelligence 27 (1999), S. 25-47 
    ISSN: 1573-7470
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We give a general approach to characterizing minimal information in a modal context. Our modal treatment can be used for many applications, but is especially relevant under epistemic interpretations of the operator □. Relative to an arbitrary modal system, we give three characterizations of minimal information and provide conditions under which these characterizations are equivalent. We then study information orders based on bisimulations and Ehrenfeucht–Fraïssé games. Moving to the area of epistemic logics, we show that for one of these orders almost all systems trivialize the notion of minimal information. Another order which we present is much more promising as it permits to minimize with respect to positive knowledge. In S5, the resulting notion of minimal knowledge coincides with well‐established proposals. For S4 we compare the two orders.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...