For a free filter F on $$\omega $$ ω, endow the space $$N_F=\omega \cup \{p_F\}$$ N F = ω ∪ { p F }, where $$p_F\not \in \omega $$ p F ∉ ω, with the topology in which every element of $$\omega $$ ω is isolated whereas all open neighborhoods of $$p_F$$ p F are of the form $$A\cup \{p_F\}$$ A ∪ { p F } for $$A\in F$$ A ∈ F. Spaces of the form $$N_F$$ N F constitute the (...) class of the simplest non-discrete Tychonoff spaces. The aim of this paper is to study them in the context of the celebrated Josefson–Nissenzweig theorem from Banach space theory. We prove, e.g., that, for a filter F, the space $$N_F$$ N F carries a sequence $$\langle \mu _n:n\in \omega \rangle $$ ⟨ μ n : n ∈ ω ⟩ of normalized finitely supported signed measures such that $$\mu _n(f)\rightarrow 0$$ μ n ( f ) → 0 for every bounded continuous real-valued function f on $$N_F$$ N F if and only if $$F^*\le _K{\mathcal {Z}}$$ F ∗ ≤ K Z, that is, the dual ideal $$F^*$$ F ∗ is Katětov below the asymptotic density ideal $${\mathcal {Z}}$$ Z. Consequently, we get that if $$F^*\le _K{\mathcal {Z}}$$ F ∗ ≤ K Z, then: (1) if X is a Tychonoff space and $$N_F$$ N F is homeomorphic to a subspace of X, then the space $$C_p^*(X)$$ C p ∗ ( X ) of bounded continuous real-valued functions on X contains a complemented copy of the space $$c_0$$ c 0 endowed with the pointwise topology, (2) if K is a compact Hausdorff space and $$N_F$$ N F is homeomorphic to a subspace of K, then the Banach space C(K) of continuous real-valued functions on K is not a Grothendieck space. The latter result generalizes the well-known fact stating that if a compact Hausdorff space K contains a non-trivial convergent sequence, then the space C(K) is not Grothendieck. (shrink)

This volume is written jointly by Witold Marciszewski, who contributed the introductory and the three subsequent chapters, and Roman Murawski who is the author of the next ones - those concerned with the 19th century and the modern inquiries into formalization, algebraization and mechanization of reasonings. Besides the authors there are other persons, as well as institutions, to whom the book owes its coming into being. The study which resulted in this volume was carried out in the Historical (...) Section of the research project _Logical Systems and Algorithms for Automatic Testing of Reasoning,_ 1986-1990, in which participated nine Polish universities; the project was coordinated by the Department of Logic, Methodology and Philosophy of Science of the Bia??l??ystok Branch of the University of Warsaw, and supported by the Ministry of Education 1987). The major part of the project was focussed on the software for computer-aided theorem proving called Mizar MSE ) due to Dr. Andrzej Trybulec. He and other colleagues deserve a grateful mention for a hands-on experience and theoretical stimulants owed to their collaboration. (shrink)

The affirmative answer to the title question is justified in two ways: logical and empirical. The logical justification is due to Gödel’s discovery that in any axiomatic formalized theory, having at least the expressive power of PA, at any stage of development there must appear unsolvable problems. However, some of them become solvable in a further development of the theory in question, owing to subsequent investigations. These lead to new concepts, expressed with additional axioms or rules. Owing to the so-amplified (...) axiomatic basis, new routine procedures like algorithms, can be reached. Those, in turn, help to gain new insights which lead to still more powerful axioms, and consequently again to ampler algorithmic resources. Thus scientific progress proceeds to an ever higher scope of solvability. The existence of such feedback cycles –in a formal way rendered with Turing’s systems of logic based on ordinal – gets empirically supported by the history of mathematics and other exact sciences. An instructive instance of such a process is found in the history of the number zero. Without that insight due to some ancient Hindu mathematicians there could not arise such an axiomatic theory as PA. It defines the algorithms of arithmetical operations, which in turn help intuitions; those, inturn, give rise to algorithmic routines, not available in any of the previous phases of the process in question. While the logical substantiation of the point of this essay is a well-established result of logico-semantic inquiries, its empiricalclaim, based on historical evidences, remains open for discussion. Hence the author’s intention to address philosophers and historians of science, and to encourage their critical responses. (shrink)

We discuss the existence of universal spaces (either in the sense of embeddings or continuous images) for some classes of scattered Eberlein compacta. Given a cardinal κ, we consider the class Sκ of all scattered Eberlein compact spaces K of weight ≤ κ and such that the second Cantor-Bendixson derivative of K is a singleton. We prove that if κ is an uncountable cardinal such that κ = 2<κ, then there exists a space X in Sκ such that every member (...) of Sκ is homeomorphic to a retract of X. We show that it is consistent that there does not exist a universal space (either by embeddings or by mappings onto) in Sω₁. Assuming that ∂ = ω₁, we prove that there exists a space X ∈ Sω₁, which is universal in the sense of embeddings. We also show that it is consistent that there exists a space X ∈ Sω₁, universal in the sense of embeddings, but Sω₁ does not contain an universal element in the sense of mappings onto. (shrink)

CHAPTER ONE On the Rhetorical Point of View. Why rhetoric declined, and what remained of it. Once upon a time rhetoric was a vast and influential branch of ...

The first good message is to the effect that people possess reason as a source of intellectual insights, not available to the senses, as e.g. axioms of arithmetic. The awareness of this fact is called rationalism. Another good message is that reason can daringly quest for and gain new plausible insights. Those, if suitably checked and confirmed, can entail a revision of former results, also in mathematics, and - due to the greater efficiency of new ideas - accelerate science’s progress. (...) The awareness that no insight is secured against revision, is called fallibilism. This modern fallibilistic rationalism, i.e. the belief in the attainability of inviolable truths of reason which would forever constitute the foundations of knowledge. Fallibilistic rationalism is based on the idea that any problem-solving consists in processing information. Its results vary with respect to informativeness and its reverse - certainty. It is up to science to look for highly informative solutions, in spite of their uncertainty, and then to make them more certain through testing against suitable evidence. To account for such cognitive processes, one resorts to the conceptual apparatus of logic, informatics, and cognitive science. (shrink)

When discussing Kazimierz Ajdukiewicz's role in philosophy, it is worthwhile recalling his participation in scholarly controversies. It was characteristic of his open mind that his taking part in debates was motivated by a vivid interest in various ways of thinking. Ajdukiewicz's intellectual power consisted, so to speak, in his ability of not to understand. This ability has brought him success in some important debates, concerning i.a. the classical logical concept of contradiction and the debate on universals raised in modern Poland (...) with the nominalistic program of Stanislaw Lesniewski and Tadeusz Kotarbiński. In this latter debate Ajdukiewicz shows that when one says that individuals exist, the word „exist" refers to something different that in the statement that universals exist. In other words, the functor „is" has a different category in the definition of an individual from that appearing in the definition of a universal; hence there must be two different senses of the word „exist". (shrink)

There seems to be something mysterious about applications of for- mal systems, including those of logic, to empirical reality 1 . If logic is to be applied to empirical situations, like those described in an ordinary lan- guage, then { it seems to some people { its statements cannot be necessary, or analytic, propositions. However, they are both applicable and necessary. This supposed puzzle constitutes a signicant part of the problem of philo- sophical foundations of logic 2 . To this (...) mind of the present writer, there is no mystery of applications, since any empirical, or even ostensive, predicate can be involved in cer- tain meaning postulates, e.g. \No red is green", which are both empirical and necessary propositions; empirical as they involve ostensibly dened predicated; necessary, as it is enough to know their meaning to state, their validity. The case of logical theorems can be considered at the same footing, logical constants being treated as dened ostensively. Nevertheless, not an individual state of mind but the actual state of scholarly discussions makes something a problem; in the present state of foundational discussions on logic, the \mystery of applications" preserves its vitality, hence any new way of dealing with it proves welcome. (shrink)

Zwrot \"Mathesis Universalis\" (MU) oznacza projekt unifikacji całości wiedzy za pomocą metody matematycznej. Powstał on pod tą nazwą u progu nowożytności, a częściowo miał antycypacje w starożytności i średniowieczu. Głównymi jego rzecznikami byli Kartezjusz i Leibniz. Podejście Leibniza jest radykalnie formalistyczne, a przez to nadające sie do realizacji maszynowej, podczas gdy Kartezjusza - zdecydowanie antyformalistyczne. Artykuł koncentruje się na projekcie Leibniza jako tym, który ma kontynuację w nauce współczesnej. Zamysł, żeby narzędziem realizacji projektu była uniwersalna symbolika i rachunek logiczny jest (...) obecnie realizowany w odniesieniu do całości matematyki za pomocą środków, które jako pierwszy stworzył Gottlob Frege (1879). Istotny wkład ma Georg Cantor jako autor teorii mocy zbiorów, która wprowadza odróżnienie zbioru nieskończonego przeliczalnie od zbioru o mocy kontinuum. Umożliwia to dowód fundamentalnego dla współczesnej MU twierdzenia o istnieniu problemów nierozstrzygalnych w arytmetyce, co jest dziełem Kurta Gödla, oraz w logice. To drugie wykazał Alan Turing, dowodząc, że zbiór realizowalnych przez maszynę programów do dokonywania obliczeń, czyli do rozstrzygania problemu, jaka jest wartość określonej funkcji, jest tylko przeliczalny, podczas gdy zbiór problemów do rozstrzygnięcia ma moc kontinuum; stąd wynika, że pewne problemy są nierozstrzygalne w sposób formalny czyli maszynowy, co z kolei implikuje nierozstzygalność logiki. Analogiczny wynik Gödla ma ważne dopełnienie w jego twierdzeniu, że ograniczenia rozstrzygalności są tylko względne (w stosunku do określonego systemu formalnego) i mogą być przezwyciężane przez konstrukcję nowych pojęć pierwotnych, aksjomatów i metod postępowania badawczego. Rysuje się więc przed nauką możliwość nieustannego postępu. Takie dynamiczne ujęcie stanowi rys istotnie różniący współczesną postać MU od klasycznej, którą cechowała statyczność. (shrink)

The paper is meant as a survey of issues in computational complexity from the standpoint of its relevance to social research. Moreover, the threads are hinted at that lead to computer science from mathematical logic and from philosophical questions about the limits and the power both of mathematics and the human mind. Especially, the paper addresses Turing's idea of oracle, considering its impact on computational (i.e., relying on simulations) economy, sociology etc. Oracle is meant as a device capable of finding (...) the values of uncomputable functions. Such an idealized entity is exemplified by the human mind's procedure of recognizing the truth of the Gödelian sentence, of identifying uncomputable numbers through Turing's diagonal procedure, etc. Since such procedures are strictly defined and are as reliable as any calculations, they are worth to be called computation as well. From the computation in the strict sense, that defined as purely algorithmic (mechanical) process, one distinguishes them with the term "hipercomputation". Now the following questions arise. - Are there undecidable problems (ie. not decidable with appropriate algorithms) in social research as are (according to what is reported esp. By S. Wolfram) in natural sciences? The answer in the negative would impose limitations on computer simulations (as entirely relying on algorithms). - If there are, then we have the next question: can such problems be addressed with hipercomputational procedures? - How such hipercomputational procedures would be related to analog computation (coextensive, everlappiing, etc.)? Another set of issues is stated in terms of tractability of decidable problems, that is, the efficiency of algorithms needed for solutions. As inefficient are regarded those which require more resources (time, memory, etc.) than is available in a foreseeable future. In this context, one discusses methods of such an efficient organizing computational processes to overcome the scarcity of resources; thus parallel, distributive, interactive, etc. computing are used as remedies. The paper claims, hinting at F.Hayek's ideas, that in some social systems (e.g., stock exchange, and free market in general) such an efficient organization of their computational activities spontaneously evolves. And this is the main source of its advantages over the central economic planning (as defended by O. Lange). This noticing (in terms of complexity theory) of analogy between Hayek's point and the current discussion of efficiency of algorithms is what may count as an original contribution of the present paper. (shrink)

Intelligent problem-solving depends on consciously applied methods of thinking as well as inborn or trained skills. The latter are like resident programs which control processes of the kind called (in Unix) daemons. Such a computational process is a fitting reaction to situations (defined in the program in question) which is executed without any command of a computer user (or without any intention of the conscious subject). The study of intelligence should involve methods of recognizing those beliefs whose existence is due (...) to daemons. Once having been aware of so produced belief, one can assess it critically and, if possible and necessary, make it more rational. Eg, beliefs concerning properties of time are produced by a daemon-like intuition, likewise the Euclidean properties of space. The merit of getting aware of such daemon's activities, and so transforming implicit beliefs into explicit ones, lies mainly in the axiomatic characterization of the properties involved. That makes possible to improve a daemon-like conceptual equipment (producing beliefs) by suitable modifications of the axioms, or postulates. Such postulate sets can also define artificial daemons to either emulate or improve natural intelligence. (shrink)