Argumentem indukcyjnym w retoryce jest paradygmat ; paradygmat jednak nie polega na przechodzeniu od wielu szczegółowych przypadków do pewnego uogólnienia, czyli uniwersalizacji wszystkich poszczególnych przypadków — jak normalnie w argumentacji z indukcji — lecz jest przejściem od jednego szczegółu do szczegółu innego, podobnego, przy czym wymaganym warunkiem jest to, że jeden i drugi konkretny przypadek należą do tego samego rodzaju. Paradygmat zatem nie jest indukcją w znaczeniu ścisłym, ale wydaje się bardziej spełniać warunki analogii. W artykule zostaje sformułowana teza, że (...) u Arystotelesa występują trzy rodzaje wnioskowań: dedukcja, indukcja i wnioskowanie z przykładu; dla zaprezentowania specyfiki wnioskowania przez paradygmat są także analizowane różne typy wnioskowań, tzn. sylogizm apodeiktyczny, dialektyczny, indukcyjny, aby na tym tle wykazać odrębność wnioskowań przez paradygmat, które wydają się być pewnym rodzajem analogii. Prezentowany więc artykuł jest próbą podania charakterystyki i specyfiki argumentacji przez paradygmat u Arystotelesa w świetle jego Retoryki oraz pism logicznych. (shrink)

This book stands at the intersection of two topics: the decidability and computational complexity of hybrid logics, and the deductive systems designed for them. Hybrid logics are here divided into two groups: standard hybrid logics involving nominals as expressions of a separate sort, and non-standard hybrid logics, which do not involve nominals but whose expressive power matches the expressive power of binder-free standard hybrid logics.The original results of this book are split into two parts. This division reflects the division of (...) the book itself. The first type of results concern model-theoretic and complexity properties of hybrid logics. Since hybrid logics which we call standard are quite well investigated, the efforts focused on hybrid logics referred to as non-standard in this book. Non-standard hybrid logics are understood as modal logics with global counting operators ) whose expressive power matches the expressive power of binder-free standard hybrid logics. The relevant results comprise: 1. Establishing a sound and complete axiomatization for the modal logic K with global counting operators ), which can be easily extended onto other frame classes, 2. Establishing tight complexity bounds, namely NExpTime-completeness for the modal logic with global counting operators defined over the classes of arbitrary, reflexive, symmetric, serial and transitive frames ), MT), MD), MB), MK4) with numerical subscripts coded in binary. Establishing the exponential-size model property for this logic defined over the classes of Euclidean and equivalential frames ), MS5).Results of the second type consist of designing concrete deductive systems for standard and non-standard hybrid logics. More precisely, they include: 1. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for a rich class of binder-free standard hybrid logics. An interesting feature of indicated calculi is the nonbranching character of the rule, 2. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for non-standard hybrid logics. The internalization technique applied to a tableau calculus for the modal logic with global counting operators is novel in the literature, 3. Devising the first hybrid algorithm involving an inequality solver for modal logics with global counting operators. Transferring the arithmetical part of reasoning to an inequality solver turned out to be sufficient in ensuring termination.The book is directed to philosophers and logicians working with modal and hybrid logics, as well as to computer scientists interested in deductive systems and decision procedures for logics. Extensive fragments of the first part of the book can also serve as an introduction to hybrid logics for wider audience interested in logic.The content of the book is situated in the areas of formal logic and theoretical computer science with some elements of the theory of computational complexity. (shrink)

One of the crucial elements of philosophising at the beginning of the twentieth century is the problem of grounding of philosophy. Representatives of neo-Kantianism fit in with this trend. They try to describe the grounding of philosophy by referring to the philosophy of Kant. That, however, raises a number of difficulties of interpretation that result from the appearing possibilities of interpretation. The article is an attempt to show the efforts of Hermann Cohen, who emphasized the importance of transcendental deduction and (...) transcendental apperception in Kant’s system. In accordance with the thesis of Fichte, Cohen searches for a basis that would allow building a system of knowledge and finds it is the concept of hypothesis. (shrink)