In the paper, pre-Hilbert algebras are defined as a generalization of Hilbert algebras (namely, a Hilbert algebra is just a pre-Hilbert algebra satisfying the property of antisymmetry). Pre-Hilbert algebras have been inspired by Henkin's Positive Implicative Logic. Their properties and characterizations are investigated. Some important results and examples are given. Moreover, positive implicative pre-Hilbert algebras are introduced and studied, their connections with some algebras of logic are presented. The hierarchies existing between the classes of algebras considered here are shown.

In the article I consider Hume's arguments against miracles and the notion of miracle. From Hume's perspective, miracles are violations of the laws of nature caused by the supernatural being or beings. In Part I of On Miracles Hume argues that miracles can never be believed by a rational person. In Part II he attempts to demonstrate that there is actually no evidence for a miracle. Using distinction between laws of nature and scientific laws, and the deductive-nomological model of explanation, (...) I come to some conclusions. (shrink)

Książka stanowi wprowadzenie do twórczości Richarda Rorty'ego, a także próbę osadzenia jej na szerszym tle filozofii współczesnej, ze szczególnym uwzględnieniem filozofii postmodernistycznej. Obecne są w niej szersze analizy stanu kultury współczesnej, a także relacje z istotnych koncepcji obecnych we współczesnej humanistyce, bez których nie można zrozumieć ewolucji współczesnej humanistyki i specjalnej roli, jaką odegrała w niej filozofia Richarda Rorty'ego.

The main aim of the present paper is to explain a nature of relationships exist between Nelson and Heyting algebras. In the realization, a topological duality theory of Heyting and Nelson algebras based on the topological duality theory of Priestley for bounded distributive lattices are applied. The general method of construction of spaces dual to Nelson algebras from a given dual space to Heyting algebra is described. The algebraic counterpart of this construction being a generalization of the Fidel-Vakarelov construction is (...) also given. These results are applied to compare the equational category N of Nelson algebras and some its subcategories with the equational category H of Heyting algebras. It is proved that the category N is topological over the category H. (shrink)

This book provides a detailed exposition of one of the most practical and popular methods of proving theorems in logic, called Natural Deduction. It is presented both historically and systematically. Also some combinations with other known proof methods are explored. The initial part of the book deals with Classical Logic, whereas the rest is concerned with systems for several forms of Modal Logics, one of the most important branches of modern logic, which has wide applicability.

Natural Deduction Natural Deduction is a common name for the class of proof systems composed of simple and self-evident inference rules based upon methods of proof and traditional ways of reasoning that have been applied since antiquity in deductive practice. The first formal ND systems were independently constructed in the 1930s by G. Gentzen and S. Jaśkowski and … Continue reading Natural Deduction →.

A new type of formalization of classical first-order logic with equality is introduced on the basis of the sequent calculus. It serves to justify the claim that equality is a logical constant characterised by well-behaved rules satisfying properties usually regarded as essential. The main feature of this approach is the application of sequents built not only from formulae but also from terms. Two variants of sequent calculus are examined, a structural and a logical one. The former is defined in accordance (...) with Dos̆en’s criteria for logical constants. The latter is a standard Gentzen’s sequent calculus and satisfies Hacking’s criteria for logicality, including cut elimination. It is also shown that provided rules are harmonious in the sense advocated by Gratzl and Orlandelli. (shrink)

The paper presents a uniform proof-theoretic treatment of several kinds of free logic, including the logics of existence and definedness applied in constructive mathematics and computer science, and called here quasi-free logics. All free and quasi-free logics considered are formalised in the framework of sequent calculus, the latter for the first time. It is shown that in all cases remarkable simplifications of the starting systems are possible due to the special rule dealing with identity and existence predicate. Cut elimination is (...) proved in a constructive way for sequent calculi adequate for all logics under consideration. (shrink)

We examine some extensions of the constructive propositional logic with strong negation in the setting of varieties of $\mathcal{N}$ -lattices. The main aim of the paper is to give a description of all pretabular, primitive and preprimitive varieties of $\mathcal{N}$ -lattices.

The paper consists of two parts, outlined in the title.I. In the historical science time appears as an element of the historian’s workshop. The historian collects source information, evaluates them and assigns respective dates. Only on the ground of thus “processed” sources may he reproduce the past: events and longer development processes, setting them in time. This dated time is understood colloquially as something objective, which runs one way and may be measured.II. A historian who studies the past reality depends (...) on the extent to which those sources are preserved. As a result of their interpretation, with the use of increasingly excellent research methods, he reproduces that reality. He must carry out an ongoing selection of historical facts found. This exposes him to temptations of such selection of those facts so as to adjust the historical knowledge to serve well the national interests, his own political opinions, etc. In this way the historian exerts influence on social awareness, which may consists of various myths and stereotypes, which sometimes lead to negative social behaviors: aggression, chauvinism, etc. Therefore, for researcher honesty’s sake and in the sense of moral responsibility, he must be careful to be as impartial as possible in his work. (shrink)

Nicolae Iorga jest postacią o dużym znaczeniu w historii i kulturze Rumunii. Bardzo często wypowiadał się o sprawach polskich w szerokim tego słowa znaczeniu, zarówno w kwestiach akademickich, jak i politycznych. Zaangażowanie Iorgi w Polskę jest widoczne niemal nieprzerwanie w trakcie jego kariery naukowej i politycznej. Od czasów szkolnych po jego tragiczną śmierć Polska i jej sprawy były obecne w jego działalności także za sprawą jego nauczycieli, profesorów czy późniejszych partnerów politycznych. Dzięki wykształceniu historycznemu Iorga postrzegał Polskę jako ważnego partnera (...) Rumunii na arenie międzynarodowej, jako gwarancję bezpieczeństwa politycznego, ale także ważnego partnera w kontekście rozwoju kulturalnego. Jako inicjator kursów języka i kultury rumuńskiej na Uniwersytecie Jagiellońskim, Nicolae Iorga otrzymał tytuł doktora honoris causa Uniwersytetu Wileńskiego w 1931 r. za ważną rolę w umacnianiu stosunków między Polską a Rumunią. (shrink)

In several applications of sequent calculi going beyond pure logic, an introduction of suitably defined rules seems to be more profitable than addition of extra axiomatic sequents. A program of formalization of mathematical theories via rules of special sort was developed successfully by Negri and von Plato. In this paper a general theorem on possible ways of transforming axiomatic sequents into rules in sequent calculi is proved. We discuss its possible applications and provide some case studies for illustration.

This paper is concerned with n-localization property introduced by Newelski and Rosłanowski in [10] and getting it for CS iterations of forcing notions.

Hypersequent calculus, developed by A. Avron, is one of the most interesting proof systems suitable for nonclassical logics. Although HC has rather simple form, it increases significantly the expressive power of standard sequent calculi. In particular, HC proved to be very useful in the field of proof theory of various nonclassical logics. It may seem surprising that it was not applied to temporal logics so far. In what follows, we discuss different approaches to formalization of logics of linear frames and (...) provide a cut-free HC formalization ofKt4.3, the minimal temporal logic of linear frames, and some of its extensions. The novelty of our approach is that hypersequents are defined not as finite sets but as finite lists of ordinary sequents. Such a solution allows both linearity of time flow, and symmetry of past and future, to be incorporated by means of six temporal rules. Extensions of the basic calculus with simple structural rules cover logics of serial and dense frames. Completeness is proved by Schütte/Hintikka-style argument using models built from saturated hypersequents. (shrink)

The paper contains an exposition of some non standard approach to gentzenization of modal logics. The first section is devoted to short discussion of desirable properties of Gentzen systems and the short review of various sequential systems for modal logics. Two non standard, cut-free sequent systems are then presented, both based on the idea of using special modal sequents, in addition to usual ones. First of them, GSC I is well suited for nonsymmetric modal logics The second one, GSC II (...) is devised specially for symmetric, i.e. Blogics. GSC I and GSC II are not different formalizations, from the theoretical point of view GSC I may be seen as a simplification of the more general approach present in GSC II. They are considered separately, mainly because Blogics demand different, and more complicated, strategy in completeness proof, whereas non symmetric logics are easily and uniformly characterised by means of Fitting's Consistency Properties. The weakest modal logic captured by this formalization is minimal regular logic C, but many stronger logics are obtainable by addition of suitable structural rules, which conforms to Do en's methodology. Both variants of GSC satisfy also other, besides cut-freedom, desirable properties. (shrink)

We provide an application of a sequent calculus framework to the formalization of definite descriptions. It is a continuation of research undertaken in [20, 22]. In the present paper a so-called free description theory is examined in the context of different kinds of free logic, including systems applied in computer science and constructive mathematics for dealing with partial functions. It is shown that the same theory in different logics may be formalised by means of different rules and gives results of (...) varying strength. For all presented calculi a constructive cut elimination is provided. (shrink)