Skip to main content
Log in

Key notions of Tarski's methodology of deductive systems

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ajdukiewicz, Kazimierz (1928) Glówne Zasady Metodologii Nauk i Logiki Formalnej [Main Principles of the Methodology of the Sciences and of Formal Logic], Warszawa.

  • Anderson, A.R. and Belnap, Nuel D. Jr. (1975) Entailment, Vol. I. The Logic of Relevance and Necessity, Princeton University Press Princeton, N.J.-London

    Google Scholar 

  • Baker, K. R. (1977) Finite equational bases for finite algebras in a congruence-distributive equational class, Advances in Mathematics, Vol. 24, pp. 207–243.

    Google Scholar 

  • de Bakker, J. W. and Scott, Dana (1969) A theory of programs in outline of join work by J. W. Bakker and Dana Scott (manuscript), Vienna.

  • Balcar, B. and Franěk, F. (1982) Independent families in complete Boolean algebras, Transactions of the American Mathematical Society, Vol. 274, pp. 607–618.

    Google Scholar 

  • Barwise, Jon (1981) Scenes and other situations, The Journal of Philosophy, Vol. 78, No. 7, pp. 369–397.

    Google Scholar 

  • Beil, J. L. and Slomson, A. B. (1969) Models and Ultraproducts, North-Holland, Amsterdam.

    Google Scholar 

  • Van Benthem, Johan (1983) A linguistic turn: new directions in logic, to appear in Proceedings of the 7 thInternational Congress of Logic, Methodology and Philosophy of Science, Salzburg.

  • Van Benthem, Johan (1984) Correspondence theory, in: Handbook of Philosophical Logic, Vol. II, D. Gabbay and F. Guenthores (eds.), D. Reidel, Dordrecht, pp. 167–247.

    Google Scholar 

  • van Benthem, Johan (1985) The variety of consequence, according to Bolzano, this issue, pp. 389–403.

  • Beth, Evert W. (1949) Towards an up-to-date philosophy of the natural sciences, Methods, Vol. 1, pp. 178–185.

    Google Scholar 

  • Beth, Evert W. (1960) Semantics of physical theories, Synthese, Vol. 12, pp. 172–175.

    Google Scholar 

  • Biela, Andrzej (1976) On the so-called Tarski's property in the theory of Lindenbaum's oversystems, Part I. Non-finitely axiomatizable systems, Reports on Mathematical Logic 7, pp. 3–20.

    Google Scholar 

  • Biela, Andrzej (1981) On the so-called Tarski's property in the theory of Lindenbaum's oversystems, Part II. Axiomatizable systems, Reports on Mathematical Logic 11, pp. 13–48.

    Google Scholar 

  • Birkhoff, Garett (1935) On the structure of abstract algebras, Proceedings of the Cambridge Philosophical Society, Vol. 31, pp. 433–454.

    Google Scholar 

  • Bloom, Stephen L. (1975) Some theorems on structural consequence operations, Studia Logica, Vol. 34, No. 1, pp. 1–9.

    Google Scholar 

  • Bolzano, Bernard (1837) Wissenschaftslehre, Versuch einer ausführlichen und grösstenteils neuen Darstellung der Logik mit steter Rücksicht auf deren bisherige Bearbeiter, 4 vols., Seidel Buchhandlung.

  • Boole, George (1854) An Investigation of the Laws of Thought, on which are Founded the Mathematical Theories of Logic and Probabilities, London, reprinted New York 1951.

  • Carnap, Rudolf (1934) Logische Syntax der Sprache, Wien.

  • Carnap, Rudolf (1935) Ein Gültigkeitskriterium für die Sätze der klassischen Mathematik, Monatshefte für Mathematik und Physik, Vol. 42, pp. 163–190.

    Google Scholar 

  • Carnap, Rudolf (1942) Introduction to Semantics, Harvard University Press, Harvard.

    Google Scholar 

  • Chang, C. C. and Keisler, Jerome H. (1966) Continuous Model Theory, Princeton University Press, Princeton, N. J.

    Google Scholar 

  • Chang, C. C. and Keisler, Jerome H. (1973) Model Theory, North-Holland and American Elsevier, Amsterdam/London and New York.

    Google Scholar 

  • Curry, Haskell B. (1939) A note on the reduction of Gentzen's calculus LJ, Bulletin of the American Mathematical Society 45.

  • Czelakowski, Janusz (1980) Model-theoretic Methods in the Methodology of Propositional Calculi, Polish Academy of Sciences, Institute of Philosophy and Sociology, Warszawa.

  • Czelakowski, Janusz (1983) Some theorems on structural entailment relations, Studia Logica, Vol. 42, No. 4, pp. 417–429.

    Google Scholar 

  • Dzik, Wojciech (1982) On the contents of lattices of logics. Part II. Reports on Mathematical Logic 14, pp. 29–47.

    Google Scholar 

  • Dziobiak, Wiesław (1980) Silnie finitystyczne operacje konsekwencji. Teorie równościowe skońcsonych algebr — pewne ich kratowe badania [Strongly Finite Consequence Operations. Equational Theories of Finite Algebras — Their Lattice-Theoretic Investigation]. Doctoral dissertation (mimeographed).

  • Dziobiak, Wiesław (1981) The lattice of strengthenings of a strongly finite consequence operation, Studia Logica, Vol. 40, No. 2, pp. 177–194.

    Google Scholar 

  • Feferman, Salomon (1952) Review of Rasiowa and Sikorski (1950), The Journal of Symbolic Logic, Vol. 17, p. 72.

    Google Scholar 

  • Van Fraassen, Bas C. (1966) Singular terms, truth-value gaps, and free logic, Journal of Philosophy, Vol. 63, pp. 481–495.

    Google Scholar 

  • Van Fraassen, Bas C. (1970) On the extension of Beth's semantics of physical theories, Philosophy of Science, Vol. 37, pp. 325–339.

    Google Scholar 

  • Van Fraassen, Bas C. (1973) Formal Semantics and Logic, The Macmillan Company, New York.

    Google Scholar 

  • van Fraassen, Bas C. (1975) A formal approach to the philosophy of sciences, in: Paradigms and Paradoxes, R. Colodny (ed.), Pittsburg.

  • Gentzen, Gerhard (1934–5) Untersuchungen über das logische Schliessen, Mathematische Zeitschrift, Vol. 39, pp. 176–210, 405–431.

    Google Scholar 

  • Gödel, Kurt (1930) Die Vollständigkeit der Axiome des logischen Funktionenkalküls, Monatshefte für Mathematik und Physik, Vol. 37, pp. 349–360.

    Google Scholar 

  • Gödel, Kurt (1931) Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, Monatshefte für Mathematik und Physik, Vol. 38, pp. 173–198.

    Google Scholar 

  • Grätzer, George (1968) Universal Algebra, Van Nostrand, Princeton, N.J.

    Google Scholar 

  • Grzegorczyk, Andrzej (1972) An approach to logical calculus, Studia Logica, Vol. 30, pp. 33–41.

    Google Scholar 

  • Halmos, Paul R. (1962) Algebraic Logic, Chelsea Publishing Co., New York.

    Google Scholar 

  • Henkin, Leon and Tarski, Alfred (1961) Cylindric algebras, in: Lattice Theory, R. P. Dilworth (ed.), Proceedings of Symposia in Pure Mathematics, Vol. 2, American Mathematical Society, Providence, Rhode Island, pp. 83–113.

    Google Scholar 

  • Herbrand, Jacques (1931) Recherches sur la théorie de la démonstration (thése), Travaux de la Société des Sciences et des Lettres de Varsovie, Vol. 33, Cl. III, pp. 35–153.

    Google Scholar 

  • Hertz, P. (1929) Über Axiomensystem für beliebige Satzsysterme, Mathematische Annalen, Vol. 101, pp. 457–514.

    Google Scholar 

  • Horn, Alfred (1962) The separation theorem of intuitionist propositional calculus, The Journal of Symbolic Logic, Vol. 27, No. 4, pp. 391–399.

    Google Scholar 

  • Janssen, Theo (1983) Foundations and Applications of Montague Grammar, Mathematical Center Publications, Amsterdam.

    Google Scholar 

  • Jaśkowski, Stanisław (1934) On the rules of suppositions in formal logic, Studia Logica, Warszawa, pp. 1–34.

  • Jaśkowski, Stanisław (1936) Recherches sur le système de la logique intuitioniste, Actes du Congrès International de Philosophie Scientifique, Vol. 6 Philosophie des mathématiques, Actualites scientifiques et inductrielles 393, Hermann and Cie., Paris, pp. 58–61.

    Google Scholar 

  • Jech, T. (1973) The Axiom of Choice, North-Holland, Amsterdam.

    Google Scholar 

  • Jónsson, Bjarni and Tarski, Alfred (1951) Boolean algebras with operators, I. American Journal of Mathematics, Vol. 73, pp. 891–939.

    Google Scholar 

  • Kanger, Stig (1957) Provability in logic, Acta Universitatis Stockholmiensis, Studies in Philosophy 1, Stockholm, pp. 1–47.

    Google Scholar 

  • Karp, Carol (1964) Languages with Expressions of Infinite Length, North-Holland, Amsterdam.

    Google Scholar 

  • Keisler, Jerome H. (1961) Ultraproducts and elementary classes, Koninkl. Ned. Akad. Wetensch. Proc. Ser. A, Vol. 64 (= Indagationes Mathematicae, Vol. 23), pp. 477–495.

    Google Scholar 

  • Keisler, Jerome H. (1971) Model Theory for Infinitary Logic, North-Holland, Amsterdam.

    Google Scholar 

  • Kleene, Stephen C. (1938) On notation for ordinal numbers, Journal of Symbolic Logic, Vol. 3, pp. 150–155.

    Google Scholar 

  • Kleene, Stephen C. (1952) Introduction to Metamathematics, North-Holland, Noordhoff and Van Nostrand, Amsterdam, Groningen, New York and Toronto.

    Google Scholar 

  • Kripke, Saul (1959) A completeness theorem in modal logic, Journal of Symbolic Logic, Vol. 24, pp. 1–14.

    Google Scholar 

  • Kripke, Saul (1975) Outline of a theory of truth, The Journal of Philosophy, Vol. 72, No. 19, pp. 690–716.

    Google Scholar 

  • Leśniewski, Stanisław (1929) Grundzüge eines neuen Systems der Grundlagen der Mathematik, §§. 1–11, Fundamenta Mathematicae, Vol. 14, pp. 1–81.

    Google Scholar 

  • Lewis, Clarence Irving and Langford, Cooper Harold (1932) Symbolic Logic, The Century Co., New York and London.

    Google Scholar 

  • Löwenheim, Leopold (1915) Über Möglichkeiten im Relativalkül, Mathematische Annalen, Vol. 76, pp. 447–470.

    Google Scholar 

  • Lyndon, Roger C. (1951) Identities in two-valued calculi, Translations of the American Mathematical Society, Vol. 71, pp. 457–465.

    Google Scholar 

  • Łoś, Jerzy (1949) O matrycach logicznych [On the logical matrices], Travaux de la Société des Sciences et des Lettres de Wroclaw, Series B, No. 19, Wrocław.

  • Łoś, Jerzy (1954) On the categoricity in power of elementary deductive systems and some related problems, Colloquium Mathematicum 3, pp. 58–62.

    Google Scholar 

  • Łoś, Jerzy (1955) On the extending of models I, Fundamenta Mathematicae, Vol. 42, pp. 38–54.

    Google Scholar 

  • GelaiŁoé, Jerzy and Suszko, Roman (1958) Remarks on sentential logics, Indagationes Mathematicae, Vol. 20, pp. 177–183.

    Google Scholar 

  • GelaiŁukasiewicz, Jan and Tarski, Alfred (1930) Untersuchungen über den Aussagenkcalkül, Comptes Rendus des Séances de la Société des Sciences et des Lettres de Varsovie, Vol. 23, CL. III, pp. 30–50, English translation in: Tarski (1956), pp. 38–59.

    Google Scholar 

  • Makinson, David (1969) On the number of ultrafilters of an infinite Boolean algebra, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, Band 15, Heft (2), pp. 121–122.

    Google Scholar 

  • Makinson, David (1976) A characterization of structural completeness of a structural consequence operations, Reports on Mathematical Logic 6, pp. 99–102.

    Google Scholar 

  • Malcev, Anatolii I. (1936) Untersuchungen aus dem Gebiete der mathematischen Logic, Matematičeskii Sbornik, Vol. 1, pp. 323–336.

    Google Scholar 

  • Malinowski, Grzegorz (1977) Classical characterization of m-valued Łukasiewicz calculi, Reports on Mathematical Logic, Vol. 9, pp. 41–45.

    Google Scholar 

  • Malinowski, Grzegorz (1978) A proof of Ryszard Wójcicki's conjecture, Bulletin of the Section of Logic, Polish Academy of Sciences, Vol. 7, pp. 20–25.

    Google Scholar 

  • Malinowski, Grzegorz (1979) Topics in the Theory of Strengthenings of Sentential Calculi, Polish Academy of Sciences, Institute of Philosophy and Sociology, Warszawa.

    Google Scholar 

  • McKinsey, J. C. C. and Tarski, Alfred (1946) On closed elements in closure algebras, Annals of Mathematics 47, pp. 122–162.

    Google Scholar 

  • McKinsey, J. C. C. and Tarski, Alfred (1948) A Decision Method for Elementary Algebra and Geometry, 2nd ed., Berkeley Los Angeles.

  • McKinsey, J. C. C. and Tarski, Alfred (1948a) Some theorems about the sentential calculi of Lewis and Heyting, Journal of Symbolic Logic, Vol. 13, pp. 1–15.

    Google Scholar 

  • Moh, Shaw Kwei (1954) Logical paradoxes for many-valued systems, Journal of Symbolic Logic, Vol. 19. pp. 37–40.

    Google Scholar 

  • Monk, Donald (1961) Studies in Cylindric Algebras, Doctoral Dissertation, University of California, Berkeley.

    Google Scholar 

  • Montague, Richard (1962) Deterministic theories, in: Decisions Values and Groups, E. Washburne (ed.), Oxford. Reprinted in: Montague (1974).

  • Montague, Richard (1968) Pragmatism, in: Contemporary Philosophy I. Logic and Foundations of Mathematics, R. Klibansky (ed.), La Nuova Italia Editrice, Florence, pp. 102–122.

    Google Scholar 

  • Montague, Richard (1974) Formal Philosophy, R. H. Thomason (ed.), New Haven and London, Yale University Press.

    Google Scholar 

  • Moore, E. H. (1910) Introduction to a Form of General Analysis, New Haven.

  • Mostowski, Andrzej (1937) Abzählbare Boolesche Körper und ihre Anwendung auf die allgemeine Metamathematik, Fundamente Mathematicae, Vol. 29, pp. 34–53.

    Google Scholar 

  • Mostowski, Andrzej (1957) On a generalization of quantifiers, Fundamenta Mathematicae, Vol. 44, pp. 12–36.

    Google Scholar 

  • Peirce, Charles Sanders (1885) On the algebra of logic, American Journal of Mathematics, Vol. 7, p. 191.

    Google Scholar 

  • Pogorzelski, Witold A. (1971) Structural completeness of the prepositional calculus, Bulletin de l'Académie Polonaise des Sciences. Série des Sciences Mathematiques, Astronomiques et Physiques, Vol. 17, No. 5, pp. 349–351.

    Google Scholar 

  • Pogorzelski, Witold A. and Prucnal, Tadeusz (1974) Structural completeness of the first-order predicate calculus, Bulletin de l'Académie Polonaise des Sciences. Série des Sciences Mathematiques, Astronomiques et Physiques, Vol. 22, No. 3, pp. 215–217.

    Google Scholar 

  • Pogorzelski, Witold A. and Słupecki, Jerzy (1960) Podstawowe własności systemów dedukcyjnych opartych na nieklasycznych logikach [Basic properties of deductive systems based on non-classical logics], Studia Logica, Vol. 9, pp. 163–176 (Part I); Vol. 10, pp. 77–95 (Part II).

    Google Scholar 

  • Popper, Karl (1963) Truth, rationality and the growth of scientific knowledge, in: Conjecture and Refutations, Harper Torchbooks, Harper and Row Publishers, New York/Hagerstown/San Francisco/London.

    Google Scholar 

  • Post, Emil (1921) Introduction to a general theory of elementary propositions, American Journal of Mathematics, Vol. 43, pp. 163–185.

    Google Scholar 

  • Prawitz, Dag (1965) Natural Deduction. A proof-theoretical study, Acta Universitatis Stockholmiensis, Stockholm Studies in Philosophy 3, Almqvist and Wicksell, Stockholm/Göteborg/Uppsala.

    Google Scholar 

  • Przełęcki, Marian (1969) The Logic of Empirical Theories, Routledge and Kegan Paul, London.

    Google Scholar 

  • Przełęcki, Marian and Wójcicki, Ryszard (1968–69) The problem of analicity, Synthese 19, pp. 374–379.

    Google Scholar 

  • Rasiowa, Helena (1954) Algebraic models of axiomatic theories, Fundamenta Mathematicae, Vol. 41, II, pp. 291–310.

    Google Scholar 

  • Rasiowa, Helena (1974) An Algebraic Approach to Non-Classical Logics, PWN — North-Holland, Warszawa and Amsterdam.

    Google Scholar 

  • Rasiowa, Helena and Sikorski, Roman (1950) A proof of the completeness theorem of Gödel, Fundamenta Mathematicae, Vol. 37, pp. 193–200.

    Google Scholar 

  • Rasiowa, Helena and Sikorski, Roman (1953) Algebraic treatment of the notion of satisfiability, Fundamenta Mathematicae, Vol. 40, pp. 62–95.

    Google Scholar 

  • Rasiowa, Helena and Sikorski, Roman (1963) The Mathematics of Metamathematics, Państwowe Wydawnictwo Naukowe, Warszawa.

    Google Scholar 

  • Rautenberg, Wolfgang (1981) 2-element matrices, Studia Logica, Vol. 40, No. 4, pp. 315–353.

    Google Scholar 

  • Resnikoff, I. (1965) Tout ensemble de formules de la logique classique est équivalent á un ensemble indépendant, Comptes Rendus Hebdomadaires des Séances de l'Academie des Sciences, Paris, Vol. 260, pp. 2385–2388.

    Google Scholar 

  • Rieger, Ladislav (1967) Algebraic Methods of Mathematical Logic, Academic Press, New York.

    Google Scholar 

  • Routley, Richard (1976) Every sentential logic has a two-valued worlds semantics, Logique et Analyse, Vol. 74-75-76, pp. 355–365.

    Google Scholar 

  • Schmidt, J. (1952) Über die Rolle den transfinite Schusswesen in einer allgemeinen Idealtheorie, Mathematische Nachrichten, Vol. 7, pp. 165–182.

    Google Scholar 

  • Schröder, Ernst (1890) Vorlesungen über die Algebra der Logik (exakte Logik), Vol. 1,2 (Parts 1 and 2), Vol. 3 (Part 1), Algebra und Logic der Relative, edited in part by E. Müller and B. G. Teubner, Leipzig.

  • Schröter, Karl (1952) Deduktive abgeschlossene Mengen ohne Basis, Mathematische Nachrichten, Vol. 7, pp. 293–304.

    Google Scholar 

  • Scott, Dana (1970) Advice on modal logic, in: Philosophical Problems in Logic, Karel Lambert (ed.), D. Reidel, Dordrecht, pp. 143–173.

    Google Scholar 

  • Scott, Dana (1971) On engendring an illusion of understanding, The Journal of Philosophy, Vol. 68, pp. 787–807.

    Google Scholar 

  • Scott, Dana (1973) Background to formalization, in: Truth, Syntax and Modality, H. Leblanc (ed.), North-Holland, Amsterdam, London, pp. 244–273.

    Google Scholar 

  • Scott, Dana (1974) Completeness and axiomatizability in many valued logics, Proceedings of Tarski Symposium, American Mathematical Society, Providence, Rhode Island, pp. 411–436.

    Google Scholar 

  • Scott, Dana and Strachey, Ch. (1970) Toward a Mathematical Semantics for Computer Languages, PBG-4 Technical Monograph, Oxford University.

  • Scott, Dana and Tarski, Alfred (1958) The sentential calculus with infinitely long expressions, Colloquium Mathematicum, Vol. 6, pp. 165–170.

    Google Scholar 

  • Segerberg, Krister (1982) Classical Propositional Operators, Clarendon Press, Oxford.

    Google Scholar 

  • Sheffer, H. M. (1921) The General Theory of Notational Relativity, Cambridge Mass.

  • Shelah, Saharon (1971) Every two elementarily equivalent models have isomorphic ultrapowers, Israel Journal of Mathematics, Vol. 10, No.2, pp. 224–233.

    Google Scholar 

  • Shoesmith, D. J. and Smiley, T. J. (1978) Multiple-Conclusion Logic, Cambridge University Press, Cambridge.

    Google Scholar 

  • Skolem, Thoralf (1920) Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einen Theorem über dichte Mengen, Skrifter utgitt av Videnskapsselskapet i Kristiania, I. Mat. Naturv. KL. 4.

  • Smullyan, Raymond M. (1968) First-order Logic, Springer-Verlag, New York.

    Google Scholar 

  • Suppes, Patrick (1961) A comparison of the meaning and uses of models in mathematics and the empirical sciences, in: The Concept and the Role of Model in Mathematics and Natural and Social Science, B. H. Kazemier, D. Vysje (eds.), Proceedings of the Colloquium sponsored by the Division of Philosophy of Sciences of the International Union of History and Philosophy of Sciences organized at Utrecht, January 1960, D. Reidel, Dordrecht, pp. 163–177.

    Google Scholar 

  • Suppes, Patrick (1979) Logical inference in English: A preliminary analysis, Studia Logica, Vol. 38, No. 4, pp. 375–391.

    Google Scholar 

  • Suszko, Roman (1957) Logika formalna a niektóre zagadnienia teorii poznania [Formal logic and some problems of the theory of knowledge], Myśl Filozoficzna 2 (28), pp. 27–56 and 3 (29), pp. 34–67.

    Google Scholar 

  • Suszko, Roman (1968) Formal logic and the development of knowledge, in: Problems in the Philosophy of Science, I. Lakatos and A. Musgrave (eds.), Proceedings of the International Colloquium in the Philosophy of Science, London, 1965, Vol. 1, North-Holland, Amsterdam, pp. 210–222.

    Google Scholar 

  • Suszko, Roman (1974) A note on intuitionistic sentential calculus (ISC), Bulletin of the Section of Logic, Polish Academy of Sciences, Vol. 3, No. 1, pp. 20–21.

    Google Scholar 

  • Suszko, Roman (1975) Remarks on Łukasiewicz's three-valued logic, Bulletin of the Section of Logic, Polish Academy of Sciences, Vol. 4, No. 3, pp. 87–90.

    Google Scholar 

  • Suszko, Roman (1977) The Fregean Axiom and Polish Mathematical Logic in the 1920 s, Studia Logica, Vol. 36, No. 4, pp. 377–380.

    Google Scholar 

  • Tarski, Alfred (1930) Über einige fundamentale Begriffe der Metamathematik, Comptes Rendus des séances de la Société des Sciences et des Lettres de Varsovie, Vol. 23, Cl. III, pp. 22–29. English translation in: Tarski (1956), pp. 30–37.

    Google Scholar 

  • Tarski, Alfred (1930a) Fundamentale Begriffe der Methodologie der deduktiven Wissenschaften I, Monatshefte für Mathematik und Physik, Vol. 37, pp. 361–404. English translation in: Tarski (1956), pp. 60–109.

    Google Scholar 

  • Tarski, Alfred (1931) Sur les ensembles définissables de nombres réels I, Fundamenta Mathematicae, Vol. 17, pp. 210–239. English translation in: Tarski (1956), pp. 110–142.

    Google Scholar 

  • Tarski, Alfred (1933) Pojęcie prawdy w językach nauk dedukcyjnych [On the concept of truth in languages of deductive sciences], Travaux de la Société des Sciences et des Lettres de Varsovie, Cl. III. Reprinted as The concept of truth in formalized languages in Tarski (1956), pp. 152–278.

  • Tarski, Alfred (1933a) Einige Betrachtungen über die Begriffe ω-Widerspruchsfreiheit und der ω-Vollständigkeit, Monatshefte für Mathematik und Physik, Vol. 40, pp. 97–112. English translation in Tarski (1956), pp. 279–295.

    Google Scholar 

  • Tarski, Alfred (1934–5) Über die Erweiterungen der unvollosträdingen Systeme des Aussagenkalküls, Ergebnisse eines mathematischen Kolloquiums, Fasc. 7, pp. 51–57. English translation in Tarski (1956), pp. 393–400.

  • Tarski, Alfred (1935–6) Grundzüge des Systemenkalküls, Fundamenta Mathematicae, Vol. 25, pp. 503–526, Vol. 26, pp. 283–301. English, translation in Tarski (1956), pp. 342–383.

    Google Scholar 

  • Tarski, Alfred (1936) O pojęciu wynikania logicznego [On the concept of logical consequence], Przegląd Filozoficzny, Vol. 39, pp. 58–68. English translation in Tarski (1956), pp. 409–420.

    Google Scholar 

  • Tarski, Alfred (1938) Der Aussagenkalül und die Topologie, Fundamenta Mathematicae, Vol. 31, pp. 103–104. English translation in Tarski (1956), pp. 421–454.

    Google Scholar 

  • Tarski, Alfred (1944) The semantic conception of truth and the foundations of semantics, Philosophy and Phenomenological Research, Vol. 4, pp. 341–376.

    Google Scholar 

  • Tarski, Alfred (1949) Arithmetical classes and types of Boolean algebra, Preliminary Report, Bulletin of the American Mathematical Society, Vol. 55, 64, p. 1192.

    Google Scholar 

  • Tarski, Alfred (1952) Some notions and methods on the borderline of algebra and metamathematics, Proceedings of the International Congress of Mathematicians, Cambridge, Mass. 1950, Vol. 1, American Mathematical Society, Providence, Rhode Island, pp. 705–720.

    Google Scholar 

  • Tarski, Alfred (1954) Contributions to the theory of models I, II, Konink. Ned. Akad. Wetensch. Proc. Ser. A, Vol. 57 (= Indagationes Mathematicae, Vol. 16), pp. 572–588.

    Google Scholar 

  • Tarski, Alfred (1955) Contributions to the theory of models III, Konink. Ned. Akad. Wetensch. Proc. Ser. A, Vol. 58 (= Indagationes Mathematicae, Vol. 17), pp. 56–64.

    Google Scholar 

  • Tarski, Alfred (1955a) A lattice-theoretic fixpoint theorem and its applications, Pacific Journal of Mathematics, Vol. 5, pp. 285–309.

    Google Scholar 

  • Tarski, Alfred (1956) Logic, Semantics, Metamathematics, Papers from 1923 to 1938. Translated by J. H. Woodger, Oxford, Clarendon Press.

    Google Scholar 

  • Tarski, Alfred (1958) Remarks on predicate logic with infinitely long expressions, Colloquium Mathematicum, Vol. 6, pp. 171–176.

    Google Scholar 

  • Tarski, Alfred (1968) Equational logic and equational theories of algebras, in: Contributions to Mathematical Logic, K. Schütte (ed.), North-Holland, Amsterdam, pp. 275–288.

    Google Scholar 

  • Tarski, Alfred (1971) Undecidable Theories (in collaboration with Andrzej Mostowski and Raphael M. Robinson), North-Holland, Amsterdam.

    Google Scholar 

  • Tarski, Alfred (1975) An interpolation theorem for irredundant bases of closure structures, Discrete Mathematics, Vol. 12, pp. 185–192.

    Google Scholar 

  • Tarski, Alfred and Vaught, Robert (1957) Arithmetical extensions of relational systems, Composition Mathematica, Vol. 13, pp. 81–102.

    Google Scholar 

  • Tokarz, Marek (1973) Connections between some notions of completeness of structural prepositional calculi, Studia Logica, Vol. 32, pp. 77–91.

    Google Scholar 

  • Vaught, Robert (1974) Model theory before 1945, Proceedings of Tarski Symposium, American Mathematical Society, Providence, Rhode Island, pp. 153–172.

    Google Scholar 

  • Wajsberg, Mordchaj (1938) Untersuchungen über den Aussagenkalkül von A. Heyting, Wiadomości Matematyczne 46, pp. 45–101.

    Google Scholar 

  • Wójcicki, Ryszard (1970) Some remarks on the consequence operations in sentential logics, Fundamenta Mathematicae, Vol. 68, pp. 269–279.

    Google Scholar 

  • Wójcicki, Ryszard (1973) Matrix approach in methodology of sentential calculi, Studia, Logica, Vol. 32, pp. 7–39.

    Google Scholar 

  • Wójcicki, Ryszard (1974) The logics stronger than three-valued sentential calculus. The notion of degree of maximality versus the notion of degree of completeness, Studia, Logica, Vol. 33, No. 2, pp. 201–214.

    Google Scholar 

  • Wójcicki, Ryszard (1984) Lectures on Propositional Calculi, Ossolineum, Wrocław.

    Google Scholar 

  • Wroński, Andrzej (1974) On cardinalities of matrices strongly adequate for the intuitionistic propositional logics, Reports on Mathematical Logic, Vol. 3, pp. 67–72.

    Google Scholar 

  • Wroński, Andrzej (1976) On finitely based consequence operations, Studia Logica, Vol. 35, No. 4, pp. 453–458.

    Google Scholar 

  • Wroński, Andrzej (1978) Aksjomatyzacja i skończona formalizacja [Axiomatization and finite formalization], mimeo-graphed lecture delivered on a seminar at the Section of Logic, Polish Academy of Sciences.

  • Zygmunt, Jan (1984) An essay in matrix semantics for consequence relations, Acta Universitatis Wratislaviensis, No. 741, Wrocław.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Czelakowski, J., Malinowski, G. Key notions of Tarski's methodology of deductive systems. Stud Logica 44, 321–351 (1985). https://doi.org/10.1007/BF00370426

Download citation

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00370426

Keywords

Navigation