The aim of the article is to outline the historical background and the present state of the methodology of deductive systems invented by Alfred Tarski in the thirties. Key notions of Tarski's methodology are presented and discussed through, the recent development of the original concepts and ideas.

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)

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.

I ON THE PRIMITIVE TERM OF LOGISTICf IN this article I propose to establish a theorem belonging to logistic concerning some connexions, not widely known, ...

The general aim of this book is to provide an elementary exposition of some basic concepts in terms of which both classical and non-dassicallogirs may be studied and appraised. Although quantificational logic is dealt with briefly in the last chapter, the discussion is chiefly concemed with propo gjtional cakuli. Still, the subject, as it stands today, cannot br covered in one book of reasonable length. Rather than to try to include in the volume as much as possible, I have put (...) emphasis on some selected topics. Even these could not be roverrd completely, but for each topic I have attempted to present a detailed and precise t’Xposition of several basic results including some which are non-trivial. The roots of some of the central ideas in the volume go back to J. Luka siewicz’s seminar on mathematicallogi. (shrink)

Thirty years after the conference that gave rise to The Structure of Scientific Theories, there is renewed interest in the nature of theories and models. However, certain crucial issues from thirty years ago are reprised in current discussions; specifically: whether the diversity of models in the science can be captured by some unitary account; and whether the temporal dimension of scientific practice can be represented by such an account. After reviewing recent developments we suggest that these issues can be accommodated (...) within the partial structures formulation of the semantic or model-theoretic approach. (shrink)

In the literature the work of C. Piron on OQL, “the operational quantum logic of the Geneva School”, has a few times been criticised. Those criticisms were often due to misunderstandings, as has already been pointed out in [19]. In this paper we follow the line of defense in favour of OQL by replying to the criticisms formulated some time ago in [4] and [17]. In order for the reader to follow our argumentation, we briefly analyze the basic conceptual machinery (...) of OQL. (shrink)

Provability, Computability and Reflection.

I present an annotated development of the basic ideas of the Geneva School approach to the foundations of physics and the structures which emerge as mathematical representations of the physically dual notions of state and property.

I present an annotated development of the basic ideas of the Geneva School approach to the foundations of physics and the structures which emerge as mathematical representations of the physically dual notions of state and property.

In this paper, we present three main results on orthologics. Firstly, we give a sufficient condition for an orthologic to have variable separation property and show that the orthomodular logic has this property. Secondly, we show that the class of modular orthologics has an infinite descending chain. Finally we show that there exists a continuum of orthologics.

This paper is a study of similarities and differences between strong and weak quantum consequence operations determined by a given class of ortholattices. We prove that the only strong orthologics which admits the deduction theorem (the only strong orthologics with algebraic semantics, the only equivalential strong orthologics, respectively) is the classical logic.

This paper will take into account the Lindenbaum property in Orthomodular Quantum Logic (OQL) and Partial Classical Logic (PCL). The Lindenbaum property has an interest both from a logical and a physical point of view since it has to do with the problem of the completeness of quantum theory and with the possibility of extending any semantically non-contradictory set of formulas to a semantically non-contradictory complete set of formulas. The main purpose of this paper is to show that both OQL (...) and PCL cannot satisfy the Lindenbaum property. (shrink)

In this paper we consider the structure of the class FGModS of full generalized models of a deductive system S from a universal-algebraic point of view, and the structure of the set of all the full generalized models of S on a fixed algebra A from the lattice-theoretical point of view; this set is represented by the lattice FACSs A of all algebraic closed-set systems C on A such that (A, C) ε FGModS. We relate some properties of these structures (...) with tipically logical properties of the sentential logic S. The main algebraic properties we consider are the closure of FGModS under substructures and under reduced products, and the property that for any A the lattice FACSs A is a complete sublattice of the lattice of all algebraic closed-set systems over A. The logical properties are the existence of a fully adequate Gentzen system for S, the Local Deduction Theorem and the Deduction Theorem for S. Some of the results are established for arbitrary deductive systems, while some are found to hold only for deductive systems in more restricted classes like the protoalgebraic or the weakly algebraizable ones. The paper ends with a section on examples and counterexamples. (shrink)

First, we prove that the lattice of all structural strengthenings of a given strongly finite consequence operation is both atomic and coatomic, it has finitely many atoms and coatoms, each coatom is strongly finite but atoms are not of this kind — we settle this by constructing a suitable counterexample. Second, we deal with the notions of hereditary: algebraicness, strong finitisticity and finite approximability of a strongly finite consequence operation. Third, we formulate some conditions which tell us when the lattice (...) of all structural strengthenings of a given strongly finite consequence operation is finite, and subsequently we give some applications of them. (shrink)

Da Costa and French explore the consequences of adopting a 'pragmatic' notion of truth in the philosophy of science. Their framework sheds new light on issues to do with belief, theory acceptance, and the realism-antirealism debate, as well as the nature of scientific models and their heuristic development.

In this paper, we present the fundamentals of the so-called algebraic approach to propositional quantum logics. We define the set of formulae describing quantum reality as a free algebra freely generated by the set of quantum proportional variables. We define the general notion of logic as a structural consequence operation. Next, we introduce the concept of logical matrices understood as a model of quantum logics.We give the definitions of two quantum consequence operations defined in these models.

In the present note we continue the investigations undertaken in [2]. A full version of the paper has been submitted to Studia Logica. x1 Our goal is to give a characterization of the so called factorial matrices for a logic. A matrix M = is factorial i the greatest congruence M of M coincides with the diagonal of A. Recall that is a congruence of a matrix M = i is a congruence of the algebra A and for any a; (...) b 2 A, if ab then a 2 D i b 2 D. (shrink)