Analizy przeprowadzone w artykule pozwalają na wyciągnięcie wniosków, ważnych dla filozofa przyrody. Między filozofią a naukami przyrodniczymi istnieje interakcja, którą można określić jako współprzenikanie się obu tych dziedzin wiedzy. To współoddziaływanie filozofii z nauką podobne jest do niedomykającego się koła. Trudno jest owo współprzenikanie jednoznacznie scharakteryzować, ale można wskazać pewne idee towarzyszące mu. Uświadomienie sobie filozoficznego uwikłania teorii naukowej powoduje często rozszerzenie jej rozumienia oraz ujawnia, jak wiele informacji zawartych jest w teorii naukowej na temat głębokiej struktury świata. Sformułowanie „filozofia (...) w nauce” można by uznać za charakterystyczne dla współczesnego ujmowania związku filozofii z naukami przyrodniczymi. Należy pamiętać, że wspólna droga filozofii i nauk przyrodniczych pozwala osiągać interesujące poznawczo wyniki, ważne dla rozumienia świata zewnętrznego. Współprzenikanie się filozofii z nauk jest procesem dynamicznym i twórczym. Tak filozofia, jak i nauka, ulegają ciągłym zmianom, które w istotny sposób wpływają na rozwijanie się procesu współprzenikania. Trudno jest przewidywać, w którą stronę ten proces będzie ewoluował. Ważne jest jednak, jak twierdzi M. Heller, aby w tym twórczym procesie dostrzec, że największym sukcesem nauk empirycznych, trwającym do dziś, jest coraz lepsze ugruntowanie się przekonania, że Wszechświat stopniowo, choć tylko w przybliżeniu, ujawnia nam tajemnice swojej struktury. -------------- Zgłoszono: 12/09/2020. Zrecenzowano: 10/10/2020. Zaakceptowano do publikacji: 29/10/2020. (shrink)

The class of equivalential logics comprises all implicative logics in the sense of Rasiowa [9], Suszko's logic SCI and many others. Roughly speaking, a logic is equivalential iff the greatest strict congruences in its matrices are determined by polynomials. The present paper is the first part of the survey in which systematic investigations into this class of logics are undertaken. Using results given in [3] and general theorems from the theory of quasi-varieties of models [5] we give a characterization of (...) all simple C-matrices for any equivalential logic C. In corollaries we give necessary and sufficient conditions for the class of all simple models for a given equivalential logic to be closed under free products. (shrink)

In the late forties, Stanisław Jaśkowski published two papers onthe discursive sentential calculus, D2. He provided a definition of it by an interpretation in the language of S5 of Lewis. The knownaxiomatization of D2 with discursive connectives as primitives was introduced by da Costa, Dubikajtis and Kotas in 1977. It turns out, however,that one of the axioms they used is not a thesis of the real Jaśkowski’s calculus. In fact, they built a new system, D∗2 for short, that differs from (...) D2 inmany respects. The aim of this paper is to introduce a direct Kripke-type semantics for the system, axiomatize it in a new way and prove soundness andcompleteness theorems. Additionally, we present labelled tableaux for D∗2.1. (shrink)

We are facing a crisis of trust in expertise today. Fewer and fewer people trust experts, and more and more politicians openly ignore expert consensus. 'Democracy in the Post-Truth Era' asks what might happen to democracy if we reject the fundamental liberal assumption that people are capable of making informed choices. The book explores the potential impact on society if people, including politicians, never appreciate the relevance of expert opinions. What if people cannot choose between supporters and opponents of key (...) issues such as the causes of climate change, effectiveness of vaccines and ways of combating economic and social crises? Applying social epistemology to these questions, the book considers whether democracy can be defended in the post-truth era. (shrink)

The class of equivalential logics comprises all implicative logics in the sense of Rasiowa [9], Suszko's logicSCI and many Others. Roughly speaking, a logic is equivalential iff the greatest strict congruences in its matrices (models) are determined by polynomials. The present paper is the first part of the survey in which systematic investigations into this class of logics are undertaken. Using results given in [3] and general theorems from the theory of quasi-varieties of models [5] we give a characterization of (...) all simpleC-matrices for any equivalential logicC (Theorem I.14). In corollaries we give necessary and sufficient conditions for the class of all simple models for a given equivalential logic to be closed under free products (Theorem I.18). (shrink)

In this paper, we present a calculus of paraconsistent logic. We propose an axiomatisation and a semantics for the calculus, and prove several important meta-theorems. The calculus, denoted as CB1, is an extension of systems PI, C min and B1, and a proper subsystem of Sette’s calculus P1. We also investigate the generalization of CB1 to the hierarchy of related calculi.

The "space" of Lascar strong types, on some sort and relative to a given complete theory T, is in general not a compact Hausdorff topological space. We have at least three aims in this paper. The first is to show that spaces of Lascar strong types, as well as other related spaces and objects such as the Lascar group Gal L of T, have well-defined Borel cardinalities. The second is to compute the Borel cardinalities of the known examples as well (...) as of some new examples that we give. The third is to explore notions of definable map, embedding, and isomorphism, between these and related quotient objects. We also make some conjectures, the main one being roughly "smooth if and only if trivial". The possibility of a descriptive set-theoretic account of the complexity of spaces of Lascar strong types was touched on in the paper [E. Casanovas, D. Lascar, A. Pillay and M. Ziegler, Galois groups of first order theories, J. Math. Logic1 305–319], where the first example of a "non-G-compact theory" was given. The motivation for writing this paper is partly the discovery of new examples via definable groups, in [A. Conversano and A. Pillay, Connected components of definable groups and o-minimality I, Adv. Math.231 605–623; Connected components of definable groups and o-minimality II, to appear in Ann. Pure Appl. Logic] and the generalizations in [J. Gismatullin and K. Krupiński, On model-theoretic connected components in some group extensions, preprint, arXiv:1201.5221v1]. (shrink)

Let [Formula: see text] be a monster model of an arbitrary theory [Formula: see text], let [Formula: see text] be any tuple of bounded length of elements of [Formula: see text], and let [Formula: see text] be an enumeration of all elements of [Formula: see text]. By [Formula: see text] we denote the compact space of all complete types over [Formula: see text] extending [Formula: see text], and [Formula: see text] is defined analogously. Then [Formula: see text] and [Formula: see (...) text] are naturally [Formula: see text]-flows. We show that the Ellis groups of both these flows are of bounded size, providing an explicit bound on this size. Next, we prove that these Ellis groups do not depend on the choice of the monster model [Formula: see text]; thus, we say that these Ellis groups are absolute. We also study minimal left ideals of the Ellis semigroups of the flows [Formula: see text] and [Formula: see text]. We give an example of a NIP theory in which the minimal left ideals are of unbounded size. Then we show that in each of these two cases, boundedness of a minimal left ideal is an absolute property and that whenever such an ideal is bounded, then in some sense its isomorphism type is also absolute. Under the assumption that [Formula: see text] has NIP, we give characterizations of when a minimal left ideal of the Ellis semigroup of [Formula: see text] is bounded. Then we adapt the proof of Theorem 5.7 in Definably amenable NIP groups, J. Amer. Math. Soc. 31 609–641 to show that whenever such an ideal is bounded, a certain natural epimorphism 863–932]) from the Ellis group of the flow [Formula: see text] to the Kim–Pillay Galois group [Formula: see text] is an isomorphism. We also obtain some variants of these results, formulate some questions, and explain differences which occur when the flow [Formula: see text] is replaced by [Formula: see text]. (shrink)

In the first section logics with an algebraic semantics are investigated. Section 2 is devoted to subdirect products of matrices. There, among others we give the matrix counterpart of a theorem of Jónsson from universal algebra. Some positive results concerning logics with, finite degrees of maximality are presented in Section 3.

We solve two problems from a work of Haskel and Pillay concerning maximal stable quotients of groups ∧-definable in NIP theories. The first result says that if G is a ∧-definable group in a distal theory, then Gst=G00 (where Gst is the smallest ∧-definable subgroup with G∕Gst stable, and G00 is the smallest ∧-definable subgroup of bounded index). In order to get it, we prove that distality is preserved under passing from T to the hyperimaginary expansion Theq. The second result (...) is an example of a group G definable in a nondistal NIP theory for which G=G00, but Gst is not an intersection of definable groups. Our example is a saturated extension of (R,+,[0,1]). Moreover, we make some observations on the question whether there is such an example which is a group of finite exponent. We also take the opportunity and give several characterizations of stability of hyperdefinable sets involving continuous logic. (shrink)

In the paper we study the class of weakly algebraizable logics, characterized by the monotonicity and injectivity of the Leibniz operator on the theories of the logic. This class forms a new level in the non-linear hierarchy of protoalgebraic logics.

This book is both suitable for logically and algebraically minded graduate and advanced graduate students of mathematics, computer science and philosophy, and ...

The paper is a response to recent criticisms of agatheism, a new pluralistic interpretation of religious belief put forward by Janusz Salamon with the aim of accommodating the epistemological challenge of religious diversity. Agatheism is an axiologically grounded religious belief which identifies God, the Absolute or the ultimate reality religiously conceived with the ultimate good as the ultimate end of all human agency and thus an explanation of its irreducibly teleological character and a source of its meaning. Janusz (...) Salamon argues that this grounding of religious belief in the human axiological consciousness makes it immune to falsification by any future science. Replying to the concerns of the critics about about irrationality of doxastic commitment to a particular religious tradition, Janusz Salamon argues that to the extent the fundamental agatheistic religious belief is presupposed in such tradition as its doxastic core, its belief system - if internally coherent and aligned with a worldview that is consistent with undisputed scientific findings - may be considered rational, despite there being a plurality of such belief systems. (shrink)

We introduce and study model-theoretic connected components of rings as an analogue of model-theoretic connected components of definable groups. We develop their basic theory and use them to describe both the definable and classical Bohr compactifications of rings. We then use model-theoretic connected components to explicitly calculate Bohr compactifications of some classical matrix groups, such as the discrete Heisenberg group ${\mathrm {UT}}_3({\mathbb {Z}})$, the continuous Heisenberg group ${\mathrm {UT}}_3({\mathbb {R}})$, and, more generally, groups of upper unitriangular and invertible upper triangular (...) matrices over unital rings. (shrink)

The paper is conceived as a first study on the Suszko operator. The purpose of this paper is to indicate the existence of close relations holding between the properties of the Suszko operator and the structural properties of the model class for various sentential logics. The emphasis is put on generality both of the results and methods of tackling the problems that arise in the theory of this operator. The attempt is made here to develop the theory for non-protoalgebraic logics.

The paper is conceived as a first study on the Suszko operator. The purpose of this paper is to indicate the existence of close relations holding between the properties of the Suszko operator and the structural properties of the model class for various sentential logics. The emphasis is put on generality both of the results and methods of tackling the problems that arise in the theory of this operator. The attempt is made here to develop the theory for non-protoalgebraic logics.

In the paper we study the class of weakly algebraizable logics, characterized by the monotonicity and injectivity of the Leibniz operator on the theories of the logic. This class forms a new level in the non-linear hierarchy of protoalgebraic logics.

In 1953, Jerzy Kalinowski published his paper on the logic of normative sentences. The paper is recognized as one of the first publications on the formal system of deontic logic. The aim of this paper is to present a tableau system for Kalinowski’s deontic logic and to discuss some of the topics related to the paradoxes of deontic logic.

We generalize the model theory of small profinite structures developed by Newelski to the case of compact metric spaces considered together with compact groups of homeomorphisms and satisfying the existence of m-independent extensions (we call them compact e-structures). We analyze the relationships between smallness and different versions of the assumption of the existence of m-independent extensions and we obtain some topological consequences of these assumptions. Using them, we adopt Newelski's proofs of various results about small profinite structures to compact e-structures. (...) In particular, we notice that a variant of the group configuration theorem holds in this context. A general construction of compact structures is described. Using it, a class of examples of compact e-structures which are not small is constructed. It is also noticed that in an m-stable compact e-structure every orbit is equidominant with a product of m-regular orbits. (shrink)

The first known statements of the deduction theorems for the first-order predicate calculus and the classical sentential logic are due to Herbrand [8] and Tarski [14], respectively. The present paper contains an analysis of closure spaces associated with those sentential logics which admit various deduction theorems. For purely algebraic reasons it is convenient to view deduction theorems in a more general form: given a sentential logic C (identified with a structural consequence operation) in a sentential language I, a quite arbitrary (...) set P of formulas of I built up with at most two distinct sentential variables p and q is called a uniform deduction theorem scheme for C if it satisfies the following condition: for every set X of formulas of I and for any formulas and , C(X{{a}}) iff P(, ) AC(X). [P(, ) denotes the set of formulas which result by the simultaneous substitution of for p and for q in all formulas in P]. The above definition encompasses many particular formulations of theorems considered in the literature to be deduction theorems. Theorem 1.3 gives necessary and sufficient conditions for a logic to have a uniform deduction theorem scheme. Then, given a sentential logic C with a uniform deduction theorem scheme, the lattices of deductive filters on the algebras A similar to the language of C are investigated. It is shown that the join-semilattice of finitely generated (= compact) deductive filters on each algebra A is dually Brouwerian. (shrink)

The class Matr(C) of all matrices for a prepositional logic (, C) is investigated. The paper contains general results with no special reference to particular logics. The main theorem (Th. (5.1)) which gives the algebraic characterization of the class Matr(C) states the following. Assume C to be the consequence operation on a prepositional language induced by a class K of matrices. Let m be a regular cardinal not less than the cardinality of C. Then Matr (C) is the least class (...) of matrices containing K and closed under m-reduced products, submatrices, matrix homomorphisms, and matrix homomorphic counter-images. (shrink)

This article attempts to answer the question: what has the current migration crisis revealed in relations between Christianity and Islam, two religions with common Abrahamic roots? What conclusions can be drawn about the state of these relations, particularly with regard to ordinary members of the two religions? How should we assess the reaction of Christians in Europe to the inflow of refugees from Muslim countries in the light of the Gospel, the Second Vatican Council and the teaching of Pope Francis?The (...) article consists of four parts. Part I briefly presents Christian-Muslim relationships over the centuries. Part II focuses on the sense of danger occurring in European societies in connection with the influx of Muslims during the migration crisis. Part III presents the teachings of the Second Vatican Council about Islam and Part IV describes Pope Francis’s attitude towards refugees from Muslim countries. (shrink)

This volume explores the range of Alfred North Whitehead's philosophy and his relevance to contemporary philosophical traditions.

The aim of the article is to present the attempts of establishing institutions of a system of worker’s self-management in the selected countries of the so-called real socialism system in Eastern Europe. The analysis considers three of those countries, namely Yugoslavia, Poland and Hungary, whose experiences in participation of the employees’ implementation were the most significant. Particular attention was paid to the evolution of socialist regimes approach to workers’ self-management. The paper tries to answer the question whether workers’ self-management posed (...) a threat to the socialist regimes persistence. The research method used in the study is an indepth survey and analysis of literature and legal acts. (shrink)

PurposeThe purpose of this paper is, firstly, an analysis of the behavior of entities operating in the virtual space which has emerged and has been continuously developing around the internet and, secondly, to create a framework of the impact of these entities on an organization, especially in the context of emerging new ethical challenges. The motivation for undertaking this research was a lack of literature on such a holistic approach to this important problem facing contemporary organizations and the systematization of (...) these issues.Design/methodology/approachThe framework proposed in the paper was developed based on analyses of case studies of organizations from various industries which use the internet and the inter‐related mobile infrastructure. To create this framework the stakeholder theory and the cost‐benefit analysis approach were used.FindingsThe basic findings of the paper include a classification of the entities operating in e‐space and a taxonomy of the possible influences they may have on an organization. It is intended that the proposed framework be tested in selected industries.Practical implicationsIt seems that the holistic approach presented in this paper has significant practical implications for the increasing number of organizations utilizing the on‐line environment in their business practices, offering them a far better understanding of the whole complexity of problems and challenges connected with the e‐economy phenomena.Originality/valueThe new and original aspects of the paper are the introduction and defining of the term e‐space; a classification of the elements operating there and the proposal of a taxonomy of the possible types of influence of these entities on an organization. (shrink)

The notion of local deduction theorem (which generalizes on the known instances of indeterminate deduction theorems, e.g. for the infinitely-valued ukasiewicz logic C ) is defined. It is then shown that a given finitary non-pathological logic C admits the local deduction theorem iff the class Matr(C) of all matrices validating C has the C-filter extension property (Theorem II.1).