Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

Znaleziono wyników: 4

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

A Post-style proof of completeness theorem for symmetric relatedness Logic S

100%

Klonowski M.

Bulletin of the Section of Logic

2018

tom 47

nr 3

One of the logic defined by Richard Epstein in a context of an analysis of subject matter relationship is Symmetric Relatedness Logic S. In the monograph [2] we can find some open problems concerning relatedness logic, a Post-style completeness theorem for logic S is one of them. Our paper introduces a solution of this metalogical issue.

Rozumowanie Mistrza a determinizm, rec. z: Tomasz Jarmużek, Jutrzejsza bitwa morska. Rozumowanie Diodora Kronosa, Wydawnictwo Naukowe UMK, Toruń 2013.

100%

Klonowski M.

Analiza i Egzystencja. Czasopismo Filozoficzne

2016

tom 33

109-116

Recenzja książki: Tomasz Jarmużek, Jutrzejsza bitwa morska. Rozumowanie Diodora Kronosa, Wydawnictwo Naukowe UMK, Toruń 2013.

The Problem of Logical Omniscience: An Alternative to Non-normal Worlds

63%

Klonowski M. , Krawczyk K.

Filozofia Nauki

2019

tom 27

nr 1

27-48

In this paper, we bring up the problem of logical omniscience in epistemic logic. One way of avoiding the problem is through Rantala models, where non-normal worlds are introduced. Such models are vulnerable to criticism, as we show. One of many issues that occur is the Bjerring result, which states that incorporating non-normal worlds makes the agent logically incompetent. For this reason, we propose a different solution based on positional logics.

Bayesian Propositional Logic

51%

Jarmużek T. , Klonowski M. , Malinowski J.

Bulletin of the Section of Logic

2017

tom 46

nr 3/4

We define and investigate from a logical point of view a family of consequence relations defined in probabilistic terms. We call them relations of supporting, and write: |≈w where w is a probability function on a Boolean language. A |≈w B iff the fact that A is the case does not decrease a probability of being B the case. Finally, we examine the intersection of |≈w , for all w, and give some formal properties of it.