K denotes both the knowledge predicate satisfied by every currently known theorem and the finite set of all currently known theorems. The set K is time-dependent, publicly available, and contains theorems both from formal and constructive mathematics. Any theorem of any mathematician from past or present forever belongs to K. Mathematical statements with known constructive proofs exist in K separately and form the set K_c⊆K. We assume that mathematical sets are atemporal entities. They exist formally in ZFC theory although their (...) properties can be time-dependent (when they depend on K) or informal. The true statement "K is non-empty" is outside K forever because K is not a formal set. Paul Cohen proved in 1963 that the equality 2^{\aleph_0}=\aleph_1 is independent of ZFC. Before 1963, the statement "There is a known constructively defined integer n⩾1 such that 2^{\aleph_0}=\aleph_n" was outside K. Since 1963, this statement is outside K forever. The true statement "There exists a set X⊆{1,...,49} such that card(X)=6 and X never occurred as the winning six numbers in the Polish Lotto lottery" refers to the current non-mathematical knowledge and is outside K forever. In Martin-Löf's terminology, every currently known theorem is actually true whereas every theorem (known or unknown) is potentially true. Actual truth is knowledge dependent and tensed. Potential truth is knowledge independent and tenseless. Algorithms always terminate. We explain the distinction between algorithms whose existence is provable in ZFC and constructively defined algorithms which are currently known. By using this distinction, we obtain non-trivially true statements on decidable sets X⊆N that belong to constructive and informal mathematics and refer to the current mathematical knowledge on X. For every such statement, its truth concerning the current mathematical knowledge is implied by a true statement of the form: (the conjunction of i conditions of the form α∈K)∧(the conjunction of j conditions of the form β∉K)∧(the conjunction of k conditions of the form γ∈K_c)∧(the conjunction of l conditions of the form δ∉K_c), where i,j,k,l∈N and α,β,γ,δ are mathematical statements. In constructive mathematics and the traditional Brouwerian intuitionism, the truth of a mathematical statement means that we know a constructive proof. Therefore, the truth of a mathematical statement depends on time, where the statement is formally stated in the classical mathematics without the predicate K. In this article, mathematical statements on decidable sets X⊆N refer to time because they refer to the current mathematical knowledge on X. They cannot be formally stated in the classical mathematics without the predicate K and their logical values may change in time. For a set X⊆N whose infiniteness is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(X)=ω" is outside K. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove the assumption of the above statement. We prove that the set X={n∈N: the interval [-1,n] contains more than 29.5+(11!/(3n+1))∙sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. We present a table that shows satisfiable conjunctions of the form #(Condition1)∧(Condition 2)∧#(Condition 3)∧(Condition 4)∧#(Condition 5), where # denotes the negation ¬ or the absence of any symbol. We prove that there exists a naturally defined set C⊆N which satisfies the following conditions (6)-(11). (6) A known and simple algorithm for every k∈N decides whether or not k∈C. (7) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(C)=ω" is outside K. (8) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(N\C)=ω" is outside K. (9) It is conjectured, though so far unproven, that C is infinite. (10) For every known algorithm A with no input, the statement "A returns an integer n satisfying card(C)<ω ⇒ C⊆(-∞,n]" is outside K. (11) For every known algorithm A with no input, the statement "A returns an integer m satisfying card(N\C)<ω ⇒ N\C⊆(-∞,m]" is outside K. The set C={k∈N: 2^{2^k}+1 is composite} is naturally defined and satisfies conditions (6)-(11). (shrink)

As it is broadly accepted, typical uses of demonstratives are accompanied by demonstrations. The concept of demonstration, however, manifests the action–product ambiguity analogous to that visible in the opposition between jumping and the resulting jump, talking and the resulting talk or crying and the resulting cry. It is also a heterogeneous concept that enables demonstrations to vary significantly. The present paper discusses action–product ambiguity as applied to demonstrations as well as the heterogeneity of the latter. An account that acknowledges ambiguity (...) and heterogeneity of demonstrations is sketched in the paper. It is argued that it has a rich explanatory and descriptive potential. (shrink)

Yuri Matiyasevich's theorem states that the set of all Diophantine equations which have a solution in non-negative integers is not recursive. Craig Smoryński's theorem states that the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable. Let R be a subring of Q with or without 1. By H_{10}(R), we denote the problem of whether there exists an algorithm which for any given Diophantine equation with integer coefficients, can decide whether (...) or not the equation has a solution in R. We prove that a positive solution to H_{10}(R) implies that the set of all Diophantine equations with a finite number of solutions in R is recursively enumerable. We show the converse implication for every infinite set R \subseteq Q such that there exist computable functions \tau_1,\tau_2:N \to Z which satisfy (\forall n \in N \tau_2(n) \neq 0) \wedge ({\frac{\tau_1(n)}{\tau_2(n)}: n \in N}=R). This implication for R=N guarantees that Smoryński's theorem follows from Matiyasevich's theorem. Harvey Friedman conjectures that the set of all polynomials of several variables with integer coefficients that have a rational solution is not recursive. Harvey Friedman conjectures that the set of all polynomials of several variables with integer coefficients that have only finitely many rational solutions is not recursively enumerable. These conjectures are equivalent by our results for R=Q. (shrink)

English title: The Issue of Evil in Philosophy of Józef Tischner. The paper presents several understandings of evil distinguished by Józef Tischner, like the axiological evil, agathological evil and structural evil. While exposing the phenomenological approach of Tischner, Gadacz discusses evil as ‘a phantom’ that accompanies the very source form of experience which, according to Tischner, stands for the episode of meeting another man. In this perspective evil as a ghost proves to be the source experience as well, alike the (...) episode of meeting being the source of happening of the good and freedom. Therefore, the original experience does not inform us whether something exists or it should be such and so, but rather tells us that there is something which ought not to be. (shrink)

The paper aims to add contextual dependence to the new directival theory of meaning, a functional role semantics based on Kazimierz Ajdukiewicz’s directival theory of meaning. We show that the original formulation of the theory does not have a straight answer on how the meaning of indexicals and demonstratives is established. We illustrate it in the example of some problematic axiomatic and inferential directives containing indexicals. We show that the main reason why developing the new directival theory of meaning in (...) this direction is difficult is that the theory focuses on the notion of a sentence (and not the notion of an utterance). To add the latter notion to the theory, we introduce the idea of admissible contextual distribution being an interpretation of the hybrid expression view on indexicals and demonstratives. We argue that this idea introduces a small but important modification to the concept of language matrix and gives way to define two distinct concepts of meaning: for an expression type and for a use of an expression type. (shrink)

Let f(1)=2, f(2)=4, and let f(n+1)=f(n)! for every integer n≥2. Edmund Landau's conjecture states that the set P(n^2+1) of primes of the form n^2+1 is infinite. Landau's conjecture implies the following unproven statement Φ: card(P(n^2+1))<ω ⇒ P(n^2+1)⊆[2,f(7)]. Let B denote the system of equations: {x_j!=x_k: i,k∈{1,...,9}}∪{x_i⋅x_j=x_k: i,j,k∈{1,...,9}}. The system of equations {x_1!=x_1, x_1 \cdot x_1=x_2, x_2!=x_3, x_3!=x_4, x_4!=x_5, x_5!=x_6, x_6!=x_7, x_7!=x_8, x_8!=x_9} has exactly two solutions in positive integers x_1,...,x_9, namely (1,...,1) and (f(1),...,f(9)). No known system S⊆B with a finite (...) number of solutions in positive integers x_1,...,x_9 has a solution (x_1,...,x_9)∈(N\{0})^9 satisfying max(x_1,...,x_9)>f(9). For every known system S⊆B, if the finiteness/infiniteness of the set {(x_1,...,x_9)∈(N\{0})^9: (x_1,...,x_9) solves S} is unknown, then the statement ∃ x_1,...,x_9∈N\{0} ((x_1,...,x_9) solves S)∧(max(x_1,...,x_9)>f(9)) remains unproven. Let Λ denote the statement: if the system of equations {x_2!=x_3, x_3!=x_4, x_5!=x_6, x_8!=x_9, x_1 \cdot x_1=x_2, x_3 \cdot x_5=x_6, x_4 \cdot x_8=x_9, x_5 \cdot x_7=x_8} has at most finitely many solutions in positive integers x_1,...,x_9, then each such solution (x_1,...,x_9) satisfies x_1,...,x_9≤f(9). The statement Λ is equivalent to the statement Φ. It heuristically justifies the statement Φ . This justification does not yield the finiteness/infiniteness of P(n^2+1). We present a new heuristic argument for the infiniteness of P(n^2+1), which is not based on the statement Φ. Algorithms always terminate. We explain the distinction between existing algorithms (i.e. algorithms whose existence is provable in ZFC) and known algorithms (i.e. algorithms whose definition is constructive and currently known). Assuming that the infiniteness of a set X⊆N is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. *** (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) No known algorithm with no input returns the logical value of the statement card(X)=ω. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. *** Conditions (2)-(5) hold for X=P(n^2+1). The statement Φ implies Condition (1) for X=P(n^2+1). The set X={n∈N: the interval [-1,n] contains more than 29.5+\frac{11!}{3n+1}⋅sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. 501893∈X. Condition (1) holds with n=501893. card(X∩[0,501893])=159827. X∩[501894,∞)= {n∈N: the interval [-1,n] contains at least 30 primes of the form k!+1}. We present a table that shows satisfiable conjunctions of the form #(Condition 1) ∧ (Condition 2) ∧ #(Condition 3) ∧ (Condition 4) ∧ #(Condition 5), where # denotes the negation ¬ or the absence of any symbol. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove this assumption. (shrink)

Leon Koj napisał w zakończeniu do Problemów semiotyki logicznej, że nie sposób sobie wyobrazić semiotyki w Polsce bez Jerzego Pelca. Można opinię tę rozumieć tak, że Jerzy Pelc wywarł na semiotykę polską wpływ, bez którego to, co w niej najlepsze, nie przybrałoby nigdy formy rozwiniętej, nie ujrzałoby światła dziennego oraz nie znalazłoby odbicia w dydaktyce uniwersyteckiej. Jest to opinia trafna, a rozprawy zawarte w niniejszym – poświęconym Jerzemu Pelcowi – tomie Studiów Semiotycznych są oznakami tego wpływu.

Let G be an additive subgroup of ℂ, let Wn = {xi = 1, xi + xj = xk: i, j, k ∈ {1, …, n }}, and define En = {xi = 1, xi + xj = xk, xi · xj = xk: i, j, k ∈ {1, …, n }}. We discuss two conjectures. If a system S ⊆ En is consistent over ℝ, then S has a real solution which consists of numbers whose absolute values belong to (...) [0, 22n –2]. If a system S ⊆ Wn is consistent over G, then S has a solution ∈ n in which |xj| ≤ 2n –1 for each j. (shrink)

Review of the book: Jakub Kloc-Konkołowicz, Anerkennung als Verpflichtung. Klassische Konzepte der Anerkennung und ihre Bedeutungfür die aktuelle Debate, Königshausen & Neumann, Würzburg 2015.

The aim of this paper is to discuss theories that attempt to single out the class of intentional states by appealing to factors that are supposedly criterial for intentional sentences. The papers starts with distinguishing two issues that arise when one thinks about intentional expressions: the Taxonomy Problem and the Fundamental Demarcation Problem. The former concerns the relation between the classes of distinct intentional verbs and distinct intentional states. The latter concerns the question about how to distinguish intentional states and (...) acts from the non-intentional ones. Next, the general desiderata for theories providing criteria for singling out the class of intentional sentences are introduced. Finally, distinct proposals for providing such criteria are analyzed. Author argues that neither is satisfactory. (shrink)

In this paper, we argue that several recent ‘wide’ perspectives on cognition (embodied, embedded, extended, enactive, and distributed) are only partially relevant to the study of cognition. While these wide accounts override traditional methodological individualism, the study of cognition has already progressed beyond these proposed perspectives towards building integrated explanations of the mechanisms involved, including not only internal submechanisms but also interactions with others, groups, cognitive artifacts, and their environment. The claim is substantiated with reference to recent developments in the (...) study of “mindreading” and debates on emotions. We claim that the current practice in cognitive (neuro)science has undergone, in effect, a silent mechanistic revolution, and has turned from initial binary oppositions and abstract proposals towards the integration of wide perspectives with the rest of the cognitive (neuro)sciences. (shrink)

The British philosopher Michael Dummett (1925–2011) not only had a massive influence on the development of analytical philosophy within the philosophy of language, philosophy of mathematics, and metaphysics, but also contributed significantly to historical and metaphilosophical debates about the nature of this philosophical movement and its proper account. He proposed to define analytical philosophy as philosophy whose aim is the analysis of the structure of thought by way of the analysis of language. Hence, it is philosophy the gist of which (...) is the linguistic turn. A number of critics of this proposal (including Barry Smith, Peter Hylton, and Hans-Johann Glock) emphasised that Dummett’s proposal captures merely some features of this diversified and multifaceted philosophical tradition, and is far from being historically adequate. (shrink)

The paper discusses the answering machine puzzle and cases of non-standard uses of ‘I’. It offers an analysis of the phenomena that is conservative with respect to the Kaplanian account of indexicality. The point of departure of the paper is the observation that some proper indexicals have demonstrative uses. It is argued that treating some occurrences of ‘now’ as cases of such uses results in an intuitive and simple solution to the answering machine puzzle. At the same time, treating some (...) occurrences of ‘I’ in an analogous manner explains away the impression that some non-standard uses of ‘I’ enforce a modification of the standard semantics of the first-person pronoun. (shrink)

The article is mainly based on Tadeusz Czeżowski’s publication – “Metaethical considerations”, prepared to be printed but never published. This publication, however, is not a handbook of classical metaethics but a kind of generalization of ethical theories ordering in a way, all known until now ethical systems within philosophy. Thus, Czeżowski does not offer his metaethics as a section of traditional ethics but also as a kind of generalization of all ethics until now, and therefore, all systems worked out (...) within itself. In its essence “Metaethical considerations” is the concept of scientific ethics, regardless of anything that does not pass verification, subject of which are e.g. empirical science research results. (shrink)

Planning organizes our actions and conditions our effective-ness. To understand this philosophical hint better, the author investigates and juxtaposes two important accounts in action theory. He discusses the concept of a plan proposed by Tadeusz Kotarbiński in his praxiology (theory of efcient action), and the so called “planning theory of intention” by Michael E. Bratman. The conceptual meeting of these two proposals helps to remove aws in Kotarbiński’s action theory, it also shows the way, in which we can enrich (...) the idea of plans in the frame-work of intentions. Generally, praxiology occurs to be still an important perspective in action theory, which particularly shows how we can improve our understanding of planning when confronted with infuentialcontemporary accounts. (shrink)

The paper is an introductory essay to the Polish translation of M.E. Bratman’s paper The Fecundity of Planning Agency. Instead of summarizing the main drifts of Bratman’s work, the author tries to show a few important parallels between his approach to action theory and the so-called praxiology (or ‘theory of efficient action’) proposed by Tadeusz Kotarbinski. It occurs that there are important similarities between their approaches both to specific problems in action theory (as: concept of an agent, the role (...) of Buridan’s Ass, or mind-infusion of actions) and to the general question how to understood agency (norms of planning). A brief presentation of these similarities gives two central results. Firstly, it allows to interpret Bratman as a kind of praxiologist, and, secondly, it shows that praxiological thinking proposed by Kotarbinski is still a vital perspective in contemporary action theory. (shrink)

The structure of this paper is as follows. My starting point is psychological flexibility (henceforth, PF) as it has been presented in psychology. Here I offer a synthetic view which embraces the most crucial aspects of flexibility, and describes its functional roles and underlying mechanisms. Secondly, I move my attention onto the field of current action theory and discuss two elementary concepts we commonly use when describing our actions: intention and desire. Of course, there are many “theories of desire” and (...) there is no point in trying (nor even the option) to discuss all of them under one heading. To show where the question of PF sneaks into the scene of action theory, I explore the idea of the resistance of desire, as proposed by Timo Airaksinen. The second concept to investigate at this stage is intention. As in the previous case, it is plain that there are plenty of accounts of intentions and there are many roles they play in the phenomenology of action. For the purposes of this paper, we need only something that can be interpreted as an approach to PF. Such an approach can be found in the idea of stability of intention or a plan, discussed famously by Michael Bratman. According to my interpretation, these two ideas, resistance of desire and stability of intention, allow to initially understand some important aspects of PF in action theory. To get a slightly more comprehensive view – and to supplement the outcomes gained on the grounds of the analyses of these two accounts – I introduce, in the third step, the concept of plasticity which comes from the so-called praxiology proposed by Tadeusz Kotarbiński (Lvov-Warsaw School). I try to show how this concept is still feasible and how it may enrich current philosophical accounts of agential flexibility. The strategy behind this stage of the paper is to enrich the Bratmanian approach to psychological stability. The last part of the paper contains some remarks on the philosophical outcome of the interdisciplinary approach to PF. (shrink)

Kotarbiński is one of the leading figures in the Lvov-Warsaw school of Polish philosophy. We summarize the development of Kotarbiński’s thought from his early nominalism and ‘pansomatistic reism’ to the later doctrine of ‘temporal phases’. We show that the surface clarity and simplicity of Kotarbiński’s writings mask a number of profound philosophical difficulties, connected above all with the problem of giving an adequate account of the truth of contingent (tensed) predications. The paper will examine in particular the attempts to resolve (...) these difficulties on the part of Leśniewski. It will continue with an account of the relations of Kotarbińskian reism to the ontology of things or entia realia defended by the later Brentano. Kotarbiński’s identification of Brentano as a precursor of reism is, it will be suggested, at least questionable, and the paper will conclude with a more careful attempt to situate the Brentanian and Kotarbińskian ontologies within the spectrum of competing ontological views. (shrink)

Prior to Kripke's seminal work on the semantics of modal logic, McKinsey offered an alternative interpretation of the necessity operator, inspired by the Bolzano-Tarski notion of logical truth. According to this interpretation, `it is necessary that A' is true just in case every sentence with the same logical form as A is true. In our paper, we investigate this interpretation of the modal operator, resolving some technical questions, and relating it to the logical interpretation of modality and some views in (...) modal metaphysics. In particular, we present an hitherto unpublished solution to problems 41 and 42 from Friedman's 102 problems, which uses a different method of proof from the solution presented in the paper of Tadeusz Prucnal. (shrink)

In this paper I briefly discuss principles of “independent ethics” formulated and popularized by the Polish philosopher Tadeusz Kotarbiński. I focus on the notion of “conscience” which seems to play a fundamental role in this moral theory.

EN: Selection of Marczyński's interviews on philosophy and literature which were recorded in early 2007 for the purpose of his radio broadcast "Hortus (In)Conclusus." Includes interviews with: Marek Bieńczyk, Józef Bremer, Ihor Byczko, Andrij Dachnij, Anna Dziedzic, Mateusz Falkowski, Tadeusz Gadacz, Michał Głowiński, Dorota Hall, Serhij Jospenko, Wachtang Kebuładze, Zbigniew Kloch, Andrzej Kołakowski, Wasyl Lisowyj, Ołeksandr Majewskyj, Anton Marczynski, Julia Marczyńska, Wadym Menżulin, Zbigniew Mikołejko, Monika Milewska, Andrij Okara, Ihor Paśko, Adam Pomorski, Myrosła Popowycz, Jerzy Prokopiuk, Iryna Puchta, Barbara (...) Skarga, Dmytro Stepowyk, Władysław Stróżewski, Myrosław Trofymuk, Tomas Venclova, Jan Woleński, Taras Wozniak, Arkadiusz Żychliński. (shrink)

The study’s main thesis is that respect for some moral values is a condition for methodologically rational decisions, namely, decisions which do not satisfy the condition are either not methodologically rational at all, or not fully rational. The paper shows supporting arguments for the thesis in terms of the philosophical theories by Aristotle, Immanuel Kant, Tadeusz Kotarbiński, Max Weber, Jean-Paul Sartre and some other thinkers. Their presentation undergoes phenomenological analysis of the phenomenon of decision making.

Logical and philosophical literature provides different classifications of reasoning. In the Polish literature on the subject, for instance, there are three popular ones accepted by representatives of the Lvov-Warsaw School: Jan Łukasiewicz, Tadeusz Czeżowski and Kazimierz Ajdukiewicz (Ajdukiewicz in Logika pragmatyczna [Pragmatic Logic]. PWN, Warsaw (1965, 2nd ed. 1974). Translated as: Pragmatic Logic. Reidel & PWN, Dordrecht, 1975). The author of this paper, having modified those classifications, distinguished the following types of reasoning: (1) deductive and (2) non-deductive, and additionally (...) two types of them in each of the two, depending on the manner of combining their premises with the conclusion through the relation of classical logical entailment. Consequently, the four types of reasoning: unilateral deductive (incl. its sub-types: deductive inference and proof), bilateral deductive (incl. complete induction), and reductive (incl. the sub-types: explanation and verification), logically nonvaluable (incl. inference by analogy, statistic inference), correspond to four operators of derivability. They are defined formally on the ground of Tarski’s axiomatic theory of deductive systems, by means of the consequence operation _Cn_ (Tarski in Monatshefte Math Phys 37:361–404, 1930a, C R Soc Sci Lett Vars 23:22–29, 1930b). Also, certain metalogical properties of these operators are given, as well as their relations with Tarski’s consequence operations \(Cn^+\) ( \(Cn^+ = Cn\) ) and dual consequences \(Cn^{-1}\) (Słupecki in Zeszyty Naukowe Uniwersytetu Wrocławskiego Seria B Nr 3:33–40, 1959, Słupecki et al. in Stud Log 29:76–123, 1971, Wybraniec-Skardowska, in: Wybraniec-Skardowska, Bryll (eds) Z badań nad teorią zdań odrzuconych [Studies in the Theory of Rejected Propositions], Series B, Studia i Monografie, Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Opole, 1969), and \(Cn^-\) (Wójcicki in Bull Sect Log 2(2):54–57, 1973)). (shrink)

Book synopsis This book is devoted to the condition of the university under the pressures of globalization, with particular reference to Central Europe. It is intended as a companion volume for all those who combine their academic and disciplinary research with wider interests in the functioning of higher education institutions under the new pressures affecting Central Europe. Drawing on its interdisciplinary nature and the wide range of scholars involved, it intends to outline a useful map of new, often challenging, areas, (...) topics and concerns to be taken into account in rethinking the function of the university today. -/- Contents Contents: Philip G. Altbach: Academic Freedom: International Realities and Challenges - Richard Rorty: Does Academic Freedom Have Philosophical Presuppositions? - Stanley N. Katz: Can Liberal Education Cope? - Marek Kwiek: The State, the Market, and Higher Education. Challenges for the New Century - Roger Deacon/Ben Parker: The Schooling of Citizens, or the Civilizing of Society? - Tadeusz Buksinski: The University and Learning in a Situation of Depression - Martin Jay: The Menace of Consilience: Keeping the Disciplines Unreconciled - Voldemar Tomusk: Towards a Model of Higher Education Reform in Central and East Europe - Wolf Lepenies: Im Osten viel Neues. Wissenschafts- und Kulturpolitik für Europa - Zbigniew Drozdowicz: Academic Accreditation: a Polish Case Study - Marek Kwiek: The Nation-State, Globalization and the Modern Institution of the University. (shrink)

Der Aufsatz wurde zum Anlass des 25. Todestages von Hermann Buddensieg geschrieben. Es wird bestrebt an, die Gestalt dieses Übersetzers, Dichters, Literaturforschers, Philosophen und Publizisten zu erinnern. Es ist ein Versuch, die bisherigen Forschungsergebnisse zu sammeln und unser Wissen über die Aktivität eines Menschen zu ordnen, der in der Geschichte der Aufnahme der polnischen Literatur und Kultur in Deutschland eine Sonderstellung hat. Eine besondere Bedeutung wird seiner kongenialen Übertragung von Pan Tadeusz, seinem Vorsitz bei dem Mickiewicz-Gremium und der Redaktion (...) der „Mickiewicz-Blätter” zu geschrieben. (shrink)

„Ruch Filozoficzny” and the freedom of scientific research in Poland (in 1947-1957 years). Presented article refers to the situation in the Polish philosophy, which took place between 40-50 of the twentieth century. Author’s reflections are carried on the example of attempts to reactivate in the realities of war, the polish philosophical journal “Ruch Filozoficzny” founded in 1911 by Kazimierz Twardowski. Political conditions have made the magazine was renewed twice, at each time was the greatest merit of Tadeusz Czeżowski. He (...) was assisted by the other representatives of the Lvov-Warsaw School, who worked in various academic centers in Poland. The reconstruction of the history of the magazine in the postwar years, will be based on previously unpublished archival material. In its conclusions, the author tries to point out of great importance of independent from the political authorities publishers on development of Polish philosophy. (shrink)

This article explores the question of how the members of the Lvov-Warsaw School promoted values that can be regarded as components of so-called logical culture. The author argues that these values are strictly connected with science. With references to Łukasiewicz, Czeżowski, and Kotarbiński,the article explores how values shape the logical culture and determines society as directed towards values. The article connects the meta-philosophical perspective with the philosophical one.