Search (3 results, page 1 of 1)

0.009139037 = product of:
  0.036556147 = sum of:
    0.036556147 = weight(_text_:digital in 3267) [ClassicSimilarity], result of:
      0.036556147 = score(doc=3267,freq=4.0), product of:
        0.19770671 = queryWeight, product of:
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.050121464 = queryNorm
        0.18490088 = fieldWeight in 3267, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.0234375 = fieldNorm(doc=3267)
  0.25 = coord(1/4)

Content

Semantic information and the network theory of account. Introduction ; The nature of the upgrading problem : mutual independence ; Solving the upgrading problem : the network theory of account ; Advantages of a network theory of account ; Testing the network theory of account -- Consciousness, agents, and the knowledge game. Introduction ; The knowledge game ; The first and classic version of the knowledge game : externally inferable states ; The second version of the knowledge game ; The third version of the knowledge game ; The fourth version of the knowledge game ; Dretske's question and the knowledge game -- Against digital ontology. Introduction ; What is digital ontology : It from bit ; The thought experiment ; Three objections and replies -- A defense of informational structural realism. Introduction ; First step : ESR and OSR are not compatible ; Second step : Relata are not logically prior to all relations ; Third step : the concept of a structural object is not empty ; Informational structural realism ; Ten objections and replies.

0.0076571116 = product of:
  0.030628446 = sum of:
    0.030628446 = weight(_text_:library in 6997) [ClassicSimilarity], result of:
      0.030628446 = score(doc=6997,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.23240642 = fieldWeight in 6997, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.0625 = fieldNorm(doc=6997)
  0.25 = coord(1/4)

Source

Electronic library. 14(1996) no.6, S.509-514

0.004785695 = product of:
  0.01914278 = sum of:
    0.01914278 = weight(_text_:library in 5710) [ClassicSimilarity], result of:
      0.01914278 = score(doc=5710,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.14525402 = fieldWeight in 5710, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5710)
  0.25 = coord(1/4)

Abstract

Purpose The purpose of this paper is to review and discuss Luciano Floridi's 2019 book The Logic of Information: A Theory of Philosophy as Conceptual Design, the latest instalment in his philosophy of information (PI) tetralogy, particularly with respect to its implications for library and information studies (LIS). Design/methodology/approach Nine scholars with research interests in philosophy and LIS read and responded to the book, raising critical and heuristic questions in the spirit of scholarly dialogue. Floridi responded to these questions. Findings Floridi's PI, including this latest publication, is of interest to LIS scholars, and much insight can be gained by exploring this connection. It seems also that LIS has the potential to contribute to PI's further development in some respects. Research limitations/implications Floridi's PI work is technical philosophy for which many LIS scholars do not have the training or patience to engage with, yet doing so is rewarding. This suggests a role for translational work between philosophy and LIS. Originality/value The book symposium format, not yet seen in LIS, provides forum for sustained, multifaceted and generative dialogue around ideas.