Once regarded as cellular ‘debris’ extracellular vesicles (EVs) emerge as one of the most intriguing entities in cancer pathogenesis. Intercellular trafficking of EVs challenges the notion of cancer cell autonomy, and highlights the multicellular nature of such fundamental processes as stem cell niche formation, tumour stroma generation, angiogenesis, inflammation or immunity. Recent studies reveal that intercellular exchange mediated by EVs runs deeper than expected, and includes molecules causative for cancer progression, such as oncogenes (epidermal growth factor receptor, Ras), and tumour (...) suppressors (PTEN). The uptake of oncogenic EVs (oncosomes) by various cells may profoundly change their biology, signalling patterns and gene expression, and in some cases cause their overt tumorigenic conversion. Moreover, EVs circulating in blood and present in body fluids provide an unprecedented access to the molecular circuitry driving cancer cells, and new technologies are being developed to exploit this property as a source of unique cancer biomarkers. (shrink)

The paper is concerned with the old conjecture that there are infinitely many twin primes. In the paper we show that this conjecture is true, that is, it is true in the standard model of arithmetic. The proof is based on Rasiowa–Sikorski Lemma. The key role are played by the derived notion of a Rasiowa–Sikorski set and the method of forcing adjusted to arbitrary first–order languages. This approach was developed in the papers Czelakowski [ 4, 5 ]. The central idea (...) consists in constructing an appropriate countable model \(\textbf{A}\) of Peano arithmetic by means of a Rasiowa–Sikorski set. This model validates the twin prime conjecture. Since \(\textbf{A}\) is elementarily equivalent to the standard model, the conjecture follows. Thus the standard model validates the twin primes conjecture. More generally, it is shown that de Polignac’s conjecture has a positive solution. The paper employs methods borrowed from the contemporary mathematical logic. Such a ’logical’ approach may be viewed as a useful addition to the dominant methodology in number theory based on mathematical analysis. (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)

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.

We propose a new schema for the deduction theorem and prove that the deductive system S of a prepositional logic L fulfills the proposed schema if and only if there exists a finite set A(p, q) of propositional formulae involving only prepositional letters p and q such that A(p, p) L and p, A(p, q) s q.

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)

The main result of the present paper — Theorem 3 — establishes the equivalence of the interpolation and amalgamation properties for a large family of logics and their associated classes of matrices.

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)

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.

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)

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)

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).

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.

Any finite support iteration of posets with precalibre ℵ 1 which has the length of cofinality greater than ω 1 yields a model for the dual Borel conjecture in which the real line is covered by ℵ 1 strong measure zero sets.

Matematyczność fizyki jest zjawiskiem, którego obecność jest dla nas zaskakująca, ale które pozwala nam na poznanie przyrody poprzez analizę matematycznych struktur ją opisujących. Dotyczy to jednak wyłącznie fizyki. Stopień matematyzacji biologii jest niewielki, a próby użycia języka matematyki sprowadzają się w istocie do stosowania w biologii metod matematycznych, których używa się do opisu układów fizycznych. Jest prawdopodobne, że popełniamy w ten sposób błąd przypisując układom biologicznym cechy, których nie posiadają. Pojawiają się głosy, że biologia wymaga nowych metod matematycznych dostosowanych do (...) jej potrzeb, nie znanych z fizyki. Sądzę jednak, że z uwagi na specyfikę złożoności, którą reprezentują układy biologiczne, zamiast o matematyczności biologii należy mówić o jej algorytmiczności. Jako przykłady algorytmicznego podejścia można przywołać tak zwane modele osobnicze używane między innymi do opisu dynamik populacji lub metody modelowania fraktalnego stosowane do opisu złożoności geometrii i jej dynamiki skomplikowanych struktur biologicznych, takich jak na przykład drzewa. (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 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)