Modern methodology furnishes two partly competitive and partly complementary views on structure of the development of scientific investigation. According to the first view the development of science consists in enlargement of the set of empirical theorems; according to the other it consists, rather, in the narrowing of the set of possible theoretical hypotheses. A particular kind of assertion is associated with each of these views. The first is associated with the relation of assertion expressed in the statement: “the state α (...) of scientific investigationB forces us to accept the statement Τ”. The other view is associated with the relation of assertion expressed in the statement: “the state α of scientific investigationB admits the acceptance of the statement Τ”. Under a suitable definition of forcing we obtain the conclusion that intuitionistic logic is the class of only those formulas which we are forced to accept by every state of every scientific investigation. The notion of admission under a certain definition analogically leads to intuitionistic logic; on the other hand in the case of another, more natural definition, it leads to justification of a certain system of strict implication which is stronger than Lewis’ system S4 and which overlaps system S5.It can be said that assuming quite a natural definition of admission this system contains only those formulas the acceptance of which is admitted by every state of every scientific investigation. (shrink)

Grzegorczyk's modal logic corresponds to the class of upwards well-founded partially ordered Kripke frames, however all known proofs of this fact utilize some form of the Axiom of Choice; G. Boolos asked in [1], whether it is provable in plain ZF. We answer his question negatively: Grz corresponds to a class of frames, which does not provably coincide with upwards well-founded posets in ZF alone.

In his 1953's paper, Grzegorczyk proved that a certain kind of relation classes of Grzegorczyk's hierarchy could be characterized inductively. We give a simpler version of this characterization.

A theorem published by A. Grzegorczyk in 1955 states a certain kind of effective uniform continuity of computable functionals whose values are natural numbers and whose arguments range over the total functions in the set of the natural numbers and over the natural numbers. Namely, for any such functional a computable functional with one function-argument and the same number-arguments exists such that the values of the first of the functionals at functions dominated by a given one are completely determined (...) by their restrictions to numbers not exceeding the corresponding values of the second functional at the given function. We prove versions of this theorem for the class of the primitive recursive functionals and for the class of the elementary recursive ones. Analogous results can be proved for many other subrecursive classes of functionals. (shrink)

Given a class ℱ oft otal functions in the set oft he natural numbers, one could study the real numbers that have arbitrarily close rational approximations explicitly expressible by means of functions from ℱ. We do this for classes ℱsatisfying certain closedness conditions. The conditions in question are satisfied for example by the class of all recursive functions, by the class of the primitive recursive ones, by any of the Grzegorczyk classes ℰnwith n ≥ 2, by the (...) class of all functions recursive in a given function and by the class of the functions primitive recursive in it, as well as by the class of all total functions in the set of the natural numbers. (shrink)

A basis for a set C of functions on natural numbers is a set F of functions such that C is the closure with respect to substitution of the projection functions and the functions in F. This paper introduces three new bases, comprehending only common functions, for the Grzegorczyk classes ℰ_n with n ≥ 3. Such results are then applied in order to show that ℰ_{n+1} = K_n for n ≥ 2, where {K_n}n∈ℕ is the Axt hierarchy.

This is the first, out of two papers, devoted to Andrzej Grzegorczyk’s point-free system of topology from Grzegorczyk :228–235, 1960. https://doi.org/10.1007/BF00485101). His system was one of the very first fully fledged axiomatizations of topology based on the notions of region, parthood and separation. Its peculiar and interesting feature is the definition of point, whose intention is to grasp our geometrical intuitions of points as systems of shrinking regions of space. In this part we analyze separation structures and (...) class='Hi'>Grzegorczyk structures, and establish their properties which will be useful in the sequel. We prove that in the class of Urysohn spaces with countable chain condition, to every topologically interpreted representative of a point in the sense of Grzegorczyk’s corresponds exactly one point of a space. We also demonstrate that Tychonoff first-countable spaces give rise to complete Grzegorczyk structures. The results established below will be used in the second part devoted to points and topological spaces. (shrink)

In the second installment to Gruszczyński and Pietruszczak we carry out an analysis of spaces of points of Grzegorczyk structures. At the outset we introduce notions of a concentric and \-concentric topological space and we recollect some facts proven in the first part which are important for the sequel. Theorem 2.9 is a strengthening of Theorem 5.13, as we obtain stronger conclusion weakening Tychonoff separation axiom to mere regularity. This leads to a stronger version of Theorem 6.10. Further, we (...) show that Grzegorczyk points are maximal contracting filters in the sense of De Vries, but the converse inclusion is not necessarily true. We also compare the notions of a Grzegorczyk point and an ultrafilter, and establish several properties of topological spaces based on Grzegorczyk structures. The main results of the paper are representation and completion theorems for G-structures. We prove both set-theoretical and topological representation theorems for various classes of G-structures. We also present topological object duality theorem for the class of complete G-structures and the class of concentric spaces, both restricted to structures which satisfy countable chain condition. We conclude the paper with proving equivalence of the original Grzegorczyk axiom with the one accepted by us as axiom. (shrink)

A family of formal intuitionistic theories is proposed with realizability of proved formulas in several subrecursive classes, e.g. Grzegorczyk classes, polynomial-time computable functions class, etc. xA) Algorithm extraction forxyA is shown for various classes of bounded complexity. The results on polynomial computability are closely connected to work on the Bounded Arithmetic by S. Buss.

In the present paper the well-known Gödels – Churchs argument concerning the undecidability of logic (of the first order functional calculus) is exhibited in a way which seems to be philosophically interestingfi The natural numbers are not used. (Neither Chinese Theorem nor other specifically mathematical tricks are applied.) Only elementary logic and very simple set-theoretical constructions are put into the proof. Instead of the arithmetization I use the theory of concatenation (formalized by Alfred Tarski). This theory proves to be an (...) appropriate tool. The decidability is defined directly as the property of graphical discernibility of formulas. (shrink)

Recent years have seen the appearance of many English-language hand books of logic and numerous monographs on topical discoveries in the foundations of mathematics. These publications on the foundations of mathematics as a whole are rather difficult for the beginners or refer the reader to other handbooks and various piecemeal contribu tions and also sometimes to largely conceived "mathematical fol klore" of unpublished results. As distinct from these, the present book is as easy as possible systematic exposition of the now (...) classical results in the foundations of mathematics. Hence the book may be useful especially for those readers who want to have all the proofs carried out in full and all the concepts explained in detail. In this sense the book is self-contained. The reader's ability to guess is not assumed, and the author's ambition was to reduce the use of such words as evident and obvious in proofs to a minimum. This is why the book, it is believed, may be helpful in teaching or learning the foundation of mathematics in those situations in which the student cannot refer to a parallel lecture on the subject. This is also the reason that I do not insert in the book the last results and the most modem and fashionable approaches to the subject, which does not enrich the essential knowledge in founda tions but can discourage the beginner by their abstract form. A. G. (shrink)

Die „Grundlage der gesamten Wissenschaftslehre“ bleibt für den, der Fichte im philosophiegeschichtlichen Zusammenhang sehen will, der wichtigste Text; dies gilt auch dann noch, wenn die Akademie-Ausgabe abgeschlossen sein wird. Der Jenaer Fichte hat nicht nur auf seine Zeitgenossen am stärksten gewirkt, er war auch seinerseits damals noch am offensten für Einflüsse. Der vorliegende Kommentar – der erste, der den gesamten deutschen Text behandelt – bietet keine Paraphrase, keine Übersetzung in eine zeitgemäßere Sprache, keine „Darstellung“, die Fichtes Disposition durch eine eigene (...) ersetzt und damit – gewollt oder ungewollt – in Konkurrenz zum Original tritt. Er will vielmehr den Leser auf seinem dornigen Pfad Satz für Satz begleiten und bei keiner Schwierigkeit im Stich lassen. Die konkrete Erforschung literarischer Bezüge und Abhängigkeiten zeigt, wie sehr der „Selbstdenker“ Fichte – unbeschadet seiner Eigenständigkeit – nicht nur in der Philosophie, sondern im ganzen Geistesleben der Epoche verwurzelt ist. Durch die ausgiebigen, mit sprachlichen Erläuterungen versehenen Zitate entlegener Quellen ist der Kommentar zugleich eine Art Lesebuch. (shrink)

W artykule proponuje się aksjomatyzację fragmentu klasycznej logiki zdań, który zostaje nazwany logiką niesymplifikacyjną. Nazwa pochodzi stąd, że unika się w nim, jak przypuszcza pewna ilość badaczy – wskazanych w tekście – paradoksalnych własności klasycznej implikacji i równoważności. Twierdzenie o niewyprowadzalności tez paradoksalnych nie jest jeszcze definitywnie udowodnione. Ale cały bieg myśli wydaje się interesujący z filozoficznego punktu widzenia ze względu na możliwość odróżnienia kilku rodzajów implikacji i równoważności.

The author reflects on the moral attitudes displayed by Poles fighting in the Warsaw Uprising. He believes that the sacrifice and selflessness with which Varsovians battled for their city had its roots in the general mentality of the Poles, who for generations had been raised in the spirit of “mutual and willing endowment”. He also notes that the noble ideals of the wartime generations have today been largely replaced by mercenary selfishness.

The author reflects on the moral attitudes displayed by Poles fighting in the Warsaw Uprising. He believes that the sacrifice and selflessness with which Varsovians battled for their city had its roots in the general mentality of the Poles, who for generations had been raised in the spirit of “mutual and willing endowment”. He also notes that the noble ideals of the wartime generations have today been largely replaced by mercenary selfishness.